oj.uz

답안 #758425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758425 2023-06-14T15:28:43 Z anaduguleanu The Xana coup (BOI21_xanadu) C++14
100 / 100
 72 ms 23936 KB 
#include <iostream>
#include <vector>
#define MAX 100000
#define INF 1000000000
using namespace std;
///ifstream cin ("c.in");
///ofstream cout ("c.out");
int status[MAX + 10];
long long DP[MAX + 10][3][3];
vector <int> graph[MAX + 10];
void dfs(int node, int parent)
{
    long long dp[3][3];
    dp[0][0] = 0;
    dp[0][1] = 0;
    dp[1][0] = INF;
    dp[1][1] = INF;
    for (auto next : graph[node])
        if (next != parent)
        {
            dfs(next, node);
            long long aux[3][3];
            aux[0][0] = dp[0][0];
            aux[0][1] = dp[0][1];
            aux[1][0] = dp[1][0];
            aux[1][1] = dp[1][1];
            dp[0][0] = min(aux[0][0] + DP[next][0][0], aux[1][0] + DP[next][1][0]);
            dp[0][1] = min(aux[0][1] + DP[next][0][1], aux[1][1] + DP[next][1][1]);
            dp[1][0] = min(aux[0][0] + DP[next][1][0], aux[1][0] + DP[next][0][0]);
            dp[1][1] = min(aux[0][1] + DP[next][1][1], aux[1][1] + DP[next][0][1]);
        }
    if (status[node] == 1)
    {
        DP[node][0][0] = dp[1][0];
        DP[node][0][1] = dp[0][0];
        DP[node][1][0] = dp[0][1] + 1;
        DP[node][1][1] = dp[1][1] + 1;
    }
    else
    {
        DP[node][0][0] = dp[0][0];
        DP[node][0][1] = dp[1][0];
        DP[node][1][0] = dp[1][1] + 1;
        DP[node][1][1] = dp[0][1] + 1;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i < n; i++)
    {
        int x, y;
        cin >> x >> y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }
    for (int i = 1; i <= n; i++)
        cin >> status[i];
    dfs(1, 0);
    long long ans = min(DP[1][0][0], DP[1][1][0]);
    if (ans <= n)
        cout << ans;
    else
        cout << "impossible";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2680 KB Output is correct
7 Correct 2 ms 2680 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2684 KB Output is correct
10 Correct 2 ms 2680 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 22508 KB Output is correct
2 Correct 55 ms 22336 KB Output is correct
3 Correct 60 ms 22808 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 22516 KB Output is correct
2 Correct 49 ms 22312 KB Output is correct
3 Correct 49 ms 22708 KB Output is correct
4 Correct 51 ms 12160 KB Output is correct
5 Correct 72 ms 13068 KB Output is correct
6 Correct 71 ms 14540 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 16 ms 6608 KB Output is correct
9 Correct 53 ms 14480 KB Output is correct
10 Correct 53 ms 14684 KB Output is correct
11 Correct 69 ms 14968 KB Output is correct
12 Correct 54 ms 15412 KB Output is correct
13 Correct 46 ms 13816 KB Output is correct
14 Correct 51 ms 14540 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2680 KB Output is correct
7 Correct 2 ms 2680 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2684 KB Output is correct
10 Correct 2 ms 2680 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 56 ms 22508 KB Output is correct
18 Correct 55 ms 22336 KB Output is correct
19 Correct 60 ms 22808 KB Output is correct
20 Correct 50 ms 22516 KB Output is correct
21 Correct 49 ms 22312 KB Output is correct
22 Correct 49 ms 22708 KB Output is correct
23 Correct 51 ms 12160 KB Output is correct
24 Correct 72 ms 13068 KB Output is correct
25 Correct 71 ms 14540 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 16 ms 6608 KB Output is correct
28 Correct 53 ms 14480 KB Output is correct
29 Correct 53 ms 14684 KB Output is correct
30 Correct 69 ms 14968 KB Output is correct
31 Correct 54 ms 15412 KB Output is correct
32 Correct 46 ms 13816 KB Output is correct
33 Correct 51 ms 14540 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct
36 Correct 2 ms 2680 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2676 KB Output is correct
39 Correct 2 ms 2568 KB Output is correct
40 Correct 2 ms 2696 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2680 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 51 ms 23920 KB Output is correct
46 Correct 50 ms 23500 KB Output is correct
47 Correct 52 ms 23936 KB Output is correct
48 Correct 44 ms 13252 KB Output is correct
49 Correct 66 ms 14264 KB Output is correct
50 Correct 55 ms 14456 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 15 ms 6612 KB Output is correct
53 Correct 56 ms 14524 KB Output is correct
54 Correct 56 ms 14600 KB Output is correct
55 Correct 55 ms 14956 KB Output is correct
56 Correct 65 ms 15356 KB Output is correct
57 Correct 50 ms 13820 KB Output is correct
58 Correct 52 ms 14568 KB Output is correct
59 Correct 15 ms 6604 KB Output is correct
60 Correct 48 ms 13288 KB Output is correct
61 Correct 54 ms 14412 KB Output is correct
62 Correct 57 ms 14676 KB Output is correct
63 Correct 60 ms 14668 KB Output is correct
64 Correct 51 ms 14548 KB Output is correct
65 Correct 43 ms 15116 KB Output is correct
66 Correct 43 ms 15088 KB Output is correct
67 Correct 38 ms 14968 KB Output is correct
68 Correct 43 ms 14872 KB Output is correct
69 Correct 39 ms 14920 KB Output is correct
70 Correct 38 ms 14916 KB Output is correct