NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #209313 | #3772. 飞行棋 | qiuqiu | 100 | 260ms | 20600kb | C++11 | 931b | 2024-08-04 09:30:21 | 2024-08-04 12:23:35 |
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize(2)
int n,m,p[1005][1005];
int dir[][2]={{1,0},{-1,0},{0,1},{0,-1}};
int vis[1005][1005];
struct node{
int x,y,step;
};
node cur;
int bfs(int x, int y){
memset(vis, 0, sizeof(vis));
queue<node> q;
vis[1][1] = true, q.push({1, 1, 0});
while (!q.empty()){
cur = q.front(), q.pop();
if (cur.x == x && cur.y == y)
return cur.step;
for (int i = 0; i < 4; i++){
int tx = cur.x + dir[i][0]*p[cur.x][cur.y], ty = cur.y + dir[i][1]*p[cur.x][cur.y];
if (tx > 0 && tx <= n && ty > 0 && ty <= m && !vis[tx][ty]){
vis[tx][ty] = true;
q.push({tx, ty, cur.step + 1});
}
}
}
return -1;
}
signed main(){
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%lld",p[i]+j);
int b=bfs(n,m);
if(b==-1) cout<<"No Solution";
else cout<<cur.step;
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Subtask #1:
score: 60
Accepted
Test #1:
score: 60
Accepted
time: 0ms
memory: 9116kb
input:
3 3 2 2 3 1 2 3 3 1 1
output:
No Solution
result:
ok 2 tokens
Test #2:
score: 0
Accepted
time: 2ms
memory: 9136kb
input:
7 3 3 3 3 5 4 7 6 7 7 6 1 3 3 4 2 1 1 4 5 1 6
output:
No Solution
result:
ok 2 tokens
Test #3:
score: 0
Accepted
time: 0ms
memory: 9140kb
input:
8 3 4 2 3 4 2 2 6 3 4 5 5 4 3 6 1 2 1 7 6 2 5 1 8 7
output:
No Solution
result:
ok 2 tokens
Test #4:
score: 0
Accepted
time: 0ms
memory: 9172kb
input:
8 6 1 1 5 5 1 7 2 1 8 8 2 8 5 3 2 5 3 2 3 4 1 2 6 2 4 4 8 7 3 3 7 2 3 7 5 3 4 1 5 7 4 8 4 7 3 3 3 2
output:
7
result:
ok "7"
Test #5:
score: 0
Accepted
time: 4ms
memory: 9168kb
input:
7 9 8 1 4 5 7 7 7 4 4 2 7 6 4 8 6 8 3 6 1 9 1 8 5 5 4 8 6 5 9 1 2 4 8 3 7 1 4 9 9 6 1 5 1 4 2 4 1 8 ...
output:
3
result:
ok "3"
Test #6:
score: 0
Accepted
time: 0ms
memory: 9176kb
input:
10 10 7 1 6 8 6 5 5 7 9 9 6 7 7 3 8 3 10 1 8 4 5 10 2 2 10 5 8 3 5 5 7 8 4 6 9 8 3 8 9 5 5 9 3 6 10 ...
output:
6
result:
ok "6"
Subtask #2:
score: 20
Accepted
Test #7:
score: 20
Accepted
time: 5ms
memory: 9656kb
input:
100 100 43 1 34 53 74 81 44 67 8 26 89 21 71 5 95 44 26 63 36 12 14 42 95 96 73 47 96 45 35 55 20 36...
output:
11
result:
ok "11"
Test #8:
score: 0
Accepted
time: 0ms
memory: 9656kb
input:
100 100 59 76 51 65 79 47 38 99 30 54 49 42 61 100 84 98 44 53 22 63 55 11 33 1 52 5 35 20 32 76 24 ...
output:
13
result:
ok "13"
Subtask #3:
score: 20
Accepted
Test #9:
score: 20
Accepted
time: 167ms
memory: 20600kb
input:
1000 1000 692 456 53 655 421 246 495 194 6 409 970 582 974 324 530 571 812 897 729 734 306 180 41 41...
output:
19
result:
ok "19"
Test #10:
score: 0
Accepted
time: 82ms
memory: 16960kb
input:
1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 ...
output:
No Solution
result:
ok 2 tokens
Extra Test:
score: 0
Extra Test Passed
