제출 #53373

#제출 시각아이디문제언어결과실행 시간메모리
53373zetapiFriend (IOI14_friend)C++14
8 / 100
787 ms147456 KiB
#include "friend.h" #include "bits/stdc++.h" using namespace std; #define pb push_back #define mp make_pair #define ll long long #define itr ::iterator const int MAX=1e5; vector<int> lol,vec[MAX]; int odd,even,arr[MAX],mark[MAX],maps[1009][1009]; void dfs(int node,int par,int hei) { mark[node]=1; if(hei==0) even+=arr[node]; else odd+=arr[node]; for(auto A:vec[node]) { if(A==par) continue; dfs(A,node,hei^1); } return ; } int findSample(int n,int confidence[],int host[],int protocol[]) { int ans=0,ok,N=n,cur; for(int A=0;A<N;A++) arr[A]=confidence[A]; for(int A=1;A<N;A++) { if(protocol[A]==0) { vec[host[A]].pb(A); vec[A].pb(host[A]); } else if(protocol[A]==1) { for(auto B:vec[host[A]]) { vec[B].pb(A); vec[A].pb(B); } } else { for(auto B:vec[host[A]]) { vec[B].pb(A); vec[A].pb(B); } vec[host[A]].pb(A); vec[A].pb(host[A]); } } for(int A=0;A<N;A++) if(!mark[A]) { odd=0; even=0; dfs(A,-1,0); ans+=max(odd,even); } return ans; } /*int main() { ios_base::sync_with_stdio(false); int n= cout<<findSample() return 0; }*/

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:35:12: warning: unused variable 'ok' [-Wunused-variable]
  int ans=0,ok,N=n,cur;
            ^~
friend.cpp:35:19: warning: unused variable 'cur' [-Wunused-variable]
  int ans=0,ok,N=n,cur;
                   ^~~
#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...