제출 #1256495

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1256495		kunzaZa183	Friend (IOI14_friend)	C++20	100 / 100	16 ms	1864 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]) {
  vector<int> qvi(n);
  for (int i = n - 1; i > 0; i--) {
    int par = host[i];
    int p = confidence[par], q = qvi[par];
    int p_ = confidence[i], q_ = qvi[i];
    if (protocol[i] == 0) {
      confidence[par] = p + q_;
      qvi[par] = max(p_ + q, q_ + q);
    } else if (protocol[i] == 1) {
      confidence[par] = max({p + p_, p + q_, p_ + q});
      qvi[par] = q + q_;
    } else if (protocol[i] == 2) {
      confidence[par] = max(p + q_, p_ + q);
      qvi[par] = q + q_;
    }

    // cout << i << " " << par << " " << confidence[i] << " " << qvi[i] << "\n";
  }
  // cout << 0 << " " << confidence[0] << " " << qvi[0] << "\n";

  return max(confidence[0], qvi[0]);
}

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