oj.uz

답안 #823580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823580 2023-08-12T19:16:39 Z thimote75 친구 (IOI14_friend) C++14
50 / 100
 28 ms 11220 KB 
#include "friend.h"

#include <bits/stdc++.h>

using namespace std;

using idata = vector<int>;
using igrid = vector<idata>;
using di    = pair<int, int>;

idata parents;
idata types;
idata A, B;
idata coeff;

igrid roads;

int createVersion (int parent) {
	parents.push_back(parent);
	types  .push_back(0);
	coeff  .push_back(0);
	A      .push_back(-1);
	B      .push_back(-1);

	return parents.size() - 1;
}

di compute(int node);

di computeI (int node) {
	int dp0 = 0;
	int dp1 = coeff[node];

	for (int next : roads[node]) {
		const auto data = compute(next);

		dp0 += max(data.first, data.second);
		dp1 += data.first;
	}

	return { dp0, dp1 };
}
di computeM (int node) {
	const auto AD = compute(A[node]);
	const auto BD = compute(B[node]);
	int dp0 = AD.first + BD.first;
	int dp1 = max(AD.first, AD.second) + max(BD.first, BD.second);

	for (int next : roads[node]) {
		const auto data = compute(next);

		dp0 += max(data.first, data.second);
		dp1 += data.first;
	}

	return { dp0, dp1 };
}
di compute (int node) {
	if (types[node] == 0) return computeI(node);
	if (types[node] == 1) return computeM(node);
	return {0, 0};
}

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	idata versions(n, -1);
	versions[0] = createVersion(-1);

	for (int i = 1; i < n; i ++) {
		int p = versions[host[i]];
		versions[i] = createVersion(p);

		int v = versions[i];
		if (protocol[i] != 0) {
			types[p] = protocol[i];
			versions[host[i]] = createVersion(p);

			int u = versions[host[i]];

			A[p] = u; B[p] = v;
			parents[u] = -1;
			parents[v] = -1;
		}
	}

	roads.resize(parents.size());
	for (int i = 0; i < parents.size(); i ++)
		if (parents[i] != -1)
			roads[parents[i]].push_back(i);
	for (int i = 0; i < n; i ++)
		coeff[versions[i]] = confidence[i];

	const auto data = compute(0);
	return max(data.first, data.second);
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:87:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |  for (int i = 0; i < parents.size(); i ++)
      |                  ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 312 KB Output is correct
12 Incorrect 28 ms 11220 KB Output isn't correct
13 Halted 0 ms 0 KB -