제출 #299619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299619		kevlee	친구 (IOI14_friend)	C++17	19 / 100	3 ms	2816 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
vi edges[100005];
int dp[100005][2], a[100005];
void dfs(int x, int p) {
  dp[x][1] = a[x];
  for (auto y: edges[x]) {
    if (y != p) {
      dfs(y, x);
      dp[x][1] += dp[y][0];
      dp[x][0] += max(dp[y][0], dp[y][1]);
    }
  }
}
int findSample(int n,int confidence[],int host[],int protocol[]){
  FOR(i, 0, n-1) a[i] = confidence[i];
  FOR(i, 1, n-1) {
    edges[i].pb(host[i]);
    edges[host[i]].pb(i);
  }
  dfs(0, -1);
  return max(dp[0][0], dp[0][1]);
}

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