oj.uz

Submission #780133

# Submission time Handle Problem Language Result Execution time Memory
780133 2023-07-12T06:52:36 Z Sohsoh84 Friend (IOI14_friend) C++17
0 / 100
 1 ms 212 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6 + 10;

int col[MAXN];

int findSample(int n, int C[], int host[], int protocol[]){
	int ans[2] = {0, 0};
	ans[0] += C[0];
	for (int i = 1; i <= n - 1; i++) {
		col[i] = col[host[i]];
		if (protocol[i] == 1)
			col[i] ^= 1;

		ans[col[i]] += C[i];
	}

	return max(ans[0], ans[1]);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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