QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#141396#6515. Path Planningcy1999TL 2350ms11660kbC++111.1kb2023-08-17 11:35:482023-08-17 11:35:49

Judging History

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

  • [2023-08-17 11:35:49]
  • 评测
  • 测评结果:TL
  • 用时:2350ms
  • 内存:11660kb
  • [2023-08-17 11:35:48]
  • 提交

answer

#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int N=1e6+5;
int x[N],y[N];
int t;
int n,m;
vector<pair<int,int> > w;
signed main()
{
	cin>>t;
	while(t--)
	{
		int p=-1;
		w.clear();
		cin>>n>>m;
		int u1,u2;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				int a;
				cin>>a;
				x[a]=i;
				y[a]=j;
				if(i==1&&j==1)
				{
					u1=a;
				}
				if(i==n&&j==m)
				{
					u2=a;
				}
			}
		}
		w.push_back(make_pair(u1,u2));
		while(1)
		{
			int f=0;
			p++;
			if(p==n*m)
			{
				break;
			}
			int lw=w.size();
			for(int i=0;i<lw;i++)
			{
				int a=w[i].first;
				int b=w[i].second;
				if(a==-1)
				{
					continue;
				}
				if(x[p]>=x[a]&&x[p]<=x[b]&&y[p]>=y[a]&&y[p]<=y[b])
				{
					f=1;
					if(p==a||p==b)
					{	
						break;
					}
					w[i].second=w[i].first=-1;
					w.push_back(make_pair(p,b));
					w.push_back(make_pair(a,p));
					break;
				}
			}
			if(f==0)
			{
				break;
			}
		}
		cout<<p<<endl;
//		for(int i=0;i<w.size();i++)
//		{
//			cout<<"##  "<<w[i].first<<"   "<<w[i].second<<endl;
//		}
		assert(p>0&&p<=n+m-1);
	}
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 5456kb

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: 0
Accepted
time: 49ms
memory: 5504kb

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
2
6
3
5
3
14
13
5
9
5
7
6
9
7
4
6
7
13
9
10
9
6
1
5
7
4
2
10
4
18
5
12
3
7
6
9
2
1
5
6
10
8
4
2
5
2
5
7
13
6
10
2
10
3
6
9
8
3
10
2
3
3
5
8
4
7
7
7
8
8
6
6
5
3
7
7
13
3
3
6
5
4
3
10
5
12
7
2
11
6
7
5
10
9
5
3
10
2
5
3
8
7
10
5
4
10
4
6
5
9
4
10
6
3
5
4
4
7
4
8
3
12
5
4
5
8
6
8
3
7
9
3
6
12
4
6
6
6...

result:

ok 10000 numbers

Test #3:

score: 0
Accepted
time: 2350ms
memory: 5776kb

input:

100
99 83
18 2823 5680 5151 2684 3362 1063 6836 6834 7934 3158 5909 240 2112 8046 5303 905 828 6380 7747 3343 8119 3117 7501 5852 647 1289 6598 1435 4242 7890 5768 7195 2462 2667 2558 4378 6487 4762 4646 6566 3900 2991 5329 3203 3889 5008 6833 3557 1601 5516 6124 6441 311 6600 4025 3961 7575 1861 44...

output:

128
125
58
84
3
158
124
104
10
178
141
49
16
142
176
161
96
62
158
136
59
91
97
7
44
86
106
34
58
3
152
38
152
7
150
78
17
128
136
38
160
88
29
28
104
118
74
121
162
118
1243
1548
701
204
931
10000
1249
467
1752
947
863
419
597
1603
3228
1210
1481
916
10000
427
728
10000
37
10000
251
2705
606
10000
...

result:

ok 100 numbers

Test #4:

score: 0
Accepted
time: 213ms
memory: 11252kb

input:

1
1000 1000
1283 449486 175160 239276 255441 328929 747766 698005 955583 292742 137449 351560 609063 788395 493817 785822 140814 129116 248470 922611 720697 587047 952796 209319 404424 668084 289477 561080 605648 815597 173174 255440 699751 101977 71754 783062 643174 341132 283279 686934 836019 5184...

output:

1340

result:

ok 1 number(s): "1340"

Test #5:

score: 0
Accepted
time: 1169ms
memory: 11660kb

input:

1
10 100000
689191 646425 545223 281210 519035 981365 700560 96123 320469 291369 130877 221569 929695 954548 480774 735565 714873 594353 871164 643780 545198 845640 62782 16531 4650 861127 122704 476178 962959 458750 10601 32275 334992 523897 495155 312669 15958 118063 8293 817200 309588 455968 1246...

output:

19513

result:

ok 1 number(s): "19513"

Test #6:

score: -100
Time Limit Exceeded

input:

1
1 1000000
964027 632704 66395 804059 548859 444426 284847 628164 468888 888960 42544 747789 917317 43678 461194 470196 350519 775162 676379 843319 777632 978840 458784 778592 868035 284605 670109 324535 363851 771999 520817 356682 436218 216024 424504 661414 43490 761116 594749 572176 171775 84082...

output:


result: