oj.uz

Submission #696190

# Submission time Handle Problem Language Result Execution time Memory
696190 2023-02-05T18:45:49 Z RaulAndrei01 The Xana coup (BOI21_xanadu) C++17
100 / 100
 120 ms 19684 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <vector>

using namespace std;
using ll = long long;
const int nmax = 1e5 + 9;
const ll inf = 1e7;
vector<int> adj[nmax];
bool on[nmax];

ll dp[2][2][nmax];

void dfs (int nod = 1, int par = 0)
{
    ll temp[2][2];

    temp[0][0] = 0;
    temp[1][0] = 0;

    temp[0][1] = inf;
    temp[1][1] = inf;
    
    for (auto to : adj[nod])
    {
        if (to == par) continue;
        
        dfs (to , nod);
        ll t[2][2];
        
        t[0][0] = min(temp[0][0] + dp[0][0][to] , temp[0][1] + dp[0][1][to]);
        t[1][0] = min (temp[1][0] + dp[1][0][to] , temp[1][1] + dp[1][1][to]);
        t[0][1] = min(temp[0][1] + dp[0][0][to] , temp[0][0] + dp[0][1][to]);
        t[1][1] = min(temp[1][0] + dp[1][1][to] , temp[1][1] + dp[1][0][to]);
        
        

        for (int i = 0; i < 2; i++)
          for (int j = 0; j < 2; j++)
            temp[i][j] = t[i][j];
    }
    if (on[nod])
    {
        dp[0][0][nod] = temp[0][1];
        dp[0][1][nod] = 1 + temp[1][0];
        dp[1][0][nod] = temp[0][0];
        dp[1][1][nod] = 1 + temp[1][1];
    }
    else {
        dp[0][0][nod] = temp[0][0];
        dp[0][1][nod] = 1 + temp[1][1];
        dp[1][0][nod] = temp[0][1];
        dp[1][1][nod] = 1 + temp[1][0];
    }
 //   cout << nod << '\n';
   // cout << temp[0][0] << ' ' << temp[0][1] << ' ' << temp[1][0] << ' ' << temp[1][1] << '\n';
  //  cout << dp[0][0][nod] << ' ' << dp[0][1][nod] << ' ' << dp[1][0][nod] <<
  //  ' '<< dp[1][1][nod];
  //  cout << '\n';
}

int main ()
{
    int n; cin >> n; 
    for (int i = 1; i < n; i++)
    {
        int x, y; cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> on[i];
    }
    
    dfs();
    if (min(dp[0][1][1] , dp[0][0][1]) >= inf) cout << "impossible\n";
    else cout << min(dp[0][1][1] , dp[0][0][1]);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 18300 KB Output is correct
2 Correct 107 ms 18156 KB Output is correct
3 Correct 89 ms 18288 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 18240 KB Output is correct
2 Correct 87 ms 18056 KB Output is correct
3 Correct 92 ms 18432 KB Output is correct
4 Correct 107 ms 8292 KB Output is correct
5 Correct 100 ms 10084 KB Output is correct
6 Correct 97 ms 10316 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 28 ms 5256 KB Output is correct
9 Correct 89 ms 10256 KB Output is correct
10 Correct 120 ms 10440 KB Output is correct
11 Correct 92 ms 10824 KB Output is correct
12 Correct 105 ms 11128 KB Output is correct
13 Correct 94 ms 9808 KB Output is correct
14 Correct 99 ms 10452 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 90 ms 18300 KB Output is correct
18 Correct 107 ms 18156 KB Output is correct
19 Correct 89 ms 18288 KB Output is correct
20 Correct 89 ms 18240 KB Output is correct
21 Correct 87 ms 18056 KB Output is correct
22 Correct 92 ms 18432 KB Output is correct
23 Correct 107 ms 8292 KB Output is correct
24 Correct 100 ms 10084 KB Output is correct
25 Correct 97 ms 10316 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 28 ms 5256 KB Output is correct
28 Correct 89 ms 10256 KB Output is correct
29 Correct 120 ms 10440 KB Output is correct
30 Correct 92 ms 10824 KB Output is correct
31 Correct 105 ms 11128 KB Output is correct
32 Correct 94 ms 9808 KB Output is correct
33 Correct 99 ms 10452 KB Output is correct
34 Correct 2 ms 2656 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 1 ms 2660 KB Output is correct
40 Correct 1 ms 2656 KB Output is correct
41 Correct 2 ms 2656 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 92 ms 19604 KB Output is correct
46 Correct 93 ms 19372 KB Output is correct
47 Correct 105 ms 19684 KB Output is correct
48 Correct 93 ms 9528 KB Output is correct
49 Correct 89 ms 10296 KB Output is correct
50 Correct 99 ms 10340 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 32 ms 5192 KB Output is correct
53 Correct 98 ms 10324 KB Output is correct
54 Correct 99 ms 10448 KB Output is correct
55 Correct 103 ms 10896 KB Output is correct
56 Correct 110 ms 11204 KB Output is correct
57 Correct 86 ms 9820 KB Output is correct
58 Correct 92 ms 10312 KB Output is correct
59 Correct 31 ms 5148 KB Output is correct
60 Correct 80 ms 9584 KB Output is correct
61 Correct 102 ms 10172 KB Output is correct
62 Correct 98 ms 10456 KB Output is correct
63 Correct 93 ms 10432 KB Output is correct
64 Correct 104 ms 10328 KB Output is correct
65 Correct 104 ms 10828 KB Output is correct
66 Correct 98 ms 10764 KB Output is correct
67 Correct 97 ms 10720 KB Output is correct
68 Correct 83 ms 10688 KB Output is correct
69 Correct 77 ms 10696 KB Output is correct
70 Correct 80 ms 10748 KB Output is correct