제출 #894454

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
894454	2023-12-28 09:54:14	d4xn	The Xana coup (BOI21_xanadu)	C++17	100 / 100	83 ms	49784 KiB

xanadu

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5+5, inf = INT_MAX;
int n, dp[2][2][N]; // me he pulsado a mi mismo?, soy 0 o 1?, nodo
vector<int> adj[N];
bitset<N> bt;
void dfs(int x, int p) {
  vector<vector<int>> sum(2, vector<int>(2, 0));
  vector<int> mnSum(2, 0);
  vector<int> cnt(2, 0);
  vector<int> mnDif(2, inf);
  for (int& y : adj[x]) {
    if (y == p) continue;
    dfs(y, x);
    for (int i = 0; i < 2; i++) {
      for (int j = 0; j < 2; j++) {
        sum[i][j] += dp[i][j][y];
      }
    }
    for (int i = 0; i < 2; i++) {
      if (dp[0][i][y] < dp[1][i][y]) {
        mnSum[i] += dp[0][i][y];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 40 / 40
• Subtask 5: 30 / 30