QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #141373 | #6515. Path Planning | cy1999 | WA | 42ms | 3512kb | C++20 | 553b | 2023-08-17 11:12:36 | 2023-08-17 11:12:39 |
Judging History
answer
#include<iostream>
using namespace std;
const int N=1e6+10;
int t,n,m,c,a[N];
int px(int r){
return r/m;
}
int py(int r){
return r%m;
}
int pz(int x,int y){
return x*m+y;
}
bool check(int r){
int rx=px(r);
int ry=py(r);
int nx=px(r+1);
int ny=py(r+1);
if(rx<=nx&&ry<=ny)return true;
if(rx>=nx&&ry>=ny)return true;
return false;
}
int main(){
cin>>t;
while(t--){
cin>>n>>m;
for(int i=0;i<=n*m-1;i++)
cin>>c,a[c]=i;
int ans=0;
while(ans<=n*m-1&&check(ans))ans++;
cout<<ans+1<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3444kb
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: 42ms
memory: 3512kb
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 8 6 3 6 3 10 8 6 3 8 3 7 5 6 7 6 7 6 2 10 10 7 8 10 6 10 4 2 10 10 8 8 8 7 4 3 10 2 4 6 7 7 3 5 3 5 5 2 4 9 9 3 11 3 2 10 5 10 6 6 2 10 9 8 2 4 2 5 8 4 7 2 4 7 2 7 8 10 3 10 2 8 3 9 7 9 2 2 9 10 3 4 10 10 3 4 7 3 7 2 8 5 11 10 6 10 3 5 2 10 2 7 2 2 3 5 8 5 6 9 3 10 2 4 7 7 6 2 4 4 9 2 8 10 5 2 4 4...
result:
wrong answer 2nd numbers differ - expected: '2', found: '8'