제출 #741909

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
741909		baojiaopisu	친구 (IOI14_friend)	C++14	100 / 100	39 ms	7420 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

vector<pii> g[N];
int dp[N][2];

void dfs(int u) {
	reverse(all(g[u]));
	for(auto nxt : g[u]) {
		int v = nxt.fi;
		int t = nxt.se;
		dfs(v);
		if(t == 0) {
			dp[u][0] += max(dp[v][0], dp[v][1]);
			dp[u][1] += dp[v][0];
		}		

		if(t == 1) {
			dp[u][1] += max(dp[v][0], dp[v][1]);
			maximize(dp[u][1], dp[u][0] + dp[v][1]);
			dp[u][0] += dp[v][0];
		}

		if(t == 2) {
			dp[u][1] = max(dp[u][1] + dp[v][0], dp[u][0] + dp[v][1]);
			dp[u][0] += dp[v][0];
		}
	}
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
	for(int i = 1; i < n; i++) {
		g[host[i]].pb(mp(i, protocol[i]));
	}

	for(int i = 0; i < n; i++) dp[i][1] = confidence[i];
	dfs(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