제출 #147884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
147884		willi19	친구 (IOI14_friend)	C++14	8 / 100	3 ms	380 KiB

friend

#include <cstdio>
#include <cassert>
#define __MAXSIZE__ 100002
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
set<int,greater<int> > s;
int with[100100],without[100100];
int findSample(int n,int confidence[],int host[],int protocol[]){
    with[0]=confidence[0];
    for(int i=1;i<n;i++)
    {
        without[i]=max(with[i-1],without[i-1]);
        if(protocol[i]==0)
            with[i]=max(with[host[i]]-confidence[host[i]]+confidence[i],without[i-1]);
        if(protocol[i]==1)
            with[i]=with[host[i]]+confidence[i];
        if(protocol[i]==2)
            with[i]=with[host[i]]+confidence[i]-confidence[host[i]];
    }
    //return max(with[n-1],without[n-1]);
    int ret=0;
    for(int i=0;i<n;i++)
        ret+=confidence[i];
    return ret;
}

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