Repository navigation
Expand file tree
/
Copy pathFightbots.cpp
More file actions
101 lines (85 loc) · 1.77 KB
/
Copy pathFightbots.cpp
File metadata and controls
101 lines (85 loc) · 1.77 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define optimize()\
ios_base::sync_with_stdio(0);\
cin.tie(0);\
cout.tie(0);
#define fraction()\
cout.unsetf(ios::floatfield);\
cout.precision(10);\
cout.setf(ios::fixed, ios::floatfield);
#define file()\
freopen("input.txt", "r", stdin);\
freopen("output.txt", "w", stdout);
typedef long long ll;
typedef vector < int > vi;
typedef vector < ll > vl;
typedef vector < vi > vvi;
typedef vector < vl > vvl;
typedef pair < int, int > pii;
typedef pair < double, double > pdd;
typedef pair < ll, ll > pll;
typedef vector < pii > vii;
typedef vector < pll > vll;
typedef double dl;
#define endl '\n'
#define PB push_back
#define coy cout << "YES" << endl;
#define con cout << "NO" << endl;
#define ain(A, NN)\
for (ll I = 0; I < NN; I++)\
cin >> A[I]
using namespace std;
int main()
{
optimize();
int t;
cin >> t;
while (t--) {
ll n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
ll a = 0, b = 0;
bool flag = false;
for (int i = 1; i <= n; i++)
{
if (s[i - 1] == 'U')
{
b++;
}
else if (s[i - 1] == 'D')
{
b--;
}
else if (s[i - 1] == 'L')
{
a--;
}
else
{
a++;
}
ll d = abs(x - a) + abs(y - b);
if (d <= i && d % 2 == i % 2)
{
flag = true;
break;
}
}
if (flag)
{
coy;
}
else
{
con;
}
}
return 0;
}