Submission #693329

#	Time	Username	Problem	Language	Result	Execution time	Memory
693329		stevancv	Friend (IOI14_friend)	C++14	100 / 100	23 ms	3444 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const ll linf = 1e18;
int dp[N][2];
int findSample(int n, int a[], int p[], int t[]) {
    for (int i = 0; i < n; i++) dp[i][0] = a[i];
    for (int i = n - 1; i >= 1; i--) {
        if (t[i] == 0) {
            dp[p[i]][0] += dp[i][1];
            dp[p[i]][1] += max(dp[i][0], dp[i][1]);
        }
        if (t[i] == 1) {
            dp[p[i]][0] = max({dp[p[i]][0] + dp[i][1], dp[p[i]][1] + dp[i][0], dp[p[i]][0] + dp[i][0]});
            dp[p[i]][1] += dp[i][1];
        }
        if (t[i] == 2) {
            dp[p[i]][0] = max(dp[p[i]][0] + dp[i][1], dp[p[i]][1] + dp[i][0]);
            dp[p[i]][1] += dp[i][1];
        }
    }
    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