Submission #94501

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
94501	2019-01-19T13:32:40 Z	fjzzq2002	Friend (IOI14_friend)	C++14	16 / 100	2 ms	380 KB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define SZ 666666
int f[SZ],g[SZ];
int findSample(int n,int c[],int fa[],int p[]){
	for(int i=0;i<n;++i) f[i]=c[i];
	for(int i=n-1;i>=0;--i)
	{
		int t=fa[i];
		if(p[i]==0)
			f[t]+=g[i],g[t]+=max(f[i],g[i]);
		else if(p[i]==1)
			f[t]=max(f[t]+max(f[i],g[i]),g[t]+f[i]),g[t]+=g[i];
		else
			f[t]=max(f[t]+g[i],g[t]+f[i]),g[t]+=g[i];
	}
	return max(f[0],g[0]);
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	376 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	244 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	380 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct