| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 115301 | faustaadp | 친구 (IOI14_friend) | C++17 | 5 ms | 2816 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
// Find out best sample
ll i,n,b[3],a[101010],jum,ma,x[2];
vector<ll> v[101010];
void dfs(ll aa,ll bb,ll cc)
{
x[cc]+=a[aa];
ll ii;
for(ii=0;ii<v[aa].size();ii++)
if(v[aa][ii]!=bb)
dfs(v[aa][ii],aa,1-cc);
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
//int ans=10;
for(i=0;i<n;i++)
{
if(i>=1)
{
b[protocol[i]]=1;
v[host[i]].pb(i);
v[i].pb(host[i]);
}
a[i]=confidence[i];
jum+=a[i];
ma=max(ma,a[i]);
}
if(b[0]==0&&b[1]==1&&b[2]==0)
return jum;
if(b[0]==0&&b[1]==0&&b[2]==1)
return ma;
if(b[0]==1&&b[1]==0&&b[2]==0)
{
dfs(0,0,0);
return max(x[0],x[1]);
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
