oj.uz

Submission #131434

# Submission time Handle Problem Language Result Execution time Memory
131434 2019-07-17T07:10:58 Z MAMBA Friend (IOI14_friend) C++17
100 / 100
 66 ms 8200 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

#define rep(i , j , k) for (int i = j; i < (int)k ; i++)
#define pb push_back

typedef vector<int> vi;

inline int smax(int &a, int b) { return a < b ? a = b : a; }

const int N = 1e5 + 10;

vi adj[N];

int dp[N][2], stype[N], cc[N];

void dfs(int v) {
	int pd[2][2] = {{0 , 0} , {0 , 0 }};
	for (auto e : adj[v]) {
		dfs(e);
		int pd2[2][2];
		rep(x , 0 , 2) rep(y , 0 , 2) pd2[x][y] = pd[x][y];
		rep(x , 0 , 2)
			rep(y , 0 , 2) {
				smax(pd[x][y] , pd2[x][y] + dp[e][0]);
				if (stype[e] == 0) 
					smax(pd[1][y] , pd2[x][y] + dp[e][1]);
				else if (stype[e] == 1) { 
					if (!x) smax(pd[x][1] , pd2[x][y] + dp[e][1]);
				}
				else { 
					if (!x) smax(pd[1][1] , pd2[x][y] + dp[e][1]);
				}
			}

	}

	smax(pd[0][1] , pd[0][0]);
	smax(pd[1][1] , pd[1][0]);
	dp[v][0] = max(pd[0][0] , pd[1][0]);
	dp[v][1] = max(dp[v][0] , max(pd[1][1],  cc[v] + pd[0][1]));
}

int findSample(int n,int C[],int P[],int tp[]){

	memcpy(stype , tp , n * 4);
	memcpy(cc , C , n * 4);

	rep(i , 1 , n) 
		adj[P[i]].pb(i);
	dfs(0);

	return dp[0][1];
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2684 KB Output is correct
6 Correct 5 ms 2680 KB Output is correct
7 Correct 5 ms 2680 KB Output is correct
8 Correct 4 ms 2684 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2684 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2812 KB Output is correct
5 Correct 5 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 5 ms 2764 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 9 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 5 ms 2936 KB Output is correct
6 Correct 5 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 7 ms 2808 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct
12 Correct 5 ms 2808 KB Output is correct
13 Correct 5 ms 2808 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2692 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2684 KB Output is correct
9 Correct 4 ms 2908 KB Output is correct
10 Correct 4 ms 2940 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2652 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2808 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2648 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2708 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2684 KB Output is correct
12 Correct 62 ms 8200 KB Output is correct
13 Correct 31 ms 5528 KB Output is correct
14 Correct 54 ms 7592 KB Output is correct
15 Correct 66 ms 7732 KB Output is correct