QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#855736	#9743. 重心树	liujunyi123	AC ✓	50ms	18648kb	C++14	786b	2025-01-13 10:04:38	2025-01-13 10:04:38

Judging History

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

[2025-01-13 10:04:38]
评测

测评结果：AC
用时：50ms
内存：18648kb

查看

[2025-01-13 10:04:38]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int T,n,d[N],sz[N],fa[N],son[N],mx[N];
vector<int> g[N]; 
int gets(int u){
	if(!son[u])return u;
	int v=mx[son[u]];
	while(1){
		int res=max(sz[son[v]],sz[u]-sz[v]);
		if(res<=sz[u]/2)return v;v=fa[v];
	}
}
void merge(int u,int v){
	fa[v]=u,sz[u]+=sz[v];
	if(sz[v]>sz[son[u]])son[u]=v;
}
void solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)g[i].clear(),sz[i]=1,mx[i]=i,son[i]=0;
	for(int i=1;i<=n;i++){scanf("%d",&d[i]);
		for(int j=1,x;j<=d[i];j++)scanf("%d",&x),g[x].push_back(i);
	} 
	for(int i=n;i>1;i--){int x=gets(i);
		merge(g[x].back(),i),g[x].pop_back(),mx[i]=x;
	}
	for(int i=2;i<=n;i++)printf("%d %d\n",fa[i],i);
}
int main(){
	scanf("%d",&T);
	while(T--)solve();
	return 0;
}

源文件, 语言: C++14

这程序好像有点Bug，我给组数据试试？

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 10436kb

input:

output:

result:

ok Accepted (2 test cases)

Test #2:

score: 0

Accepted

time: 19ms

memory: 12028kb

input:

output:

result:

ok Accepted (40000 test cases)

Test #3:

score: 0

Accepted

time: 7ms

memory: 11240kb

input:

output:

result:

ok Accepted (10000 test cases)

Test #4:

score: 0

Accepted

time: 8ms

memory: 10784kb

input:

output:

result:

ok Accepted (10000 test cases)

Test #5:

score: 0

Accepted

time: 3ms

memory: 11832kb

input:

16
392
4 2 3 165 13
0
2 4 12
0
4 177 7 9 23
2 187 16
0
1 13
0
1 13
2 208 27
0
2 14 22
0
1 23
2 19 20
1 208
3 21 25 27
0
0
0
0
0
2 208 29
0
2 32 31
3 44 40 38
1 208
0
1 44
0
3 35 49 52
1 42
2 36 208
0
0
1 44
1 42
1 49
1 60
2 79 213
0
3 46 79 57
2 47 48
1 60
0
0
0
0
1 213
1 79
1 64
1 57
2 79 63
2 62 2...

output:

result:

ok Accepted (16 test cases)

Test #6:

score: 0

Accepted

time: 0ms

memory: 12064kb

input:

4
502
3 3 253 10
3 7 8 13
2 15 18
1 15
2 6 253
0
1 24
0
1 18
0
2 23 20
2 258 21
1 33
2 24 17
1 24
1 20
0
2 25 26
3 27 42 264
0
2 22 31
0
1 33
2 30 34
0
0
0
1 42
2 265 37
0
0
1 45
0
0
2 269 52
2 269 44
0
1 45
1 56
2 51 58
3 43 47 269
2 54 50
0
0
1 60
1 51
0
1 58
2 53 269
0
0
2 61 63
0
1 60
2 278 67
1...

output:

result:

ok Accepted (4 test cases)

Test #7:

score: 0

Accepted

time: 0ms

memory: 11140kb

input:

1
422
2 9 195
1 9
4 5 195 11 8
1 13
1 13
3 212 12 25
2 16 14
0
0
2 18 212
2 19 31
0
0
0
2 22 29
1 27
1 22
0
1 27
3 221 26 30
1 31
0
1 222
2 33 37
2 33 35
0
0
1 222
1 34
0
0
1 40
2 48 49
1 48
0
2 38 229
2 42 41
0
1 56
1 42
0
0
1 50
3 86 47 238
2 86 51
1 86
0
1 56
1 50
0
0
2 238 58
2 94 57
1 238
1 96
...

output:

result:

ok Accepted (1 test case)

Test #8:

score: 0

Accepted

time: 17ms

memory: 11908kb

input:

100
509
3 21 3 252
1 21
0
2 23 18
3 252 8 25
2 252 14
2 11 26
0
1 18
1 252
0
1 252
1 26
0
1 34
2 42 22
1 28
1 28
2 24 252
1 51
2 72 39
2 30 31
1 72
0
1 34
1 75
1 39
0
1 252
0
0
1 75
1 252
0
4 37 40 266 46
2 38 39
0
0
3 41 44 48
0
0
1 75
1 266
0
1 53
2 59 62
3 49 266 56
0
0
1 266
1 75
1 266
1 60
1 56...

output:

result:

ok Accepted (100 test cases)

Test #9:

score: 0

Accepted

time: 30ms

memory: 11920kb

input:

5
4174
3 9 15 2088
3 3 18 7
0
2 23 12
1 15
2 19 2088
0
1 19
1 23
2 11 2088
3 16 17 21
0
1 20
2 2088 38
0
0
0
2 28 27
1 20
0
0
2 2088 39
1 34
2 30 47
1 30
2 29 2088
0
1 34
0
0
1 39
1 47
1 2088
0
1 39
1 51
2 2088 44
2 42 51
2 46 49
2 55 2088
1 42
0
1 44
0
1 55
0
2 48 52
0
0
2 2088 58
2 59 53
1 63
0
2 ...

output:

result:

ok Accepted (5 test cases)

Test #10:

score: 0

Accepted

time: 23ms

memory: 12712kb

input:

4
32538
4 21 46 18 16255
2 14 22
1 46
1 17
1 18
2 8 50
2 16 11
1 16
1 16255
1 50
0
2 20 22
1 18
1 17
2 16272 33
0
0
2 23 27
1 50
0
2 32 28
2 30 36
0
1 16272
3 26 38 37
0
0
0
1 50
0
1 16272
1 36
2 42 53
1 39
1 50
0
1 39
3 51 44 48
0
1 50
1 16272
1 55
1 62
0
2 16299 78
1 59
1 16299
0
1 59
2 56 67
1 55...

output:

result:

ok Accepted (4 test cases)

Test #11:

score: 0

Accepted

time: 24ms

memory: 13816kb

input:

3
54304
3 7 27151 13
1 7
3 11 8 27158
2 6 11
1 22
2 9 12
0
0
0
1 27158
3 14 17 31
0
2 25 22
2 15 23
0
1 25
0
1 31
1 27158
1 26
2 36 27158
3 27 28 34
0
1 40
1 26
0
0
0
1 36
2 27158 48
1 40
1 34
2 41 27158
0
1 41
0
5 27175 42 45 46 73
1 48
1 27175
0
0
0
2 52 58
1 27175
0
0
2 50 73
2 49 57
0
0
3 54 56 ...

output:

result:

ok Accepted (3 test cases)

Test #12:

score: 0

Accepted

time: 23ms

memory: 12492kb

input:

2
64362
6 2 13 32175 17 6 18
0
3 15 11 23
2 32175 14
1 17
0
1 15
1 11
1 18
2 32175 20
0
2 22 21
1 28
0
0
1 32175
2 22 24
0
1 32175
0
0
2 27 32
2 25 33
0
0
2 31 32175
0
1 33
2 36 40
1 36
1 36
0
0
3 32175 48 42
1 32175
2 37 46
0
1 40
2 56 45
0
1 56
0
3 32182 80 60
3 32182 52 53
0
0
1 80
1 57
2 32192 7...

output:

result:

ok Accepted (2 test cases)

Test #13:

score: 0

Accepted

time: 50ms

memory: 16140kb

input:

1
194798
3 2 3 97357
0
0
3 6 8 97357
1 6
0
2 16 32
1 24
3 97357 14 19
2 97357 13
2 97357 20
1 32
0
0
2 97357 29
2 28 26
1 97357
2 97357 27
0
0
1 29
1 37
1 97357
1 28
2 35 97357
0
0
0
0
1 35
4 33 34 97357 45
1 37
0
0
0
2 38 97357
0
0
3 97357 48 67
1 45
1 50
1 97357
2 97361 47
3 106 97382 59
1 50
1 48...

output:

result:

ok Accepted (1 test case)

Test #14:

score: 0

Accepted

time: 16ms

memory: 12200kb

input:

output:

result:

ok Accepted (10000 test cases)

Test #15:

score: 0

Accepted

time: 17ms

memory: 11012kb

input:

10000
14
2 2 10
4 6 4 5 12
1 6
2 7 9
2 11 13
0
0
1 14
0
1 14
0
0
0
0
11
4 4 5 6 11
2 7 10
1 5
2 8 9
0
0
1 8
0
0
0
0
9
4 3 4 6 7
1 8
2 5 9
0
0
0
0
1 9
0
16
2 8 7
2 12 8
1 12
1 8
1 7
1 13
0
4 9 10 15 16
0
0
1 15
1 13
0
1 16
0
0
10
3 4 3 7
2 10 5
0
1 10
0
1 7
2 8 9
0
0
0
5
3 5 3 4
1 5
0
0
0
7
2 3 5
2 3...

output:

result:

ok Accepted (10000 test cases)

Test #16:

score: 0

Accepted

time: 19ms

memory: 10676kb

input:

10000
17
2 2 12
4 14 6 11 10
2 7 12
1 14
1 6
0
0
2 15 13
1 12
0
1 15
2 16 17
0
0
0
0
0
9
3 5 4 9
1 5
1 4
0
2 7 8
1 9
0
0
0
5
2 3 5
1 4
1 4
0
0
18
3 4 3 10
2 9 16
0
2 14 12
3 8 15 11
1 18
1 14
0
1 13
1 17
0
1 13
0
0
1 17
1 18
0
0
2
1 2
0
14
3 3 13 7
2 6 11
1 10
1 13
2 8 14
1 10
1 12
1 12
1 14
0
0
0
0...

output:

result:

ok Accepted (10000 test cases)

Test #17:

score: 0

Accepted

time: 24ms

memory: 11664kb

input:

output:

result:

ok Accepted (10000 test cases)

Test #18:

score: 0

Accepted

time: 31ms

memory: 11180kb

input:

output:

result:

ok Accepted (100000 test cases)

Test #19:

score: 0

Accepted

time: 48ms

memory: 16328kb

input:

output:

result:

ok Accepted (1 test case)

Test #20:

score: 0

Accepted

time: 46ms

memory: 18648kb

input:

1
200000
5703 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 1374 1375 1440 1486 1487 1488 1489 1845 1846 1847 1848 1849 1850 1851 1860 1861 1862 1863 1864 1865 1866 1867 1868 1888 1889 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3446 ...

output:

result:

ok Accepted (1 test case)

Test #21:

score: 0

Accepted

time: 48ms

memory: 17176kb

input:

1
200000
11 39 63012 63019 63148 63219 63220 63262 63263 130152 198563 199731
9 3 4 39 60342 60876 60977 62603 62911 62944
0
5 5 7 23 25 36
0
3 8 19 22
4 8 15 16 18
4 9 10 12 14
0
0
1 13
1 13
0
0
0
0
1 18
0
2 20 21
0
0
0
0
2 27 31
2 26 29
0
2 28 30
0
1 30
0
3 32 33 35
0
0
1 35
0
2 37 38
0
0
15 41 42...

output:

result:

ok Accepted (1 test case)

Test #22:

score: 0

Accepted

time: 45ms

memory: 14764kb

input:

output:

result:

ok Accepted (2 test cases)

Test #23:

score: 0

Accepted

time: 40ms

memory: 15116kb

input:

2
100000
2810 2 3 4 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 951 952 953 1008 1009 1010 1019 1020 1021 1046 1047 1048 1049 1050 1581 1582 1583 1584 1585 1586 1587 1588 1589 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1680 1693 1694 1711 1712 1713 1732 1733 1951 1952 2040 20...

output:

result:

ok Accepted (2 test cases)

Extra Test:

score: 0

Extra Test Passed