Submission #254811

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
254811	2020-07-30 15:59:43	imeimi2000	Village (BOI20_village)	C++17	100 / 100	143 ms	21616 KiB

Village

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;
int n;
vector<int> edge[100001];
namespace solve1 {
    int dp[100001][2], pr[100001];
    void dfs(int x, int p) {
        dp[x][0] = 0;
        dp[x][1] = 1;
        int mn = 1e8;
        for (int i : edge[x]) {
            if (i == p) continue;
            dfs(i, x);
            int val = min(dp[i][0], dp[i][1]);
            if (dp[i][1] - val < mn) mn = dp[i][1] - val, pr[x] = i;
            dp[x][0] += val;
            dp[x][1] += val;
        }
        dp[x][0] += mn;
    }
    vector<int> lst[100001];
    int g[100001];
    void dfs2(int x, int p, int j) {
        if (j) lst[g[x] = g[p]].push_back(x);
        else lst[g[x] = x].push_back(x);
        for (int i : edge[x]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 38 / 38
• Subtask 3: 50 / 50