Submission #99286

# Submission time Handle Problem Language Result Execution time Memory
99286 2019-03-02T07:02:29 Z dndhk Friend (IOI14_friend) C++14
100 / 100
106 ms 8388 KB
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

const int MAX_N = 100000;
vector<pii> gp[MAX_N+1];
int N;
int c[MAX_N+1];
pii p[MAX_N+1];
int dp[MAX_N+1][2];

void dfs(int x){
	dp[x][1] = c[x];
	for(int j = gp[x].size()-1; j>=0; j--){
		pii i = gp[x][j];
		dfs(i.first);
		if(i.second==2){
			dp[x][1] = max(dp[x][1] + dp[i.first][0], dp[x][0] + max(dp[i.first][1], dp[i.first][0]));
			dp[x][0] += dp[i.first][0];
		}else if(i.second==1){
			dp[x][1] += max(dp[i.first][1], dp[i.first][0]);
			dp[x][1] = max(dp[x][1], dp[x][0] + max(dp[i.first][1], dp[i.first][0]));
			dp[x][0] += dp[i.first][0];
		}else{
			dp[x][0] += max(dp[i.first][1], dp[i.first][0]);
			dp[x][1] += dp[i.first][0];
		}
	}
}


int findSample(int n, int confidence[], int host[], int protocol[]){
	N = n;
	for(int i=0; i<N; i++){
		c[i] = confidence[i];
		if(i!=0)	{
			p[i] = {host[i], protocol[i]};
			gp[host[i]].push_back({i, protocol[i]});
		}
	}
	dfs(0);
	return max(dp[0][0], dp[0][1]);
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 5 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 5 ms 2560 KB Output is correct
6 Correct 5 ms 2688 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 5 ms 2688 KB Output is correct
9 Correct 5 ms 2816 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 4 ms 2628 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct
14 Correct 5 ms 2688 KB Output is correct
15 Correct 4 ms 2688 KB Output is correct
16 Correct 5 ms 2688 KB Output is correct
17 Correct 6 ms 2688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 5 ms 2716 KB Output is correct
3 Correct 5 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 5 ms 2660 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 6 ms 2688 KB Output is correct
9 Correct 6 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 8 ms 2816 KB Output is correct
3 Correct 5 ms 2688 KB Output is correct
4 Correct 5 ms 2784 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 5 ms 2688 KB Output is correct
8 Correct 5 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 5 ms 2560 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 5 ms 2688 KB Output is correct
4 Correct 5 ms 2688 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 5 ms 2688 KB Output is correct
8 Correct 5 ms 2816 KB Output is correct
9 Correct 5 ms 2688 KB Output is correct
10 Correct 5 ms 2688 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 5 ms 2816 KB Output is correct
14 Correct 5 ms 2688 KB Output is correct
15 Correct 5 ms 2816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2688 KB Output is correct
5 Correct 4 ms 2732 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 5 ms 2688 KB Output is correct
8 Correct 5 ms 2688 KB Output is correct
9 Correct 4 ms 2816 KB Output is correct
10 Correct 5 ms 2944 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 5 ms 2688 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct
14 Correct 5 ms 2688 KB Output is correct
15 Correct 5 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 4 ms 2688 KB Output is correct
18 Correct 5 ms 2688 KB Output is correct
19 Correct 5 ms 2688 KB Output is correct
20 Correct 8 ms 2816 KB Output is correct
21 Correct 6 ms 2816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 5 ms 2688 KB Output is correct
3 Correct 9 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 5 ms 2688 KB Output is correct
6 Correct 4 ms 2660 KB Output is correct
7 Correct 5 ms 2688 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 5 ms 2688 KB Output is correct
12 Correct 106 ms 7672 KB Output is correct
13 Correct 35 ms 5752 KB Output is correct
14 Correct 73 ms 8312 KB Output is correct
15 Correct 62 ms 8388 KB Output is correct