QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#619962	#5015. 树	HJY2022	0	11ms	7872kb	C++14	853b	2024-10-07 16:09:14	2024-10-07 16:09:14

Judging History

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

[2024-10-07 16:09:14]
评测

测评结果：0
用时：11ms
内存：7872kb

查看

[2024-10-07 16:09:14]
提交

answer

#include "tree.h"
#include<bits/stdc++.h>
using namespace std;
const int MX = 1005;
vector<int > c[MX];int dep[MX];
void solve(vector<int > A,vector<int > B){
	if(A.size() == 1){
		for(auto it : B)answer(A[0],it);
		return;
	}
	if(B.size() == 0)return;
	int p = A.size() / 2;vector<int > LA,RA,LB,RB;
	for(int i = 0;i < p;i++)LA.push_back(A[i]);
	for(int i = p;i < A.size();i++)RA.push_back(A[i]);
	int std = ask(LA[0],LA);
	for(auto it : B){
		int cur = ask(it,LA);
		if(cur == std + LA.size())LB.push_back(it);
		else RB.push_back(it);
	}
	solve(LA,LB);solve(RA,RB);
}
void solver(int n,int A,int B){
	vector<int > tmp;tmp.push_back(1);
	int mx = 0;c[0].push_back(1);
	for(int i = 2;i <= n;i++){
		dep[i] = ask(i,tmp);
		c[dep[i]].push_back(i);
		mx = max(mx,dep[i]);
	}
	for(int i = 0;i < mx;i++)solve(c[i],c[i + 1]);
}

源文件, 语言: C++14

詳細信息

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 0

Wrong Answer

time: 8ms

memory: 7840kb

input:

1000 500000 500000
1 2
2 3
2 4
2 5
2 6
3 7
2 8
5 9
5 10
9 11
2 12
9 13
4 14
5 15
12 16
5 17
4 18
4 19
13 20
9 21
19 22
7 23
6 24
14 25
2 26
10 27
14 28
21 29
17 30
8 31
15 32
9 33
22 34
24 35
20 36
6 37
12 38
19 39
31 40
35 41
25 42
11 43
8 44
9 45
12 46
26 47
10 48
6 49
27 50
39 51
33 52
6 53
43 54...

output:

Different tree

result:

wrong answer Wrong Answer

Subtask #2:

score: 0

Wrong Answer

Test #11:

score: 0

Wrong Answer

time: 0ms

memory: 4156kb

input:

100 3000 40000
66 95
66 60
66 93
66 69
66 82
66 24
66 64
66 84
66 42
66 22
66 67
66 54
66 90
66 26
66 41
66 18
66 43
66 68
66 36
66 88
66 33
66 29
66 79
66 6
66 48
66 47
66 8
66 38
66 61
69 97
64 30
38 86
88 14
18 10
54 81
88 25
29 2
18 21
95 46
42 80
93 91
61 62
68 35
47 23
69 17
93 28
18 31
61 70
...

output:

Different tree

result:

wrong answer Wrong Answer

Subtask #3:

score: 0

Wrong Answer

Test #111:

score: 20

Accepted

time: 11ms

memory: 7832kb

input:

1000 50000 3000000
126 207
937 126
615 937
837 615
500 837
588 500
505 588
353 505
60 353
904 60
656 904
685 656
460 685
614 460
551 614
537 551
858 537
596 858
9 596
738 9
918 738
322 918
940 322
859 940
113 859
110 113
312 110
995 312
443 995
246 443
257 246
238 257
999 238
885 999
976 885
330 976...

output:

areawavesuitbannerresortfatplasterdeclarationthesearejustrandomwords

result:

ok Orz..Orz..Orz..Orz..Orz

Test #112:

score: 20

Accepted

time: 3ms

memory: 7784kb

input:

1000 50000 3000000
1 2
1 3
2 4
2 5
3 6
3 7
4 8
4 9
5 10
5 11
6 12
6 13
7 14
7 15
8 16
8 17
9 18
9 19
10 20
10 21
11 22
11 23
12 24
12 25
13 26
13 27
14 28
14 29
15 30
15 31
16 32
16 33
17 34
17 35
18 36
18 37
19 38
19 39
20 40
20 41
21 42
21 43
22 44
22 45
23 46
23 47
24 48
24 49
25 50
25 51
26 52
2...

output:

areawavesuitbannerresortfatplasterdeclarationthesearejustrandomwords

result:

ok Orz..Orz..Orz..Orz..Orz

Test #113:

score: 20

Accepted

time: 9ms

memory: 7828kb

input:

1000 50000 3000000
1 2
2 3
2 4
4 5
5 6
6 7
6 8
8 9
8 10
10 11
10 12
12 13
12 14
13 15
14 16
15 17
16 18
18 19
18 20
19 21
20 22
21 23
22 24
24 25
24 26
26 27
27 28
27 29
28 30
29 31
30 32
31 33
32 34
34 35
35 36
36 37
36 38
37 39
39 40
39 41
41 42
41 43
42 44
43 45
45 46
45 47
47 48
48 49
48 50
50 5...

output:

areawavesuitbannerresortfatplasterdeclarationthesearejustrandomwords

result:

ok Orz..Orz..Orz..Orz..Orz

Test #114:

score: 20

Accepted

time: 5ms

memory: 7872kb

input:

1000 50000 3000000
1 2
1 3
2 4
2 5
3 6
3 7
4 8
4 9
5 10
5 11
6 12
6 13
7 14
7 15
8 16
8 17
9 18
9 19
10 20
10 21
11 22
11 23
12 24
12 25
13 26
13 27
14 28
14 29
15 30
15 31
16 32
16 33
17 34
17 35
18 36
18 37
19 38
19 39
20 40
20 41
21 42
21 43
22 44
22 45
23 46
23 47
24 48
24 49
25 50
25 51
26 52
2...

output:

areawavesuitbannerresortfatplasterdeclarationthesearejustrandomwords

result:

ok Orz..Orz..Orz..Orz..Orz

Test #115:

score: 20

Accepted

time: 2ms

memory: 7764kb

input:

1000 50000 3000000
31 688
31 684
31 63
31 564
31 34
31 288
31 808
31 356
31 327
31 458
31 993
31 344
31 902
31 407
31 37
31 150
31 969
31 323
31 790
31 464
31 230
31 999
31 936
31 106
31 965
31 771
31 663
31 476
31 652
31 991
31 475
31 258
31 395
31 664
31 762
31 934
31 951
31 419
31 84
31 70
31 167...

output:

areawavesuitbannerresortfatplasterdeclarationthesearejustrandomwords

result:

ok Orz..Orz..Orz..Orz..Orz

Test #116:

score: 0

Wrong Answer

time: 3ms

memory: 7872kb

input:

1000 50000 3000000
740 869
740 437
740 881
740 650
740 319
740 195
740 613
740 606
740 243
740 406
740 669
740 146
740 183
740 999
740 651
740 176
740 97
740 908
740 750
740 609
740 639
740 681
740 755
740 354
740 993
740 334
740 926
740 904
740 184
740 301
740 271
740 859
740 622
740 198
740 716
74...

output:

Different tree

result:

wrong answer Wrong Answer

Subtask #4:

score: 0

Wrong Answer

Test #211:

score: 0

Wrong Answer

time: 6ms

memory: 7856kb

input:

990 8500 300000
1 2
1 3
1 4
1 5
2 6
2 7
2 8
3 9
3 10
3 11
4 12
4 13
4 14
5 15
5 16
5 17
6 18
6 19
6 20
7 21
7 22
7 23
8 24
8 25
8 26
9 27
9 28
9 29
10 30
10 31
10 32
11 33
11 34
11 35
12 36
12 37
12 38
13 39
13 40
13 41
14 42
14 43
14 44
15 45
15 46
15 47
16 48
16 49
16 50
17 51
17 52
17 53
18 54
18...

output:

Too many queries

result:

wrong answer Wrong Answer