QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #499563 | #6723. Grid with Arrows | Umok | WA | 74ms | 20272kb | C++20 | 2.2kb | 2024-07-31 15:45:14 | 2024-07-31 15:45:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 1e5 + 5;
#define int long long
typedef pair<int, int> PII;
#define MAX LONG_LONG_MAX
string mp[N];
vector<int> ar[N], f;
vector<int> st[N];
int n, m;
int finds(int x)
{
return f[x] == x ? f[x] : f[x] = finds(f[x]);
}
PII find(int x, int y)
{
int xx = x, yy = y;
if (mp[x][y] == 'r')
yy += ar[x][y];
else if (mp[x][y] == 'd')
xx += ar[x][y];
else if (mp[x][y] == 'l')
yy -= ar[x][y];
else
xx -= ar[x][y];
if (xx < 1 || xx > n || yy < 0 || yy > m)
return {0, 0};
return {xx, yy};
}
void solve()
{
cin >> n >> m;
int ans = n * m;
f.clear();
for (int i = 1; i <= n; i++)
{
mp[i] = "";
ar[i].clear();
st[i].clear();
}
for (int i = 1; i <= n; i++)
{
cin >> mp[i];
mp[i] = " " + mp[i];
}
for (int i = 1; i <= n; i++)
{
ar[i].push_back(0);
f.push_back(0);
st[i].push_back(0);
for (int j = 1; j <= m; j++)
{
int x;
cin >> x;
ar[i].push_back(x);
f.push_back(0);
st[i].push_back(0);
}
}
st[0].push_back(0);
for (int i = 1; i <= ans; i++)
f[i] = i;
int num = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
st[i][j] = num++;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
auto a = find(i, j);
int x = a.first, y = a.second;
if (x < 1 || y < 1)
continue;
int _ = f[st[i][j]], __ = f[st[x][y]];
if (_ == __ || _ < 1 || __ < 1)
continue;
f[finds(__)] = finds(_);
}
for (int i = 1; i <= ans; i++)
finds(i);
map<int, int> q;
for (int i = 1; i <= ans; i++)
q[f[i]]++;
if (q.size() == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int tcase;
cin >> tcase;
while (tcase--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 7560kb
input:
2 2 3 rdd url 2 1 1 1 1 2 2 2 rr rr 1 1 1 1
output:
Yes No
result:
ok 2 token(s): yes count is 1, no count is 1
Test #2:
score: -100
Wrong Answer
time: 74ms
memory: 20272kb
input:
1109 5 8 rddddldl drruludl rrldrurd urrrlluu uurrulrl 4 4 1 2 4 3 1 6 1 3 5 1 1 1 3 6 2 4 1 1 2 1 1 1 2 3 4 2 4 3 3 3 4 1 1 2 2 5 1 5 7 9 rdrddrdll urrdruldl ruullrulu drrlrlddl rrrdddlll ruulururl ruurrlluu 7 1 1 1 2 1 2 3 6 1 7 3 1 3 1 2 1 8 2 2 1 2 4 3 1 2 2 2 2 4 1 1 5 3 3 1 3 4 6 1 2 1 2 7 7 6 ...
output:
Yes No No No Yes No Yes Yes Yes Yes No No No Yes Yes No Yes No Yes No No No Yes Yes No Yes Yes No Yes No No Yes No No Yes Yes Yes No No Yes Yes Yes Yes Yes No Yes No Yes Yes No Yes No Yes No Yes Yes No No Yes No Yes Yes Yes Yes No Yes Yes No Yes Yes No No Yes Yes No No Yes Yes No No Yes Yes Yes Yes ...
result:
wrong answer expected NO, found YES [43rd token]