답안 #152020

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
152020	2019-09-06T01:35:52 Z	ignifi	친구 (IOI14_friend)	C++14	35 / 100	56 ms	7076 KB

friend

#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, bool k) {
	int a = 0, b = 0, c = 0, d = 0;
	for(pii vt : adj[u]) {
		int v = vt.first, t = vt.second;
		k &= t == 1;
		pii res = recur(v, k);
		int va = res.first, vb = res.second, mvab = max(va, vb);
		if(k) {
			a += mvab;
			b += mvab;
			continue;
		}
		k = false;
		if(t == 0) {
			a += mvab;
			c += mvab;
		} else {
			c = max(c, b + vb);
			if(t == 1)
				d = max(d, vb - va);
		}
		b += va;
	}
	b += conf[u] + d;
	//cout << "? " << u << ' ' << a << ' ' << max(b, c) << endl;
	return make_pair(a, max(b, c));
}

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

Subtask #1

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2808 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	5 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
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	2684 KB	Output is correct
15	Correct	5 ms	2732 KB	Output is correct
16	Incorrect	4 ms	2680 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	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	6 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 #3

8.0 / 8.0

#	결과	실행 시간	메모리	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	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2684 KB	Output is correct

Subtask #4

19.0 / 19.0

#	결과	실행 시간	메모리	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	2808 KB	Output is correct
6	Correct	5 ms	2728 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
11	Correct	4 ms	2772 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	2684 KB	Output is correct

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2684 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	4 ms	2812 KB	Output is correct
10	Correct	4 ms	2808 KB	Output is correct
11	Incorrect	4 ms	2680 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #6

0 / 31.0

#	결과	실행 시간	메모리	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	2720 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
11	Correct	4 ms	2680 KB	Output is correct
12	Incorrect	56 ms	7076 KB	Output isn't correct
13	Halted	0 ms	0 KB	-