제출 #1024490

#제출 시각아이디문제언어결과실행 시간메모리
1024490vjudge1친구 (IOI14_friend)C++17
35 / 100
18 ms3804 KiB
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
int p[1001000],q[100100];
int findSample(int n,int confidence[],int host[],int protocol[]){
    memcpy(p,confidence,n*4);
    for(int i=n;--i;){
        int H=host[i];
        if(!protocol[i])
            p[H]+=q[i],
            q[H]+=max(q[i],p[i]);
        else if(protocol[i]&1)
            q[H]+=q[i],
            p[H]=max({p[H]+p[i],p[H]+q[i],q[H]+p[i]});
        else q[H]+=q[i],
            p[H]=max(p[H]+q[i],p[i]+q[H]); 
    }
	return max(p[0],q[0]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...