| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 313490 | juggernaut | Friend (IOI14_friend) | C++14 | 0 ms | 0 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"grader.cpp"
#include<bits/stdc++.h>
using namespace std;
vector<int>g[1005];
bool can[15][15];
int dp[1005][2],confidence[1005];
void add(int x,int y){
g[x].push_back(y);
g[y].push_back(x);
}
void dfs(int v,int p){
dp[v][0]=dp[v][1]=0;
dp[v][1]+=confidence[v];
for(int to:g[v])
if(to!=p){
dfs(to,v);
dp[v][0]+=max(dp[to][0],dp[to][1]);
dp[v][1]+=dp[to][0];
}
}
int findSample(int n,int C[],int host[],int protocol[]){
copy(C,C+n,confidence);
for(int i=1;i<n;i++){
if(protocol[i]==0){
add(host[i],i);
}else if(protocol[i]==1){
for(int to:g[host[i]])add(i,to);
}else if(protocol[i]==2){
for(int to:g[host[i]])add(i,to);
add(host[i],i);
}
}
if(n<11){
for(int i=0;i<n;i++)for(int to:g[i])can[i][to]=1,can[to][i]=1;
int mx=0,sum;
for(int mask=0;mask<(1<<n);mask++){
sum=0;
for(int i=0;i<n;i++)
if(mask>>i&1){
sum+=confidence[i];
for(int j=0;j<n;j++)if((mask>>j&1)&&can[i][j])sum=-2e9;
}
mx=max(mx,sum);
}
return mx;
}else{
int i,cnt[3]={0,0,0};
for(i=1;i<n;i++)
cnt[protocol[i]]++;
if(cnt[0]==n-1){
dfs(0,0);
return max(dp[0][0],dp[0][1]);
}else if(cnt[1]==n-1){
int sum=0;
for(int i=0;i<n;i++)sum+=confidence[i];
return sum;
}else{
int sum=0;
for(int i=0;i<n;i++)sum=max(sum,confidence[i]);
return sum;
}
}
}