This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
/*******************/
#define pi pair<int,int>
#define ll long long
#define f first
#define s second
#define pb push_back
int findSample(int n,int confidence[],int host[],int protocol[]){
vector<bool> col(n,0);
//col[0] = 1;
for(int i =1; i<n; i++){
if(protocol[i] == 1){
col[i] = col[host[i]];
//cout << i <<", "<<host[i]<<endl;
}
else if(protocol[i] == 0){
col[i] = !col[host[i]];
}
}
int ans1=0, ans0=0;
for(int i =0; i<n; i++){
if(col[i]) ans1++;
else ans0++;
}
return max(ans1, ans0);
}
/*******************/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |