oj.uz

Submission #152017

# Submission time Handle Problem Language Result Execution time Memory
152017 2019-09-06T00:06:19 Z ignifi Friend (IOI14_friend) C++14
27 / 100
 5 ms 2808 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

constexpr int MAXN = 100000;

vector<pii> adj[MAXN + 2];
int *conf;

pii recur(int u) {
	int a = 0, b = 0, c = 0, d = 0;
	for(pii vt : adj[u]) {
		int v = vt.first, t = vt.second;
		pii res = recur(v);
		int va = res.first, vb = res.second;
		if(t == 0) {
			a += max(va, vb);
		} else {
			c = max(c, b + vb);
			if(t == 1)
				d = max(d, vb - va);
		}
		b += va;
	}
	b += conf[u] + d;
	return make_pair(a, max(b, c));
}

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int cum = 0, i = 1;
	while(i < n && host[i] == 0 && protocol[i] == 1)
		cum += confidence[i++];
	while(i < n) {
		adj[host[i]].push_back(make_pair(i, protocol[i]));
		i++;
	}
	conf = confidence;
	pii res = recur(0);
	return cum + max(res.first, res.second);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Incorrect 4 ms 2680 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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