#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
int findSample(int n,int confidence[],int host[],int protocol[]){
int tag[n], ans1 = 1, ans2 = 0;
tag[0] = 0;
for (int i = 1; i < n; i++) {
if (protocol[i]) tag[i] = tag[host[i]];
else tag[i] = abs(tag[host[i]] - 1);
if (tag[i]) ans2++;
else ans1++;
}
return max(ans1, ans2);
}
# | 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... |