Submission #50884

#	Time	Username	Problem	Language	Result	Execution time	Memory
50884		Talant	Friend (IOI14_friend)	C++17	11 / 100	1085 ms	59736 KiB

friend

#include "friend.h"

#include <bits/stdc++.h>

#define pb push_back
#define mk make_pair
#define sc second
#define fr first

using namespace std;

const int N = (1e6 + 5);

int u[1005][1005];
int ans;

vector <int> g[N];

int findSample(int n,int confidence[],int host[],int protocol[]){
      for (int i = 1; i < n; i ++) {
            int v = host[i];

            if (protocol[i] == 0) {
                  u[v][i] = 1,u[i][v] = 1;
                  g[v].pb(i),g[i].pb(v);
            }
            else if (protocol[i] == 1) {
                  for (auto to : g[v]) {
                        g[to].pb(i),g[i].pb(to);
                        u[to][i] = 1,u[i][to] = 1;
                  }
            }
            else {
                  for (auto to : g[v]) {
                        g[to].pb(i),g[i].pb(to);
                        u[to][i] = 1,u[i][to] = 1;
                  }
                  g[v].pb(i);
                  g[i].pb(v);
                  u[v][i] = 1;
                  u[i][v] = 1;
            }
      }
      for (int i = 0; i < (1 << n); i ++) {
            vector <int> v;
            int fl = 0;
            int as = 0;
            for (int j = 0; j < n; j ++) {
                  if (i & (1 << j)) {
                        for (auto to : v)
                              if (u[to][j]) fl = 1;
                        as += confidence[j];
                        v.pb(j);
                  }
            }
            if (!fl)
                  ans = max(ans,as);
       }
       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