제출 #1064756

#제출 시각아이디문제언어결과실행 시간메모리
1064756Gray친구 (IOI14_friend)C++17
0 / 100
1 ms348 KiB
#include "friend.h" #include<bits/stdc++.h> #define ll long long #define ff first #define ss second #define ln "\n" #define ld long double using namespace std; vector<vector<int>> A; vector<int> conf; void dfs(ll u, ll lev, ll &even, ll &odd){ if (lev%2) odd+=conf[u]; else even+=conf[u]; for (auto v:A[u]){ dfs(v, lev+1, even, odd); } } int findSample(int n,int confidence[],int host[],int protocol[]){ A.clear(); A.resize(n); conf.clear(); conf.resize(n); for (int i=0; i<n; i++) conf[i]=confidence[i]; for (int i=1; i<n; i++){ A[host[i]].push_back(i); } ll even=0, odd=0; dfs(0, 0, even, odd); return max(even, odd); }
#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...