제출 #1184624

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184624		pensive	친구 (IOI14_friend)	C++20	100 / 100	16 ms	2120 KiB

friend

#include "friend.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <algorithm>


using namespace std;
#define ll long long
#define REP(a,i,n) for (int i=a;i<n;i++)
#define f first
#define s second


void memoing(int h, int i, int act, pair<int,int> memo[]) {
    if (act == 0) {
        memo[h].s = memo[h].s + memo[i].f; 
        memo[h].f = max(memo[h].f + memo[i].s, memo[h].f + memo[i].f);
    }
    else if (act == 1) {
        memo[h].s = max({memo[h].s + memo[i].s, memo[h].s + memo[i].f, memo[h].f + memo[i].s});
        memo[h].f = memo[h].f + memo[i].f;
    }
    else if (act == 2) {
        memo[h].s = max(memo[h].s + memo[i].f, memo[h].f + memo[i].s);
        memo[h].f = memo[h].f + memo[i].f;
    }
}

int findSample(int N, int confidence[], int host[], int protocol[]) {
    pair<int,int> memo[N+5];

    REP(0,i,N) {
        memo[i].f = 0; memo[i].s=confidence[i];
    }

    for(int i=N-1;i>0;i--) {
        memoing(host[i], i, protocol[i], memo);
    }

    return max(memo[0].f, memo[0].s);
}

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