oj.uz

Submission #238266

# Submission time Handle Problem Language Result Execution time Memory
238266 2020-06-10T15:11:56 Z Fasho Friend (IOI14_friend) C++14
0 / 100
 5 ms 384 KB 
#include<bits/stdc++.h>
#include "friend.h"
using namespace std;
const int MAXN = 1E5+5;
int val[MAXN];
int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans = 0;
	for (int i =0; i < n; i++) val[i] = confidence[i];
	for (int i = 1; i <=n; i++) {
		int v = host[i];
		int t = protocol[i];
		if (t == 1) {
			val[v] += val[i];
		}
		else if (t == 2) {
			val[v] = max(val[v],val[i]);
		}
		else {
			ans += val[i];
			val[v] = max (0,val[v] - val[i]);
		}
	}
	return val[0] + ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Incorrect 5 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -