제출 #50741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50741		Just_Solve_The_Problem	친구 (IOI14_friend)	C++11	11 / 100	1078 ms	17980 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

#define pb push_back
#define sz(s) (int)s.size()

const int N = (int)1e5 + 7;
const int smN = (int)1e3 + 7;

vector < int > gr[N];
int has[smN][smN];

void addedge(int a, int b) {
  gr[a].pb(b);
  gr[b].pb(a);
  has[a][b] = has[b][a] = 1;
}

int findSample(int n, int confidence[], int host[], int protocol[]){
  int ans = 0;
  for (int i = 1; i < n; i++) {
    if (protocol[i] == 0 || protocol[i] == 2) {
      addedge(host[i], i);
    }
    if (protocol[i] == 1 || protocol[i] == 2) {
      for (int to : gr[host[i]]) {
        addedge(to, i);
      }
    }
  }
  for (int mask = 0; mask < (1 << n); mask++) {
    vector < int > v;
    for (int i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        v.pb(i);
      }
    }
    int res = 0;
    bool ok = 1;
    for (int i = 0; i < sz(v) && ok; i++) {
      for (int j = i + 1; j < sz(v) && ok; j++) {
        if (has[v[i]][v[j]]) {
          ok = 0;
        }
      }
    }
    if (ok) {
      for (int to : v) {
        res += confidence[to];
      }
    }
    ans = max(ans, res);
  }
	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