Submission #574275

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
574275	2022-06-08 09:30:14	amunduzbaev	The Xana coup (BOI21_xanadu)	C++17	100 / 100	86 ms	29796 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 ar array
#define int long long
const int N = 1e5 + 5;
vector<int> edges[N];
int a[N], dp[2][2][N];
void dfs(int u, int p = -1){
  vector<ar<int, 2>> t[2];
  dp[0][0][u] = dp[0][1][u] = dp[1][0][u] = dp[1][1][u] = N;
  for(auto x : edges[u]){
    if(x == p) continue;
    dfs(x, u);
    t[0].push_back({dp[0][0][x], dp[0][1][x]});
    t[1].push_back({dp[1][0][x], dp[1][1][x]});
  }
  int m = t[0].size();
  if(!m){
    dp[a[u]][0][u] = 0, dp[a[u] ^ 1][1][u] = 1;
    return;
  }
  
  for(int k=0;k<2;k++){
    int res = 0;
    for(auto x : t[k]) res += x[0];
    sort(t[k].begin(), t[k].end(), [&](auto& a, auto& b){
      return (a[1] - a[0] < b[1] - b[0]);
    });
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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