QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#302664#7736. Red Black Treemc020207TL 4ms32484kbC++171.3kb2024-01-11 02:47:032024-01-11 02:47:03

Judging History

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

  • [2024-02-19 10:14:05]
  • hack成功,自动添加数据
  • (/hack/538)
  • [2024-01-11 02:47:03]
  • 评测
  • 测评结果:TL
  • 用时:4ms
  • 内存:32484kb
  • [2024-01-11 02:47:03]
  • 提交

answer

#include<bits/stdc++.h>
#define MAXN 500010
#define INF 1000000010
#define MOD 998244353
#define LL long long
#define LLL __int128_t
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
int v[MAXN];
vector<int> link[MAXN];
int dep[MAXN];
vector<int> dp[MAXN];
int ans[MAXN];
void dfs(int p){
	dep[p]=INF;
	for (int q:link[p]){
		dfs(q);
		dep[p]=min(dep[p],dep[q]+1);
	}
	if (dep[p]==INF) dep[p]=1;
	dp[p].resize(dep[p]+1);
	for (int q:link[p]){
		For(i,0,dep[p]-1){
			dp[p][i]+=dp[q][i];
		}
	}
	if (v[p]==1){
		Rof(i,dep[p],1) dp[p][i]=dp[p][i-1];
		dp[p][0]=INF;
		For(i,0,dep[p]-1) dp[p][i]=min(dp[p][i],dp[p][i+1]+1);
	}else{
		dp[p][dep[p]]=INF;
		Rof(i,dep[p],1) dp[p][i]=min(dp[p][i],dp[p][i-1]+1);
	}
	ans[p]=INF;
	For(i,0,dep[p]) ans[p]=min(ans[p],dp[p][i]);
}
void Main(){
	int n;cin>>n;
	For(i,1,n){
		link[i].clear();
		dp[i].clear();
	}
	string s;cin>>s;
	For(i,0,s.size()-1) v[i+1]=s[i]-'0';
	For(i,2,n){
		int x;cin>>x;
		link[x].push_back(i);
	}
	dfs(1);
	For(i,1,n) cout<<ans[i]<<" ";
	cout<<"\n";
}
int main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int T=1;cin>>T;
	while (T--) Main();
}
/*
2
9
101011110
1 1 3 3 3 6 2 2
4
1011
1 1 3
*/

詳細信息

Test #1:

score: 100
Accepted
time: 4ms
memory: 32484kb

input:

2
9
101011110
1 1 3 3 3 6 2 2
4
1011
1 1 3

output:

4 1 2 0 0 0 0 0 0 
2 0 0 0 

result:

ok 2 lines

Test #2:

score: -100
Time Limit Exceeded

input:

6107
12
000000001000
1 2 3 2 5 4 4 7 3 8 11
19
1100111101111011110
1 2 1 1 4 5 2 4 3 2 2 7 10 2 11 3 15 5
7
0111110
1 1 2 2 1 5
3
000
1 1
7
1000011
1 2 3 3 5 4
7
0001001
1 1 1 3 5 3
8
00111000
1 1 3 2 5 2 7
11
11111110111
1 1 1 4 5 4 5 2 5 1
15
110101101000010
1 2 3 2 1 5 2 5 6 5 8 7 9 14
10
0101000...

output:

1 1 1 1 0 0 0 0 0 0 0 0 
6 2 0 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
1 0 0 0 0 0 0 
0 0 0 
0 0 0 0 0 0 0 
2 0 1 0 0 0 0 
2 1 0 0 0 0 0 0 
4 0 0 2 1 0 0 0 0 0 0 
4 3 0 0 2 0 0 0 0 0 0 0 0 0 0 
2 0 1 0 0 0 0 0 0 0 
6 5 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 
1 1 0 0 0 
5 1 0 1 0 0 0 0 0 0 0 0 0 0 
1 0 0 0 0 0 0 0 0...

result: