QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#73067	#5015. 树	wangjinbo	0	23ms	7724kb	C++14	1.4kb	2023-01-21 20:18:58	2023-01-21 20:19:00

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-01-21 20:19:00]
评测

测评结果：0
用时：23ms
内存：7724kb

查看

[2023-01-21 20:18:58]
提交

answer

#include<bits/stdc++.h>
#include "tree.h"
using namespace std;
const int N=1010;
vector<int> v[N];
int rt,dep[N],dis[N],w[N];
void add(int x,int y){
	v[x].push_back(y);
	v[y].push_back(x);
}
void dfs(int now,int fa){
	for(int i=0;i<v[now].size();i++){
		int u=v[now][i];if(u==fa)continue;
		dis[u]=dis[now]+1;
		dfs(u,now);
	}
}
void solver(int n,int A,int B){
	rt=rand()%n+1;//cout<<rt<<endl;
	for(int i=1;i<=n;i++){
		vector<int> p;p.push_back(i);
		dep[i]=ask(rt,p);
		if(dep[i]==1)answer(rt,i),add(rt,i);
	}
	for(int i=2;i<=n;i++){
		
		vector<int> p;
		for(int j=1;j<=n;j++)if(dep[j]==i-1)p.push_back(j);
		for(int j=0;j<p.size();j++){
			dis[p[j]]=0;dfs(p[j],0);
			for(int k=0;k<p.size();k++){
				w[p[j]]+=dis[p[k]];
			}
			w[p[j]]+=p.size();
		}
		for(int j=1;j<=n;j++)if(dep[j]==i){
			int r=ask(j,p);
			vector<int> t;int f[25]={};
			for(int k=0;k<p.size();k++)if(w[p[k]]==r)t.push_back(p[k]);
			int mn=0x3f3f3f3f,id=0;
			for(int o=0;(1<<o)<=t.size();o++){
				vector<int> tmp;
				for(int k=0;k<t.size();k++)if(((k+1)>>o)&1)tmp.push_back(t[k]);
				f[o]=ask(j,tmp);mn=min(mn,f[o]);
			}
			//cout<<j<<endl;
			for(int o=0;(1<<o)<=t.size();o++){
				if(f[o]==mn)id+=(1<<o);
			}
			//cout<<id<<endl;
			answer(j,t[id-1]);add(j,t[id-1]);
		}
	}
}
/* g++ -o grader grader.cpp tree.cpp
5 114 514
1 2
1 5
2 4
5 3
*/

源文件, 语言: C++14

详细

Subtask #1:

score: 0

Runtime Error

Test #1:

score: 0

Runtime Error

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:

Unauthorized output

result:

Subtask #2:

score: 0

Runtime Error

Test #11:

score: 0

Runtime Error

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:

Unauthorized output

result:

Subtask #3:

score: 0

Runtime Error

Test #111:

score: 20

Accepted

time: 23ms

memory: 7724kb

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

Runtime Error

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:

Unauthorized output

result:

Subtask #4:

score: 0

Runtime Error

Test #211:

score: 0

Runtime Error

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:

Unauthorized output