Submission #136154

# Submission time Handle Problem Language Result Execution time Memory
136154 2019-07-24T20:00:01 Z arthurconmy Friend (IOI14_friend) C++14
19 / 100
3 ms 504 KB
#include <bits/stdc++.h>
#ifndef ARTHUR_LOCAL
	#include "friend.h"
#endif
using namespace std;
 
const int MAXN=1000;
int C[MAXN];
int H[MAXN];
int P[MAXN];
 
vector<int> adj[MAXN];
int ans[2][MAXN];
bool vis[MAXN];
 
void dfs(int v)
{
	vis[v]=1;
	// ans[1][v]+=C[v];
 
	for(auto u:adj[v])
	{
		if(vis[u]) continue;
 
		dfs(u);
		ans[0][v] += ans[1][u];
		ans[1][v] += ans[0][u];
	}
 
	ans[1][v] = max(C[v]+ans[1][v],ans[0][v]);
}
 
int findSample(int n, int C_raw[], int H_raw[], int P_raw[])
{
	for(int i=0; i<n; i++)
	{
		C[i]=C_raw[i];
		H[i]=H_raw[i];
		P[i]=P_raw[i];
	}
 
	for(int i=1; i<n; i++)
	{
		adj[i].push_back(H[i]);
		adj[H[i]].push_back(i);
	}
 
	dfs(0);
 
	return max(ans[0][0], ans[1][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 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 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 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 476 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -