Submission #313569

#	Time	Username	Problem	Language	Result	Execution time	Memory
313569		juggernaut	Friend (IOI14_friend)	C++14	46 / 100	37 ms	4352 KiB

friend

#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],conf[1005],ans,mt[1005];
bool vis[1005];
vector<int>v[2];
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]+=conf[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];
        }
}
bool go(int v){
    if(vis[v])return 0;
    vis[v]=1;
    for(int to:g[v]){
        if(mt[to]==-1||go(mt[to])){
            if(mt[to]==-1)ans++;
            mt[to]=v;
            return 1;
        }
    }
    return 0;
}
int findSample(int n,int C[],int host[],int protocol[]){
    copy(C,C+n,conf);
    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+=conf[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+=conf[i];
            return sum;
        }else if(cnt[2]==n-1){
            int sum=0;
            for(int i=0;i<n;i++)sum=max(sum,conf[i]);
            return sum;
        }else{
            memset(mt,-1,sizeof(mt));
            for(int i=0;i<n;i++){
                memset(vis,0,sizeof(vis));
                go(i);
            }
        }
    }
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:84:1: warning: control reaches end of non-void function [-Wreturn-type]
   84 | }
      | ^

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31