oj.uz

Submission #869938

# Submission time Handle Problem Language Result Execution time Memory
869938 2023-11-06T11:08:37 Z PagodePaiva The Xana coup (BOI21_xanadu) C++17
100 / 100
 59 ms 15816 KB 
#include<bits/stdc++.h>
#define N 100010
#define inf 1e6
#define int long long

using namespace std;

int n;
vector <int> g[N];
int v[N];
int dp[N][2][2];
queue <int> topsort;

void solve(int node, int p, int ap, int app){
    if(dp[node][ap][app] != inf) return;
    vector <int> vl;
    int sum = 0;
    if(ap == 1) sum++;

    for(auto x : g[node]){
        if(x == p) continue;
        vl.push_back(-dp[x][0][ap] + dp[x][1][ap]);
        sum += dp[x][0][ap];
    }

    int valor = v[node] + ap + app;
    valor %= 2;

    sort(vl.begin(), vl.end());

    if(valor == 0){
        dp[node][ap][app] = min(dp[node][ap][app], sum);
        for(int i = 1;i < vl.size();i += 2){
            sum += vl[i] + vl[i-1];
            dp[node][ap][app] = min(dp[node][ap][app], sum);
        }

        return;
    }

    else{
        if(vl.size() == 0) return;
        sum += vl[0];
        dp[node][ap][app] = min(dp[node][ap][app], sum);

        for(int i = 2;i < vl.size();i += 2){
            sum += vl[i] + vl[i-1];
            dp[node][ap][app] = min(dp[node][ap][app], sum);
        }

        return;
    }
}

int deg[N];
int pai[N];

void dfs(int node, int p){
    pai[node] = p;
    for(auto x : g[node]){
        if(x == p) continue;
        dfs(x, node);
    }
}

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n;

    for(int i = 1;i < n;i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    deg[1]++;
    for(int i = 1;i <= n;i++) {dp[i][0][0] = dp[i][1][0] = dp[i][0][1] = dp[i][1][1] = inf; cin >> v[i]; deg[i] += g[i].size()-1; if(deg[i] == 0) topsort.push(i);}
    dfs(1, 1);

    while(!topsort.empty()){
        int x = topsort.front();
        topsort.pop();

        solve(x, pai[x], 0, 0);
        solve(x, pai[x], 1, 0);
        solve(x, pai[x], 0, 1);
        solve(x, pai[x], 1, 1);
        deg[pai[x]]--;

        if(deg[pai[x]] == 0) topsort.push(pai[x]);
    }

    int res = min(dp[1][1][0], dp[1][0][0]);

    if(res >= N) cout << "impossible\n";
    else cout << res << '\n';

    return 0;
}

Compilation message

xanadu.cpp: In function 'void solve(long long int, long long int, long long int, long long int)':
xanadu.cpp:33:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int i = 1;i < vl.size();i += 2){
      |                       ~~^~~~~~~~~~~
xanadu.cpp:46:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int i = 2;i < vl.size();i += 2){
      |                       ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 14036 KB Output is correct
2 Correct 40 ms 13988 KB Output is correct
3 Correct 44 ms 14184 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 13912 KB Output is correct
2 Correct 41 ms 13940 KB Output is correct
3 Correct 41 ms 14172 KB Output is correct
4 Correct 42 ms 12120 KB Output is correct
5 Correct 46 ms 12288 KB Output is correct
6 Correct 59 ms 12428 KB Output is correct
7 Correct 1 ms 5976 KB Output is correct
8 Correct 16 ms 9564 KB Output is correct
9 Correct 49 ms 12040 KB Output is correct
10 Correct 47 ms 12124 KB Output is correct
11 Correct 46 ms 12124 KB Output is correct
12 Correct 46 ms 12300 KB Output is correct
13 Correct 44 ms 12624 KB Output is correct
14 Correct 46 ms 12824 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5980 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 1 ms 5980 KB Output is correct
4 Correct 1 ms 5976 KB Output is correct
5 Correct 1 ms 5976 KB Output is correct
6 Correct 1 ms 5980 KB Output is correct
7 Correct 1 ms 5980 KB Output is correct
8 Correct 1 ms 6232 KB Output is correct
9 Correct 1 ms 5976 KB Output is correct
10 Correct 1 ms 5980 KB Output is correct
11 Correct 1 ms 5980 KB Output is correct
12 Correct 1 ms 5980 KB Output is correct
13 Correct 1 ms 5980 KB Output is correct
14 Correct 1 ms 5980 KB Output is correct
15 Correct 2 ms 5976 KB Output is correct
16 Correct 1 ms 5980 KB Output is correct
17 Correct 44 ms 14036 KB Output is correct
18 Correct 40 ms 13988 KB Output is correct
19 Correct 44 ms 14184 KB Output is correct
20 Correct 44 ms 13912 KB Output is correct
21 Correct 41 ms 13940 KB Output is correct
22 Correct 41 ms 14172 KB Output is correct
23 Correct 42 ms 12120 KB Output is correct
24 Correct 46 ms 12288 KB Output is correct
25 Correct 59 ms 12428 KB Output is correct
26 Correct 1 ms 5976 KB Output is correct
27 Correct 16 ms 9564 KB Output is correct
28 Correct 49 ms 12040 KB Output is correct
29 Correct 47 ms 12124 KB Output is correct
30 Correct 46 ms 12124 KB Output is correct
31 Correct 46 ms 12300 KB Output is correct
32 Correct 44 ms 12624 KB Output is correct
33 Correct 46 ms 12824 KB Output is correct
34 Correct 1 ms 5976 KB Output is correct
35 Correct 1 ms 5976 KB Output is correct
36 Correct 2 ms 5980 KB Output is correct
37 Correct 1 ms 5980 KB Output is correct
38 Correct 1 ms 5976 KB Output is correct
39 Correct 1 ms 5980 KB Output is correct
40 Correct 1 ms 5980 KB Output is correct
41 Correct 1 ms 6232 KB Output is correct
42 Correct 1 ms 5980 KB Output is correct
43 Correct 1 ms 5976 KB Output is correct
44 Correct 1 ms 5980 KB Output is correct
45 Correct 43 ms 14020 KB Output is correct
46 Correct 42 ms 13904 KB Output is correct
47 Correct 41 ms 14056 KB Output is correct
48 Correct 43 ms 12036 KB Output is correct
49 Correct 49 ms 12448 KB Output is correct
50 Correct 50 ms 12600 KB Output is correct
51 Correct 2 ms 5976 KB Output is correct
52 Correct 16 ms 9564 KB Output is correct
53 Correct 52 ms 11960 KB Output is correct
54 Correct 47 ms 12124 KB Output is correct
55 Correct 46 ms 12124 KB Output is correct
56 Correct 58 ms 12124 KB Output is correct
57 Correct 52 ms 12576 KB Output is correct
58 Correct 49 ms 12948 KB Output is correct
59 Correct 16 ms 9564 KB Output is correct
60 Correct 43 ms 11836 KB Output is correct
61 Correct 48 ms 12124 KB Output is correct
62 Correct 47 ms 12124 KB Output is correct
63 Correct 46 ms 12104 KB Output is correct
64 Correct 49 ms 12120 KB Output is correct
65 Correct 37 ms 13224 KB Output is correct
66 Correct 46 ms 13396 KB Output is correct
67 Correct 36 ms 14288 KB Output is correct
68 Correct 36 ms 15816 KB Output is correct
69 Correct 36 ms 15560 KB Output is correct
70 Correct 36 ms 15656 KB Output is correct