제출 #276757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
276757		MKopchev	Friend (IOI14_friend)	C++14	35 / 100	1 ms	512 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=1e5+42;

int with[nmax],without[nmax];

int findSample(int n,int confidence[],int host[],int protocol[])
{
    for(int i=0;i<n;i++)with[i]=confidence[i];

    for(int i=n-1;i>0;i--)
    {
        if(protocol[i]==1)
        {
            with[host[i]]=max(max(with[host[i]]+with[i],with[host[i]]+without[i]),with[host[i]]+with[i]);
            without[host[i]]+=without[i];
        }
        else if(protocol[i]==2)
        {
            with[host[i]]=max(with[host[i]]+without[i],with[i]+without[host[i]]);
            without[host[i]]+=without[i];
        }
        else
        {
            with[host[i]]+=without[i];
            without[host[i]]+=max(with[i],without[i]);
        }
        /*
        cout<<i<<":"<<endl;
        for(int j=0;j<=i;j++)
        {
            cout<<j<<" -> "<<with[j]<<" "<<without[j]<<endl;
        }
        */
    }

    return max(with[0],without[0]);
}

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