제출 #615483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
615483		cheissmart	친구 (IOI14_friend)	C++14	100 / 100	27 ms	3356 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7, N = 1e5 + 7;

int dp[N][2];

int findSample(int n, int a[], int host[], int op[]) {
	for(int i = 0; i < n; i++)
		dp[i][0] = 0, dp[i][1] = a[i];

	for(int i = n - 1; i >= 1; i--) {
		int j = host[i];
		if(op[i] == 0) {
			dp[j][0] += max(dp[i][0], dp[i][1]);
			dp[j][1] += dp[i][0];
		} else if(op[i] == 1) {
			dp[j][1] = max({dp[j][1] + dp[i][0], dp[j][0] + dp[i][1], dp[i][1] + dp[j][1]});
			dp[j][0] += dp[i][0];
		} else {
			dp[j][1] = max(dp[j][1] + dp[i][0], dp[j][0] + dp[i][1]);
			dp[j][0] += dp[i][0];
		}
	}
	return max(dp[0][0], dp[0][1]);
}

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31