# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422269 | dreezy | Friend (IOI14_friend) | C++17 | 0 ms | 0 KiB |
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);
col[0] = 1;
int ans[2] = {0,0};//col 0, col1
for(int i =1; i<n; i++){
if(protocol[i] == 1){
col[i] = col[host[i]];
ans[col[i]]++;
//cout << i <<", "<<host[i]<<endl;
}
else if(portocol[i] == 0){
col[i] = !col[host[i]];
ans[col[i]]++;
}
}
return max(ans[0], ans[1]);
}
/*******************/