제출 #50803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50803		Just_Solve_The_Problem	친구 (IOI14_friend)	C++11	19 / 100	1075 ms	147456 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], dp[N], used[N];

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

void dfs(int v, int pr) {
  used[v] = 1;
  int res = 0;
  int res1 = 0;
  for (int to : gr[v]) {
    if (to == pr) continue;
    dfs(to, v);
    for (int tto : gr[to]) {
      if (tto == v) continue;
      res += dp[tto];
    }
    res1 += dp[to];
  }
  dp[v] = max(dp[v], res1);
  dp[v] = max(dp[v], res + c[v]);
}


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);
      }
    }
  }
  int st = -1;
  for (int i = 0; i < n; i++) {
    if (sz(gr[i]) == 1 && st == -1) st = i;
  }
  assert(st != -1);
  for (int i = 0; i < n; i++) {
    memset(dp, 0, sizeof dp);
    dfs(i, i);
    ans = max(ans, dp[i]);
  }
  return ans;
}

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