oj.uz

Submission #133693

# Submission time Handle Problem Language Result Execution time Memory
133693 2019-07-21T08:40:13 Z antimirage Friend (IOI14_friend) C++14
0 / 100
 2 ms 376 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

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

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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