Submission #908769

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
908769	2024-01-16 19:57:06	dsyz	The Xana coup (BOI21_xanadu)	C++17	100 / 100	61 ms	18544 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;
using ll = long long;
#define MAXN (100005)
ll N;
vector<ll> v[MAXN];
ll dp[MAXN][2][2]; //index, press node x's button, final state of node x
bool initial[MAXN];
void dfs(ll x,ll p){
  if(initial[x]){
    dp[x][1][0] = 1;
    dp[x][0][1] = 0;
  }else{
    dp[x][1][1] = 1;
    dp[x][0][0] = 0;
  }
  for(auto u : v[x]){
    if(u != p){
      dfs(u,x);
      ll a = dp[x][0][0], b = dp[x][0][1], c = dp[x][1][0], d = dp[x][1][1];
      dp[x][0][0] = min(a + dp[u][0][0],b + dp[u][1][0]);
      dp[x][0][1] = min(b + dp[u][0][0],a + dp[u][1][0]);
      dp[x][1][0] = min(c + dp[u][0][1],d + dp[u][1][1]);
      dp[x][1][1] = min(d + dp[u][0][1],c + dp[u][1][1]);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);cin.tie(0);
  cin>>N;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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