제출 #29650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
29650		cki86201	친구 (IOI14_friend)	C++11	100 / 100	53 ms	4364 KiB

friend

#include "friend.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> Pll;
typedef long double ldouble;

int par[100010];
int D[100010][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
    rep(i, n) D[i][0] = 0, D[i][1] = confidence[i];
    for(int i=n-1;i;i--) {
        int h = host[i], c = protocol[i];
        if(c == 0) D[h][0] += max(D[i][0], D[i][1]), D[h][1] += D[i][0];
        else if(c == 1) {
            D[h][1] = max(D[h][1] + max(D[i][0], D[i][1]), D[h][0] + D[i][1]);
            D[h][0] += D[i][0];
        }
        else if(c == 2) {
            D[h][1] = max(D[h][0] + D[i][1], D[h][1] + D[i][0]);
            D[h][0] += D[i][0];
        }
    }
    
    return max(D[0][0], D[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