Submission #313466

#	Time	Username	Problem	Language	Result	Execution time	Memory
313466		juggernaut	Friend (IOI14_friend)	C++14	11 / 100	50 ms	4216 KiB

friend

#include"friend.h"
//#include"grader.cpp"
#include<bits/stdc++.h>
using namespace std;
vector<int>g[15];
bool can[15][15];
void add(int x,int y){
    g[x].push_back(y);
    g[y].push_back(x);
}
int findSample(int n,int confidence[],int host[],int protocol[]){
    int i;
    for(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);
        }
    }
    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;
}

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