Submission #1221285

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221285		Zbyszek99	Friend (IOI14_friend)	C++20	100 / 100	16 ms	2372 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
#define ll long long
#define ld long double
#define vi vector<int>
#define vl vector<long long>
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int dp[100'001][2];

int findSample(int n, int val[], int host[], int prot[])
{
    rep(i,n) 
    {
        dp[i][0] = 0;
        dp[i][1] = val[i];
    }
    for(int i = n-1; i >= 1; i--)
    {
        if(prot[i] == 0)
        {
            dp[host[i]][1] = dp[host[i]][1] + dp[i][0];
            dp[host[i]][0] = max(dp[i][0]+dp[host[i]][0],dp[i][1]+dp[host[i]][0]);
        }
        else if(prot[i] == 1)
        {
            dp[host[i]][1] = max({dp[i][0]+dp[host[i]][1],dp[i][1]+dp[host[i]][0],dp[i][1]+dp[host[i]][1]});
            dp[host[i]][0] += dp[i][0];
        }
        else
        {
            dp[host[i]][1] = max(dp[host[i]][1]+dp[i][0],dp[host[i]][0]+dp[i][1]);
            dp[host[i]][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