Submission #1148038

#TimeUsernameProblemLanguageResultExecution timeMemory
1148038SebFriend (IOI14_friend)C++20
0 / 100
0 ms328 KiB
#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 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...