QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#499734 | #6723. Grid with Arrows | Umok | WA | 214ms | 17412kb | C++20 | 1.8kb | 2024-07-31 18:22:45 | 2024-07-31 18:22:45 |
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];
int f[N];
bool st[N];
int n, m, ans;
int xx(int x, int y)
{
return (x - 1) * m + y;
}
int dfs(int x, int y, int deep)
{
if (st[xx(x, y)])
return 0;
f[xx(x, y)] = 1;
if (deep == ans)
{
return 1;
}
int a = x, b = y;
if (mp[x][y] == 'u')
a -= ar[x][y];
else if (mp[x][y] == 'r')
b += ar[x][y];
else if (mp[x][y] == 'd')
a += ar[x][y];
else
b -= ar[x][y];
if (a < 1 || a > n || b < 0 || b > m)
return 0;
st[xx(x, y)] = 1;
if (dfs(a, b, deep + 1))
return 1;
st[xx(x, y)] = 0;
return 0;
}
void solve()
{
cin >> n >> m;
ans = n * m;
for (int i = 1; i <= ans; i++)
f[i] = 0;
for (int i = 1; i <= n; i++)
st[i] = 0;
for (int i = 1; i <= n; i++)
{
cin >> mp[i];
mp[i] = " " + mp[i];
}
for (int i = 1; i <= n; i++)
{
ar[i].clear();
ar[i].push_back(0);
int x;
for (int j = 1; j <= m; j++)
{
cin >> x;
ar[i].push_back(x);
f[i] = 0;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
if (f[xx(i, j)])
continue;
bool z = dfs(i, j, 1);
if (z)
{
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
}
signed main()
{
int tcase;
cin >> tcase;
while (tcase--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 8228kb
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: 214ms
memory: 17412kb
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 No No No Yes No No No No No No No No Yes No No No Yes No No No No No Yes No No No No No No No No No No Yes No Yes No No No No No No No No No No No No Yes No No No No No No Yes No No No No No No No Yes No No No No No No No No No No No No Yes No Yes No Yes No No Yes Yes No No No No...
result:
wrong answer expected YES, found NO [7th token]