QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#141364#6515. Path Planningcy1999TL 1ms3564kbC++20541b2023-08-17 11:10:182023-08-17 11:10:19

Judging History

你现在查看的是最新测评结果

  • [2023-08-17 11:10:19]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3564kb
  • [2023-08-17 11:10:18]
  • 提交

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(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: 3564kb

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
Time Limit Exceeded

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

result: