제출 #697462

#제출 시각아이디문제언어결과실행 시간메모리
697462DeepessonFriend (IOI14_friend)C++17
0 / 100
1 ms308 KiB
#include <bits/stdc++.h>

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int alfa=1,beta=0;
	int cores[n]={};
	for(int i=1;i!=n;++i){
        int h = host[i];
        int c = cores[h];
        if(protocol[i]==0){///I am your friend
            cores[i]=!c;
            if(!c)++beta;else ++alfa;
        }else {
            cores[i]=c;
            if(c)++beta;else ++alfa;
        }
	}
	return std::max(alfa,beta);
}
#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...