제출 #422272

#제출 시각아이디문제언어결과실행 시간메모리
422272dreezy친구 (IOI14_friend)C++17
0 / 100
1 ms300 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,1); 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 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...