oj.uz

Submission #402773

# Submission time Handle Problem Language Result Execution time Memory
402773 2021-05-12T10:51:11 Z rrrr10000 The Xana coup (BOI21_xanadu) C++14
100 / 100
 184 ms 33852 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class BIT{
    vi bit;ll N;
public:
    ll sum(ll i){
        chmin(i,N);
        ll res=0;
        for(ll j=i-1;j>=0;j=(j&(j+1))-1)res+=bit[j];
        return res;
    }
    BIT(ll n):N(n){bit.resize(N);}
    void add(ll i,ll x){
        for(int j=i;j<N;j|=j+1)bit[j]+=x;
    }
    ll get(ll a,ll b){
        return sum(b)-sum(a);
    }
};
class UF{
    vi data;stack<P> st;
public:
    UF(ll n){
        data=vi(n,1);
    }
    bool merge(ll x,ll y,bool undo=false){
        x=root(x);y=root(y);
        if(data[x]>data[y])swap(x,y);
        if(undo){st.emplace(y,data[y]);st.emplace(x,data[x]);}
        if(x==y)return false;
        data[y]+=data[x];data[x]=-y;
        return true;
    }
    ll root(ll i){if(data[i]>0)return i;return root(-data[i]);}
    ll getsize(ll i){return data[root(i)];}
    bool same(ll a,ll b){return root(a)==root(b);}
    void undo(){rep(i,2){data[st.top().fi]=st.top().se;st.pop();}}
};
int main(){
    ll n;cin>>n;
    vvi g(n);
    rep(i,n-1){
        ll a,b;cin>>a>>b;a--;b--;
        g[a].pb(b);g[b].pb(a);
    }
    vi v(n);rep(i,n)cin>>v[i];
    vvvi dp(n,vvi(2,vi(2,inf)));
    function<void(ll,ll)> dfs=[&](ll i,ll p){
        for(ll x:g[i])if(x!=p)dfs(x,i);
        rep(c,2){
            ll cnt=0,sum=0,dif=inf;
            for(ll x:g[i])if(x!=p){
                sum+=min(dp[x][c][0],dp[x][c][1]);
                if(dp[x][c][1]<dp[x][c][0])cnt++;
                chmin(dif,abs(dp[x][c][0]-dp[x][c][1]));
            }
            chmin(dp[i][(c+v[i]+cnt)&1][c],sum+c);
            chmin(dp[i][(c+v[i]+cnt+1)&1][c],sum+c+dif);
        }
        // out(i);outvv(dp[i]);
    };dfs(0,-1);
    ll ans=inf;
    rep(i,2)chmin(ans,dp[0][0][i]);
    if(ans==inf)out("impossible");
    else out(ans);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 33556 KB Output is correct
2 Correct 138 ms 33240 KB Output is correct
3 Correct 144 ms 33852 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 33476 KB Output is correct
2 Correct 139 ms 33104 KB Output is correct
3 Correct 141 ms 33616 KB Output is correct
4 Correct 141 ms 21056 KB Output is correct
5 Correct 153 ms 22932 KB Output is correct
6 Correct 156 ms 23380 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 46 ms 7824 KB Output is correct
9 Correct 184 ms 23020 KB Output is correct
10 Correct 170 ms 23364 KB Output is correct
11 Correct 154 ms 23396 KB Output is correct
12 Correct 160 ms 24004 KB Output is correct
13 Correct 156 ms 22220 KB Output is correct
14 Correct 156 ms 23596 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 151 ms 33556 KB Output is correct
18 Correct 138 ms 33240 KB Output is correct
19 Correct 144 ms 33852 KB Output is correct
20 Correct 135 ms 33476 KB Output is correct
21 Correct 139 ms 33104 KB Output is correct
22 Correct 141 ms 33616 KB Output is correct
23 Correct 141 ms 21056 KB Output is correct
24 Correct 153 ms 22932 KB Output is correct
25 Correct 156 ms 23380 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 46 ms 7824 KB Output is correct
28 Correct 184 ms 23020 KB Output is correct
29 Correct 170 ms 23364 KB Output is correct
30 Correct 154 ms 23396 KB Output is correct
31 Correct 160 ms 24004 KB Output is correct
32 Correct 156 ms 22220 KB Output is correct
33 Correct 156 ms 23596 KB Output is correct
34 Correct 1 ms 288 KB Output is correct
35 Correct 1 ms 292 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 1 ms 292 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 156 ms 33452 KB Output is correct
46 Correct 148 ms 33040 KB Output is correct
47 Correct 143 ms 33672 KB Output is correct
48 Correct 148 ms 20900 KB Output is correct
49 Correct 158 ms 22812 KB Output is correct
50 Correct 167 ms 23268 KB Output is correct
51 Correct 1 ms 296 KB Output is correct
52 Correct 48 ms 7912 KB Output is correct
53 Correct 172 ms 22980 KB Output is correct
54 Correct 175 ms 23292 KB Output is correct
55 Correct 162 ms 23300 KB Output is correct
56 Correct 174 ms 24024 KB Output is correct
57 Correct 152 ms 22108 KB Output is correct
58 Correct 173 ms 23492 KB Output is correct
59 Correct 48 ms 7820 KB Output is correct
60 Correct 152 ms 20796 KB Output is correct
61 Correct 163 ms 22844 KB Output is correct
62 Correct 171 ms 23320 KB Output is correct
63 Correct 161 ms 23236 KB Output is correct
64 Correct 167 ms 23384 KB Output is correct
65 Correct 153 ms 23744 KB Output is correct
66 Correct 152 ms 23808 KB Output is correct
67 Correct 156 ms 23512 KB Output is correct
68 Correct 150 ms 23652 KB Output is correct
69 Correct 164 ms 23608 KB Output is correct
70 Correct 158 ms 23496 KB Output is correct