제출 #867928

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
867928	2023-10-29 20:07:48	serifefedartar	The Xana coup (BOI21_xanadu)	C++17	100 / 100	56 ms	15892 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 fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+7;
const ll P = 31;
const ll LOGN = 20; 
const ll MAXN = 1e5 + 100;
#define int long long
vector<vector<int>> graph;
int active[MAXN], dp[MAXN][2][2], temp_dp[2];
void act(int node, int parent) {
  temp_dp[0] = 0;
  temp_dp[1] = 1e8;
  for (auto u : graph[node]) {
    if (u == parent)
      continue;
    int td0 = temp_dp[0], td1 = temp_dp[1];
    temp_dp[0] = min(td1 + dp[u][1][1], td0 + dp[u][0][1]);
    temp_dp[1] = min(td1 + dp[u][0][1], td0 + dp[u][1][1]);
  }
  dp[node][1][0] = temp_dp[0] + 1;
  dp[node][1][1] = temp_dp[1] + 1;
  temp_dp[0] = 0;
  temp_dp[1] = 1e8;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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