QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#234584#6638. Treelectionugly2333WA 107ms25316kbC++20845b2023-11-01 19:28:372023-11-01 19:28:38

Judging History

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

  • [2023-11-01 19:28:38]
  • 评测
  • 测评结果:WA
  • 用时:107ms
  • 内存:25316kb
  • [2023-11-01 19:28:37]
  • 提交

answer

//Δ_H
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1111111;
int n,p[N],t[N],a[N],f[N],c[N];
int main(){
	int T,i,l,r,h;
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(i=2;i<=n;i++)
			scanf("%d",p+i);
		for(i=1;i<=n;i++)
			t[i]=1,a[i]=0;
		for(i=n;i>=2;i--)
			t[p[i]]+=t[i],a[p[i]]++;
		l=0,r=n;
		while(l<r){
			h=l+r>>1;
			for(i=1;i<=n;i++)
				f[i]=a[i]-h;
			for(i=n;i>=2;i--)
				if(f[i]>0)
					f[p[i]]+=f[i];
			if(f[1]>0)
				l=h+1;
			else
				r=h;
		}//cout<<l<<endl;
		for(i=1;i<=n;i++)
			f[i]=a[i]-(l-1);
		for(i=n;i>=2;i--)
			if(f[i]>0)
				f[p[i]]+=f[i];
		if(f[1]==1){
			c[1]=1;
			for(i=2;i<=n;i++)
				c[i]=c[p[i]]&&f[i]>0;
		}
		for(i=1;i<=n;i++)
			printf("%d",t[i]-1>l||c[i]);
		printf("\n");
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 11740kb

input:

2
4
1 2 3
5
1 1 2 2

output:

1100
10000

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 93ms
memory: 12212kb

input:

10
100000
1 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 10...

output:

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok 10 lines

Test #3:

score: 0
Accepted
time: 107ms
memory: 24812kb

input:

1
1000000
1 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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 10...

output:

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok single line: '111111111111111111111111111111...0000000000000000000000000000000'

Test #4:

score: 0
Accepted
time: 101ms
memory: 25316kb

input:

1
1000000
1 2 2 3 5 1 7 3 9 8 4 11 9 6 10 12 10 13 16 18 14 16 7 24 23 21 14 8 26 27 17 21 33 24 20 17 5 34 29 34 37 20 12 22 39 44 33 37 32 27 31 25 30 46 39 26 53 4 11 55 41 29 6 22 32 36 52 57 65 38 59 67 51 56 30 61 36 64 62 19 51 63 53 83 38 75 31 41 49 43 60 18 62 67 91 81 44 25 55 98 86 64 46...

output:

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok single line: '111111111111111111111111111111...0000000000000000000000000000000'

Test #5:

score: -100
Wrong Answer
time: 92ms
memory: 15924kb

input:

65764
13
1 1 1 1 1 1 1 1 2 10 10 11
11
1 1 2 2 2 4 4 4 5 10
14
1 2 2 3 3 3 4 4 5 6 10 12 13
14
1 2 2 3 3 3 4 5 5 6 6 7 8
13
1 2 2 3 3 4 5 5 5 6 8 12
13
1 1 1 2 2 3 5 7 7 7 9 9
12
1 1 1 2 2 3 5 7 7 9 10
14
1 1 2 2 3 4 5 6 7 7 8 12 12
14
1 2 3 4 4 5 5 5 7 7 7 10 13
14
1 1 1 1 1 2 2 2 3 10 10 10 11
13
...

output:

1000000000000
11000000000
11101000010000
11100000000000
1110100000000
1010001000000
101000100000
11011001000000
11111010000000
10000000000000
1111010000000
111000100010000
111010001000
11000000000000
11100000000000
11001001000000
11000000000000
11111000000000
110011000000
1010000100000
1100111010000...

result:

wrong answer 50th lines differ - expected: '110000000000', found: '110100000000'