oj.uz

Submission #869937

# Submission time Handle Problem Language Result Execution time Memory
869937 2023-11-06T11:07:48 Z PagodePaiva The Xana coup (BOI21_xanadu) C++17
70 / 100
 67 ms 12432 KB 
#include<bits/stdc++.h>
#define N 100010
#define inf 1e6

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);
    }
}

int 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(int, int, int, int)':
xanadu.cpp:32:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int i = 1;i < vl.size();i += 2){
      |                       ~~^~~~~~~~~~~
xanadu.cpp:45:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         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 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 1 ms 5212 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11052 KB Output is correct
2 Correct 45 ms 12116 KB Output is correct
3 Correct 44 ms 12368 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10832 KB Output is correct
2 Correct 41 ms 12112 KB Output is correct
3 Correct 42 ms 12432 KB Output is correct
4 Correct 57 ms 9616 KB Output is correct
5 Correct 44 ms 10064 KB Output is correct
6 Correct 45 ms 9980 KB Output is correct
7 Correct 1 ms 5212 KB Output is correct
8 Correct 15 ms 7112 KB Output is correct
9 Correct 44 ms 9932 KB Output is correct
10 Correct 49 ms 10116 KB Output is correct
11 Correct 64 ms 10072 KB Output is correct
12 Correct 54 ms 10124 KB Output is correct
13 Correct 45 ms 9740 KB Output is correct
14 Correct 50 ms 10216 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 1 ms 5212 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 1 ms 5212 KB Output is correct
7 Correct 1 ms 5212 KB Output is correct
8 Correct 1 ms 5212 KB Output is correct
9 Correct 1 ms 5212 KB Output is correct
10 Correct 1 ms 5212 KB Output is correct
11 Correct 1 ms 5212 KB Output is correct
12 Correct 1 ms 5212 KB Output is correct
13 Correct 1 ms 5212 KB Output is correct
14 Correct 1 ms 5212 KB Output is correct
15 Correct 1 ms 5212 KB Output is correct
16 Correct 1 ms 5212 KB Output is correct
17 Correct 41 ms 11052 KB Output is correct
18 Correct 45 ms 12116 KB Output is correct
19 Correct 44 ms 12368 KB Output is correct
20 Correct 43 ms 10832 KB Output is correct
21 Correct 41 ms 12112 KB Output is correct
22 Correct 42 ms 12432 KB Output is correct
23 Correct 57 ms 9616 KB Output is correct
24 Correct 44 ms 10064 KB Output is correct
25 Correct 45 ms 9980 KB Output is correct
26 Correct 1 ms 5212 KB Output is correct
27 Correct 15 ms 7112 KB Output is correct
28 Correct 44 ms 9932 KB Output is correct
29 Correct 49 ms 10116 KB Output is correct
30 Correct 64 ms 10072 KB Output is correct
31 Correct 54 ms 10124 KB Output is correct
32 Correct 45 ms 9740 KB Output is correct
33 Correct 50 ms 10216 KB Output is correct
34 Correct 1 ms 5208 KB Output is correct
35 Correct 1 ms 5212 KB Output is correct
36 Correct 1 ms 5212 KB Output is correct
37 Correct 1 ms 5376 KB Output is correct
38 Correct 1 ms 5372 KB Output is correct
39 Correct 1 ms 5212 KB Output is correct
40 Correct 1 ms 5212 KB Output is correct
41 Correct 1 ms 5212 KB Output is correct
42 Correct 1 ms 5212 KB Output is correct
43 Correct 1 ms 5212 KB Output is correct
44 Correct 1 ms 5212 KB Output is correct
45 Correct 47 ms 12392 KB Output is correct
46 Correct 40 ms 12124 KB Output is correct
47 Correct 42 ms 12376 KB Output is correct
48 Correct 42 ms 9480 KB Output is correct
49 Correct 45 ms 10064 KB Output is correct
50 Correct 55 ms 9952 KB Output is correct
51 Correct 2 ms 5212 KB Output is correct
52 Correct 15 ms 7004 KB Output is correct
53 Correct 67 ms 10048 KB Output is correct
54 Correct 49 ms 10076 KB Output is correct
55 Correct 43 ms 10076 KB Output is correct
56 Correct 48 ms 10132 KB Output is correct
57 Correct 42 ms 9916 KB Output is correct
58 Correct 54 ms 10176 KB Output is correct
59 Correct 15 ms 7004 KB Output is correct
60 Correct 45 ms 9552 KB Output is correct
61 Correct 53 ms 10076 KB Output is correct
62 Correct 55 ms 10068 KB Output is correct
63 Correct 45 ms 10068 KB Output is correct
64 Correct 56 ms 10340 KB Output is correct
65 Correct 37 ms 10844 KB Output is correct
66 Correct 45 ms 10844 KB Output is correct
67 Incorrect 37 ms 11516 KB Output isn't correct
68 Halted 0 ms 0 KB -