Submission #313483

#	Time	Username	Problem	Language	Result	Execution time	Memory
313483		talant117408	Friend (IOI14_friend)	C++17	8 / 100	5 ms	3584 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int N = 1e5+7;
int adj[11][11];
vector <vector <int>> graph(N);

int findSample(int n, int conf[], int host[], int prot[]){
	
    int cnt = 0, cnt1 = 0, cnt2 = 0;
    
    for(int i = 1; i < n; i++){
        if(!prot[i]){
            cnt++;
            graph[host[i]].pb(i);
            graph[i].pb(host[i]);
            adj[host[i]][i] = adj[i][host[i]] = 1;
        }
        else if(prot[i]&1){
            cnt1++;
            for(auto to : graph[host[i]]){
                graph[to].pb(i);
                graph[i].pb(to);
                adj[to][i] = adj[i][to] = 1;
            }
        }
        else{
            cnt2++;
            for(auto to : graph[host[i]]){
                graph[to].pb(i);
                graph[i].pb(to);
                adj[to][i] = adj[i][to] = 1;
            }
            graph[host[i]].pb(i);
            graph[i].pb(host[i]);
            adj[host[i]][i] = adj[i][host[i]] = 1;
        }
    }
    
    if(n <= 10){
        int mx = 0;
        for(int mask = 0; mask < (1<<n); mask++){
            int sum = 0;
            for(int i = 0; i < n; i++){
                if(mask & (i << n)){
                    sum += conf[i];
                    for(int j = 0; j < n; j++){
                        if(i == j) continue;
                        if(mask & (1 << j) && adj[j][i]) sum = -2e9;
                    }
                }
            }
            mx = max(mx, sum);
        }
        return mx;
    }
    else if(cnt1 == n-1){
        int sum = 0;
        for(int i = 0; i < n; i++){
            sum += conf[i];
        }
        return sum;
    }
    else if(cnt2 == n-1){
        int mx = 0;
        for(int i = 0; i < n; i++){
            mx = max(mx, conf[i]);
        }
        return mx;
    }
    
    return 1;
}

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