oj.uz

Submission #31173

# Submission time Handle Problem Language Result Execution time Memory
31173 2017-08-12T09:16:34 Z cscandkswon Friend (IOI14_friend) C++14
100 / 100
 53 ms 3972 KB 
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=100000;

int p[MAXN], q[MAXN];

int findSample(int n,int confidence[],int host[],int protocol[]){
	int i;
	for(i=0; i<n; i++) p[i]=confidence[i], q[i]=0;
	for(i=n-1; i>0; i--){
		if(protocol[i]==0){
			p[host[i]]=p[host[i]]+q[i];
			q[host[i]]=q[host[i]]+max(p[i], q[i]);
		}
		else if(protocol[i]==1){
			p[host[i]]=max(p[host[i]]+p[i], max(p[host[i]]+q[i], q[host[i]]+p[i]));
			q[host[i]]=q[host[i]]+q[i];
		}
		else{
			p[host[i]]=max(p[host[i]]+q[i], q[host[i]]+p[i]);
			q[host[i]]=q[host[i]]+q[i];
		}
	}
	return max(p[0], q[0]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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