QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#138324 | #6515. Path Planning | meomeo# | WA | 21ms | 3516kb | C++14 | 1.3kb | 2023-08-11 14:33:09 | 2023-08-11 14:33:10 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int dx[2] = {0, 1};
const int dy[2] = {1, 0};
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0 ; i < n ; i++) {
for (int j = 0 ; j < m ; j++) {
cin >> a[i][j];
}
}
int x = 0, y = 0;
set<int> s;
s.insert(a[0][0]);
while (x < n-1 || y < m - 1) {
// cout << x << " " << y << endl;
if (x + 1 < n && y + 1 < m) {
if (a[x+1][y] < a[x][y+1]) {
x += 1;
}
else {
y += 1;
}
}
else {
if (x + 1 < n) {
x += 1;
}
else {
y += 1;
}
}
s.insert(a[x][y]);
}
int res = 0;
while (s.find(res) != s.end()) {
res += 1;
}
cout << res << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3516kb
input:
2 2 3 1 2 4 3 0 5 1 5 1 3 0 4 2
output:
3 5
result:
ok 2 number(s): "3 5"
Test #2:
score: -100
Wrong Answer
time: 21ms
memory: 3460kb
input:
10000 2 9 4 0 3 5 2 7 16 11 12 9 13 14 17 10 8 15 1 6 4 8 19 23 22 13 29 4 17 26 30 6 25 3 15 24 18 14 12 8 7 9 27 5 0 10 11 16 31 20 2 28 1 21 1 6 3 2 0 1 4 5 2 3 4 2 0 3 5 1 5 1 4 0 3 2 1 1 3 1 0 2 8 10 9 50 8 0 41 57 60 30 23 65 64 21 36 12 10 5 58 19 38 67 71 52 45 17 77 4 59 51 22 25 56 49 79 2...
output:
9 0 6 3 5 3 14 13 5 9 3 7 6 9 7 0 6 7 13 9 0 0 0 0 0 7 4 0 10 1 18 0 12 3 7 6 6 1 1 5 6 1 8 4 2 5 1 5 7 13 0 10 2 10 3 6 9 8 2 3 2 3 0 0 8 4 7 7 7 8 8 6 6 5 0 7 7 0 2 3 6 0 1 3 10 2 9 7 2 2 0 0 0 0 9 0 3 1 2 5 3 8 4 10 4 0 10 4 6 5 1 4 10 6 3 5 1 0 7 1 8 0 12 0 4 0 7 5 8 3 7 9 3 0 2 4 6 0 2 10 2 1 3...
result:
wrong answer 2nd numbers differ - expected: '2', found: '0'