Submission #589981

#TimeUsernameProblemLanguageResultExecution timeMemory
589981Dan4Life친구 (IOI14_friend)C++17
0 / 100
40 ms65536 KiB
#include <bits/stdc++.h> #if !defined(LOL) #include "friend.h" #endif using namespace std; #define pb push_back #define sz(a) (int)a.size() #define all(a) a.begin(),a.end() const int maxn = (int)2e5+10; vector<int> adj[maxn]; int used[maxn]; void add_edge(int a, int b){ adj[a].pb(b); adj[b].pb(a); } void add_friends(int a, int b){ for(auto u : adj[a]) add_edge(u,b); } bool chk(int s){ for(auto u : adj[s]) if(used[u]) return false; return true; } int C[maxn]; int dfs(int s, int p=-1, int d=0){ int ans = (d%2==0)*C[s]; for(auto u : adj[s]){ if(u==p) continue; ans+=dfs(u,s,d+1); } return ans; } int findSample(int n, int c[], int h[], int pro[]) { int ans = 0; for(int i = 0; i < n; i++) C[i]=c[i]; for(int i = 1; i < n; i++){ if(pro[i]!=1) add_edge(h[i],i); if(pro[i]) add_friends(h[i],i); } int dis[n+1]; for(int i = 0; i < n; i++){ ans = max(ans, dfs(i)); } return ans; } #if defined(LOL) int main(void) { #define __MAXSIZE__ 100002 int confidence[__MAXSIZE__]; int host[__MAXSIZE__]; int protocol[__MAXSIZE__]; int n,i; // Number of people assert(scanf("%d",&n)==1); // Confidence for(i=0;i<n;i++) assert(scanf("%d",&confidence[i])==1); // Host and Protocol for(i=1;i<n;i++) assert(scanf("%d %d",&host[i],&protocol[i])==2); // Answer printf("%d\n",findSample(n,confidence,host,protocol)); return 0; } #endif

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:45:9: warning: unused variable 'dis' [-Wunused-variable]
   45 |     int dis[n+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...