Submission #1108643

#	Time	Username	Problem	Language	Result	Execution time	Memory
1108643		Ariadna	Friend (IOI14_friend)	C++14	11 / 100	223 ms	65536 KiB

friend

#include <bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]) {
    vector<vector<int>> adj(n, vector<int>(n, 0));
    for (int i = 1; i < n; ++i) {
        if (protocol[i] == 0 || protocol[i] == 2) 
            adj[host[i]][i] = adj[i][host[i]] = 1;
        if (protocol[i] == 1 || protocol[i] == 2) {
            for (int j = 0; j < n; ++j) {
                if (adj[j][host[i]]) adj[i][j] = adj[j][i] = 1;
            }
        }
    }

    int ans = 0;
    vector<int> c((1<<n), 0);
    queue<int> q;
    q.push(0);
    while (!q.empty()) {
        int mask = q.front();
        q.pop();
        for (int i = 0; i < n; ++i) {
            if (mask&(1<<i)) continue;
            bool ok = true;
            for (int j = 0; j < n && ok; ++j) {
                if (j == i) continue;
                if (mask&(1<<j) && adj[i][j]) ok = false;
            }
            if (ok) {
                c[mask|(1<<i)] = c[mask]+confidence[i];
                ans = max(ans, c[mask|(1<<i)]);
                q.push(mask|(1<<i));
            }
        }
    }
    return ans;
}

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