Submission #874010

#	Time	Username	Problem	Language	Result	Execution time	Memory
874010		teacup	Friend (IOI14_friend)	C++14	8 / 100	1 ms	604 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]){
    int t1=confidence[0], t2=0;
    int S[n]={}; S[0]=1;
    for (int i=1; i<n; i++){
		if (protocol[i]==0){
			S[i]=3-S[host[i]];
		}else if (protocol[i]==1){
			S[i]=S[host[i]];
		}else{
			//clown
		}
		
		if (S[i]==1){
			t1+=confidence[i];
		}else if (S[i]==2){
			t2+=confidence[i];
		}
	}
	return max(t1,t2);
}

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