제출 #873411

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873411		HuyQuang_re_Zero	친구 (IOI14_friend)	C++14	100 / 100	24 ms	4552 KiB

friend

#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#include "friend.h"
using namespace std;

int n,i,f0[100005],f1[100005],c[100005],h[100005],type[100005],u;
int findSample(int n,int c[],int host[],int type[])
{
    for(u=0;u<n;u++) f0[u]=0,f1[u]=c[u];
    for(i=n-1;i>=1;i--)
    {
        int v=i,u=host[i],k=type[i];
        if(k==0)
        {
            f1[u]+=f0[v];
            f0[u]=f0[u]+max(f0[v],f1[v]);
        }
        else if(k==1)
        {
            f1[u]=max(max(f1[u]+f0[v],f0[u]+f1[v]),f1[u]+f1[v]);
            f0[u]+=f0[v];
        }
        else
        {
            f1[u]=max(f1[u]+f0[v],f0[u]+f1[v]);
            f0[u]+=f0[v];
        }
    }
    return max(f0[0],f1[0]);
}


/*
int main()
{
    freopen("friend.inp","r",stdin);
    freopen("friend.out","w",stdout);
    cin>>n;
    for(i=0;i<n;i++) cin>>c[i];
    for(i=1;i<n;i++) cin>>h[i]>>type[i];
    cout<<findSample(n,c,h,type);
}
*/

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