Submission #422271

#TimeUsernameProblemLanguageResultExecution timeMemory
422271dreezy친구 (IOI14_friend)C++17
0 / 100
1 ms204 KiB
#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] = {1,1};//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(protocol[i] == 0){ col[i] = !col[host[i]]; ans[col[i]]++; } } return max(ans[0], ans[1]); } /*******************/
#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...