제출 #50754

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

friend

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

using namespace std;

#define pb push_back
#define sz(s) (int)s.size()
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define all(s) s.begin(), s.end()

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

vector < int > gr[N];
int has[smN][smN];
int c[N], used[N], col;

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

int res = 0;

void dfs(int v, int pr, bool fl) {
  if (fl) {
    res += c[v];
  }
  for (int to : gr[v]) {
    if (to == pr) continue;
    dfs(to, v, fl ^ 1);
  }
}


int findSample(int n, int confidence[], int host[], int protocol[]){
  for (int i = 0; i < n; i++) c[i] = confidence[i];
  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);
      }
    }
  }
  vector < pii > vec;
  for (int i = 0; i < n; i++) {
    vec.pb(mk(c[i], i));
  }
  sort(all(vec));
  reverse(all(vec));
  for (pii it : vec) {
    bool fl = 1;
    for (int to : gr[it.sc]) {
      fl &= (!used[to]);
    }
    if (fl) {
      ans += it.fr;
      used[it.sc] = 1;
    }
  }
	return ans;
}

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