oj.uz

Submission #466197

# Submission time Handle Problem Language Result Execution time Memory
466197 2021-08-18T10:57:38 Z alirezasamimi100 The Xana coup (BOI21_xanadu) C++17
100 / 100
 131 ms 29792 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")*/
/*#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")*/
using namespace std;
using ll=long long int;
using ld=long double;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
#define F first
#define S second
#define pb push_back
//#define mp make_pair
#define lc v<<1
#define rc v<<1|1
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int N=5e5+10,LN=20,M=5e6,SQ=350,B=737,inf=1e9+10;
const ll INF=1e18;
const ld ep=1e-7;
const int MH=1000696969,MD=998244353,MOD=1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>
ll pow(ll x, ll y, ll mod){
    ll ans=1;
    while (y != 0) {
        if (y & 1) ans = ans * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return ans;
}
ll n,dp[N][4],a[N],ans;
vector<ll> adj[N];
void dfs(ll v, ll p){
    for(ll u : adj[v]){
        if(u!=p) dfs(u,v);
    }
    for(ll i=0; i<4; i++){
        ll z=i&1,y=(i&2)/2,x=a[v]^z^y,mn=inf;
        if(y) dp[v][i]++;
        for(ll u : adj[v]){
            if(u==p) continue;
            if(dp[u][y]<=dp[u][y+2]){
                dp[v][i]+=dp[u][y];
                mn=min(mn,dp[u][y+2]-dp[u][y]);
            }else{
                dp[v][i]+=dp[u][y+2];
                mn=min(mn,dp[u][y]-dp[u][y+2]);
                x^=1;
            }
        }
        if(x) dp[v][i]+=mn;
    }
}
int main(){
    fast_io;
    cin >> n;
    for(ll i=1; i<n; i++){
        ll v,u;
        cin >> v >> u;
        adj[v].pb(u);
        adj[u].pb(v);
    }
    for(ll i=1; i<=n; i++) cin >> a[i];
    dfs(1,0);
    ans=min(dp[1][0],dp[1][2]);
    if(ans>n) cout << "impossible\n";
    else cout << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 7 ms 12068 KB Output is correct
3 Correct 7 ms 12048 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12068 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 7 ms 12068 KB Output is correct
3 Correct 7 ms 12048 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12068 KB Output is correct
6 Correct 7 ms 12068 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct
8 Correct 7 ms 12040 KB Output is correct
9 Correct 7 ms 11980 KB Output is correct
10 Correct 8 ms 12064 KB Output is correct
11 Correct 7 ms 11980 KB Output is correct
12 Correct 9 ms 12064 KB Output is correct
13 Correct 7 ms 11980 KB Output is correct
14 Correct 7 ms 11980 KB Output is correct
15 Correct 7 ms 12032 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 29636 KB Output is correct
2 Correct 76 ms 29536 KB Output is correct
3 Correct 81 ms 29792 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 29632 KB Output is correct
2 Correct 69 ms 29632 KB Output is correct
3 Correct 77 ms 29756 KB Output is correct
4 Correct 72 ms 20308 KB Output is correct
5 Correct 77 ms 21060 KB Output is correct
6 Correct 110 ms 21248 KB Output is correct
7 Correct 7 ms 12072 KB Output is correct
8 Correct 28 ms 15024 KB Output is correct
9 Correct 82 ms 20832 KB Output is correct
10 Correct 81 ms 21100 KB Output is correct
11 Correct 78 ms 21444 KB Output is correct
12 Correct 99 ms 21748 KB Output is correct
13 Correct 80 ms 20944 KB Output is correct
14 Correct 76 ms 21512 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 7 ms 12068 KB Output is correct
3 Correct 7 ms 12048 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12068 KB Output is correct
6 Correct 7 ms 12068 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct
8 Correct 7 ms 12040 KB Output is correct
9 Correct 7 ms 11980 KB Output is correct
10 Correct 8 ms 12064 KB Output is correct
11 Correct 7 ms 11980 KB Output is correct
12 Correct 9 ms 12064 KB Output is correct
13 Correct 7 ms 11980 KB Output is correct
14 Correct 7 ms 11980 KB Output is correct
15 Correct 7 ms 12032 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct
17 Correct 78 ms 29636 KB Output is correct
18 Correct 76 ms 29536 KB Output is correct
19 Correct 81 ms 29792 KB Output is correct
20 Correct 79 ms 29632 KB Output is correct
21 Correct 69 ms 29632 KB Output is correct
22 Correct 77 ms 29756 KB Output is correct
23 Correct 72 ms 20308 KB Output is correct
24 Correct 77 ms 21060 KB Output is correct
25 Correct 110 ms 21248 KB Output is correct
26 Correct 7 ms 12072 KB Output is correct
27 Correct 28 ms 15024 KB Output is correct
28 Correct 82 ms 20832 KB Output is correct
29 Correct 81 ms 21100 KB Output is correct
30 Correct 78 ms 21444 KB Output is correct
31 Correct 99 ms 21748 KB Output is correct
32 Correct 80 ms 20944 KB Output is correct
33 Correct 76 ms 21512 KB Output is correct
34 Correct 6 ms 11980 KB Output is correct
35 Correct 7 ms 11980 KB Output is correct
36 Correct 7 ms 12064 KB Output is correct
37 Correct 7 ms 12068 KB Output is correct
38 Correct 7 ms 12064 KB Output is correct
39 Correct 8 ms 11980 KB Output is correct
40 Correct 8 ms 11980 KB Output is correct
41 Correct 7 ms 12072 KB Output is correct
42 Correct 8 ms 11980 KB Output is correct
43 Correct 7 ms 11980 KB Output is correct
44 Correct 7 ms 11980 KB Output is correct
45 Correct 98 ms 29656 KB Output is correct
46 Correct 73 ms 29508 KB Output is correct
47 Correct 81 ms 29728 KB Output is correct
48 Correct 68 ms 20208 KB Output is correct
49 Correct 84 ms 21140 KB Output is correct
50 Correct 84 ms 21288 KB Output is correct
51 Correct 9 ms 12108 KB Output is correct
52 Correct 32 ms 15004 KB Output is correct
53 Correct 92 ms 20880 KB Output is correct
54 Correct 98 ms 21044 KB Output is correct
55 Correct 80 ms 21440 KB Output is correct
56 Correct 107 ms 21784 KB Output is correct
57 Correct 87 ms 21032 KB Output is correct
58 Correct 97 ms 21576 KB Output is correct
59 Correct 26 ms 14968 KB Output is correct
60 Correct 86 ms 20000 KB Output is correct
61 Correct 90 ms 20784 KB Output is correct
62 Correct 131 ms 20932 KB Output is correct
63 Correct 106 ms 21044 KB Output is correct
64 Correct 81 ms 21060 KB Output is correct
65 Correct 72 ms 21444 KB Output is correct
66 Correct 77 ms 21444 KB Output is correct
67 Correct 66 ms 21164 KB Output is correct
68 Correct 65 ms 21176 KB Output is correct
69 Correct 62 ms 21188 KB Output is correct
70 Correct 61 ms 21256 KB Output is correct