oj.uz

Submission #15787

# Submission time Handle Problem Language Result Execution time Memory
15787 2015-07-26T12:14:09 Z myungwoo Friend (IOI14_friend) C++14
100 / 100
 49 ms 3676 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAXN 100005

static int D[MAXN], E[MAXN];

int findSample(int n, int c[], int h[], int p[])
{
	for (int i=0;i<n;i++) D[i] = c[i];
	for (int i=n;--i;){
		int t = h[i];
		if (p[i] == 0){
			D[t] += E[i];
			E[t] = max(E[t] + D[i], E[t] + E[i]);
		}else if (p[i] == 1){
			D[t] = max(D[t] + D[i], max(D[t] + E[i], E[t] + D[i]));
			E[t] += E[i];
		}else{
			D[t] = max(D[t] + E[i], E[t] + D[i]);
			E[t] += E[i];
		}
	}
	return max(D[0], E[0]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3676 KB Output is correct
2 Correct 0 ms 3676 KB Output is correct
3 Correct 0 ms 3676 KB Output is correct
4 Correct 0 ms 3676 KB Output is correct
5 Correct 0 ms 3676 KB Output is correct
6 Correct 0 ms 3676 KB Output is correct
7 Correct 0 ms 3676 KB Output is correct
8 Correct 0 ms 3676 KB Output is correct
9 Correct 0 ms 3676 KB Output is correct
10 Correct 0 ms 3676 KB Output is correct
11 Correct 0 ms 3676 KB Output is correct
12 Correct 0 ms 3676 KB Output is correct
13 Correct 0 ms 3676 KB Output is correct
14 Correct 0 ms 3676 KB Output is correct
15 Correct 0 ms 3676 KB Output is correct
16 Correct 0 ms 3676 KB Output is correct
17 Correct 0 ms 3676 KB Output is correct
18 Correct 0 ms 3676 KB Output is correct
19 Correct 1 ms 3676 KB Output is correct
20 Correct 0 ms 3676 KB Output is correct
21 Correct 0 ms 3676 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3676 KB Output is correct
2 Correct 0 ms 3676 KB Output is correct
3 Correct 0 ms 3676 KB Output is correct
4 Correct 0 ms 3676 KB Output is correct
5 Correct 0 ms 3676 KB Output is correct
6 Correct 0 ms 3676 KB Output is correct
7 Correct 0 ms 3676 KB Output is correct
8 Correct 0 ms 3676 KB Output is correct
9 Correct 0 ms 3676 KB Output is correct
10 Correct 0 ms 3676 KB Output is correct
11 Correct 0 ms 3676 KB Output is correct
12 Correct 49 ms 3676 KB Output is correct
13 Correct 0 ms 3676 KB Output is correct
14 Correct 38 ms 3676 KB Output is correct
15 Correct 19 ms 3676 KB Output is correct