diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-02-22 20:18:04 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-02-22 20:18:04 +0200 |
| commit | ef9dfb5d8bfa705a0c056a2652d298e5ebb763fb (patch) | |
| tree | a3ae50170dcaa0982a2680fb9df2c1a8ec179bb4 /contests/Round#849(Div4)/B/main.cpp | |
| parent | 6fd4c8747f798b62428ca020171596b8636a7a4c (diff) | |
| download | competitive-programming-ef9dfb5d8bfa705a0c056a2652d298e5ebb763fb.tar.xz competitive-programming-ef9dfb5d8bfa705a0c056a2652d298e5ebb763fb.zip | |
Solved a bunch of problems
Diffstat (limited to 'contests/Round#849(Div4)/B/main.cpp')
| -rwxr-xr-x | contests/Round#849(Div4)/B/main.cpp | 122 |
1 files changed, 122 insertions, 0 deletions
diff --git a/contests/Round#849(Div4)/B/main.cpp b/contests/Round#849(Div4)/B/main.cpp new file mode 100755 index 0000000..da40ca0 --- /dev/null +++ b/contests/Round#849(Div4)/B/main.cpp @@ -0,0 +1,122 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +struct Point { + int x; + int y; + Point(int x, int y) { + this->x = x; + this->y = y; + } +}; + +void solve() { + Point p(0, 0); + int n; + cin >> n; + string str; + cin >> str; + for (auto ch: str) { + if(ch == 'U') { + p.y++; + } + else if(ch == 'D') { + p.y--; + } + else if(ch == 'R') { + p.x++; + } + else if(ch == 'L') { + p.x--; + } + + if (p.x == 1 && p.y == 1) { + cout << "YES" << '\n'; + return; + } + } + cout << "NO" << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + |
