제출 #423503

#제출 시각아이디문제언어결과실행 시간메모리
423503Theo830친구 (IOI14_friend)C++17
0 / 100
1076 ms1996 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll INF = 1e9; ll MOD = 998244353; typedef pair<ll,ll> ii; #define iii pair<int,int> #define f(i,a,b) for(ll i = a;i < b;i++) #define pb push_back #define vll vector<ll> #define F first #define S second #define all(x) (x).begin(), (x).end() ///I hope I will get uprating and don't make mistakes ///I will never stop programming ///sqrt(-1) Love C++ ///Please don't hack me ///@TheofanisOrfanou Theo830 ///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst) ///Stay Calm ///Look for special cases ///Beware of overflow and array bounds ///Think the problem backwards ///Training vector<vll>adj; ll arr[1005]; ll p[2] = {0}; void solve(ll idx,bool ep){ p[ep]++; for(auto x:adj[idx]){ if(x > idx){ solve(x,ep^1); } } } int findSample(int n, int confidence[], int host[], int protocol[]){ adj.assign(n+5,vll()); ll ans = 0; f(i,0,n){ arr[i] = confidence[i]; ans += arr[i]; } f(i,1,n){ ll v = host[i]; if(protocol[i] == 0){ adj[v].pb(i); adj[i].pb(v); } else if(protocol[i] == 1){ for(auto x:adj[v]){ adj[i].pb(x); adj[x].pb(i); } } else{ for(auto x:adj[v]){ adj[i].pb(x); adj[x].pb(i); } adj[v].pb(i); adj[i].pb(v); } } solve(0,0); return max(p[0],p[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...