oj.uz

Submission #401454

# Submission time Handle Problem Language Result Execution time Memory
401454 2021-05-10T09:40:45 Z egekabas The Xana coup (BOI21_xanadu) C++14
100 / 100
 124 ms 28220 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
ll n;
vector<ll> g[100009];
ll st[100009];
ll dp[100009][2][2];
ll sf(pii a, pii b){
    return (a.ss-a.ff) < (b.ss-b.ff);
}
void dfs(ll v, ll prt){
    for(auto u : g[v])
        if(u != prt)
            dfs(u, v);
    for(ll use = 0; use < 2; ++use)
        for(ll res = 0; res < 2; ++res){
            ll curst = (st[v]^use);
            ll curv = use;
            vector<pii> vec;
            for(auto u : g[v])
                if(u != prt)
                    vec.pb({dp[u][0][use], dp[u][1][use]});
            sort(all(vec), sf);
            if(vec.empty()){
                if(curst == res)
                    dp[v][use][res] = curv;
                else
                    dp[v][use][res] = 1e9;
                continue;
            }
            ll idx = 0;
            if(curst != res){
                curv += vec[idx].ss;
                curst ^= 1;
                ++idx;
            }
            for(; idx < vec.size(); ++idx){
                if(idx != vec.size()-1 && vec[idx].ss+vec[idx+1].ss<vec[idx].ff+vec[idx+1].ff){
                    curv += vec[idx].ss+vec[idx+1].ss;
                    idx++;
                }
                else
                    curv += vec[idx].ff;
                
            }
            dp[v][use][res] = min(curv, (ll)1e9);
        }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n;
    for(ll i = 0; i < n-1; ++i){
        ll x, y;
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    for(ll i = 1; i <= n; ++i)
        cin >> st[i];
    dfs(1, 0);
    if(min(dp[1][0][0], dp[1][1][0]) == 1e9)
        cout << "impossible\n";
    else
        cout << min(dp[1][0][0], dp[1][1][0]) << '\n';
}

Compilation message

xanadu.cpp: In function 'void dfs(ll, ll)':
xanadu.cpp:48:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             for(; idx < vec.size(); ++idx){
      |                   ~~~~^~~~~~~~~~~~
xanadu.cpp:49:24: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 if(idx != vec.size()-1 && vec[idx].ss+vec[idx+1].ss<vec[idx].ff+vec[idx+1].ff){
      |                    ~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 28116 KB Output is correct
2 Correct 85 ms 27844 KB Output is correct
3 Correct 97 ms 28184 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 28096 KB Output is correct
2 Correct 91 ms 27744 KB Output is correct
3 Correct 95 ms 28220 KB Output is correct
4 Correct 81 ms 10944 KB Output is correct
5 Correct 98 ms 11692 KB Output is correct
6 Correct 94 ms 11928 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 31 ms 5676 KB Output is correct
9 Correct 98 ms 11604 KB Output is correct
10 Correct 112 ms 11760 KB Output is correct
11 Correct 95 ms 12684 KB Output is correct
12 Correct 100 ms 13028 KB Output is correct
13 Correct 92 ms 11536 KB Output is correct
14 Correct 101 ms 12184 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 86 ms 28116 KB Output is correct
18 Correct 85 ms 27844 KB Output is correct
19 Correct 97 ms 28184 KB Output is correct
20 Correct 92 ms 28096 KB Output is correct
21 Correct 91 ms 27744 KB Output is correct
22 Correct 95 ms 28220 KB Output is correct
23 Correct 81 ms 10944 KB Output is correct
24 Correct 98 ms 11692 KB Output is correct
25 Correct 94 ms 11928 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 31 ms 5676 KB Output is correct
28 Correct 98 ms 11604 KB Output is correct
29 Correct 112 ms 11760 KB Output is correct
30 Correct 95 ms 12684 KB Output is correct
31 Correct 100 ms 13028 KB Output is correct
32 Correct 92 ms 11536 KB Output is correct
33 Correct 101 ms 12184 KB Output is correct
34 Correct 3 ms 2672 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 3 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2612 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 2 ms 2636 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 87 ms 28100 KB Output is correct
46 Correct 98 ms 27728 KB Output is correct
47 Correct 100 ms 28184 KB Output is correct
48 Correct 90 ms 10864 KB Output is correct
49 Correct 94 ms 11712 KB Output is correct
50 Correct 92 ms 11912 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 25 ms 5680 KB Output is correct
53 Correct 97 ms 11536 KB Output is correct
54 Correct 108 ms 11716 KB Output is correct
55 Correct 124 ms 12644 KB Output is correct
56 Correct 95 ms 13080 KB Output is correct
57 Correct 87 ms 11716 KB Output is correct
58 Correct 106 ms 12112 KB Output is correct
59 Correct 27 ms 5680 KB Output is correct
60 Correct 101 ms 10648 KB Output is correct
61 Correct 91 ms 11496 KB Output is correct
62 Correct 97 ms 11712 KB Output is correct
63 Correct 121 ms 11668 KB Output is correct
64 Correct 96 ms 11636 KB Output is correct
65 Correct 81 ms 12036 KB Output is correct
66 Correct 80 ms 12004 KB Output is correct
67 Correct 99 ms 15484 KB Output is correct
68 Correct 84 ms 15496 KB Output is correct
69 Correct 86 ms 15436 KB Output is correct
70 Correct 91 ms 15480 KB Output is correct