oj.uz

답안 #555321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555321 2022-04-30T12:49:17 Z urosk Mergers (JOI19_mergers) C++14
34 / 100
 336 ms 86220 KB 
// __builtin_popcount(x)
// __builtin_popcountll(x)
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
using namespace std;

#define maxn 5005
ll n,k;
ll a[maxn];
ll dp[maxn][2];
ll b[maxn];
ll in[maxn];
ll out[maxn];
vector<ll> g[maxn];
vector<ll> v[maxn];
vector<ll> f[maxn];
ll ti = 1;
ll col = -1;
ll con[maxn];
ll dsu[maxn];
ll root(ll x){
    while(x!=dsu[x]){
        dsu[x] = dsu[dsu[x]];
        x = dsu[x];
    }
    return x;
}
void upd(ll x,ll y){
    x = root(x); y = root(y);
    dsu[x] = y;
}
ll root2(ll x){
    while(x!=con[x]){
        con[x] = con[con[x]];
        x = con[x];
    }
    return x;
}
void upd2(ll x,ll y){
    x = root2(x); y = root2(y);
    con[x] = y;
}
void updg(ll x,ll y){
    upd2(x,y);
    f[x].pb(y);
    f[y].pb(x);
}
ll cnt[maxn][maxn];
void dfs(ll u,ll par){
    cnt[u][b[u]] = 1;
    for(ll s : g[u]){
        if(s==par) continue;
        dfs(s,u);
        for(ll i = 1;i<=k;i++) cnt[u][i]+=cnt[s][i];
    }
    bool flag =0;
    for(ll i = 1;i<=k;i++){
        if(cnt[u][i]!=sz(v[i])&&cnt[u][i]!=0) flag = 1;
    }
    if(flag) upd(u,par);
}
ll dis[maxn];
ll getnaj(ll u,ll par){
    ll y = u;
    for(ll s : f[u]){
        if(s==par) continue;
        dis[s] = dis[u] + 1;
        ll e = getnaj(s,u);
        if(dis[e]>dis[y]) y = e;
    }
    return y;
}
ll sizi = 0;
void brisi(ll u,ll par,ll x,vector<ll> w){
    w.pb(u);
    if(u==x){
        for(ll i = 0;i<sz(w)-1;i++){
            upd(w[i],w[i+1]);
        }
        sizi-=(sz(w)-1);
        return;
    }
    for(ll s : f[u]){
        if(s==par) continue;
        brisi(s,u,x,w);
    }
}
bool vis[maxn];
int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
    cin >> n >> k;
    iota(dsu+1,dsu+n+1,1);
    for(ll i = 1;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 >> b[i];
    for(ll i = 1;i<=n;i++){
        v[b[i]].pb(i);
    }
    dfs(1,1);
    for(ll i = 1;i<=n;i++){
        if(vis[root(i)]) continue;
        vis[root(i)] = 1;
        sizi++;
    }
    iota(con+1,con+n+1,1);
    for(ll i = 1;i<=n;i++){
        ll x = root(i);
        for(ll j : g[i]){
            ll y = root(j);
            if(root2(x)==root2(y)) continue;
            updg(x,y);
        }
    }
    //for(ll i= 1;i<=n;i++) cerr<<root(i)<< " ";
    //cerr<<endl;
    ll ans = 0;
    while(sizi>1){
        /*
        here;
        for(ll i = 1;i<=n;i++){
            if(sz(f[i])==0) continue;
            cerr<<"i: "<<i<<endl;
            for(ll x : f[i]) cerr<<x<< " ";
            cerr<<endl;
        }
        */
        ll poc = 1;
        for(ll i = 1;i<=n;i++) if(sz(f[i])>0) poc = i;
        //cerr<<"poc: "<<poc<<endl;
        fill(dis,dis+n+1,0);
        dis[0] = llinf;
        ll x = getnaj(poc,poc);
        //cerr<<x<<endl;

        fill(dis,dis+n+1,0);
        dis[0] = llinf;
        ll y = getnaj(x,x);
        brisi(x,x,y,{});
        //cerr<<y<<endl;
        for(ll i = 1;i<=n;i++) f[i].clear();
        iota(con+1,con+n+1,1);
        for(ll i = 1;i<=n;i++){
            ll x = root(i);
            for(ll j : g[i]){
                ll y = root(j);
                if(root2(x)==root2(y)) continue;
                updg(x,y);
            }
        }
        ans++;
    }
    cout<<ans<<endl;
	return 0;
}
/*
5 4
1 2
2 3
3 4
3 5
1
2
1
3
4
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 0 ms 724 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 0 ms 724 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Correct 89 ms 45160 KB Output is correct
27 Correct 8 ms 14292 KB Output is correct
28 Correct 172 ms 54864 KB Output is correct
29 Correct 213 ms 53196 KB Output is correct
30 Correct 10 ms 15572 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 51 ms 86220 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 7 ms 13112 KB Output is correct
35 Correct 208 ms 53180 KB Output is correct
36 Correct 8 ms 13780 KB Output is correct
37 Correct 39 ms 30816 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 38 ms 31036 KB Output is correct
40 Correct 6 ms 13112 KB Output is correct
41 Correct 7 ms 13268 KB Output is correct
42 Correct 53 ms 14100 KB Output is correct
43 Correct 7 ms 13364 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 49 ms 80936 KB Output is correct
46 Correct 38 ms 31352 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 22 ms 21276 KB Output is correct
49 Correct 336 ms 34452 KB Output is correct
50 Correct 190 ms 66944 KB Output is correct
51 Correct 24 ms 24872 KB Output is correct
52 Correct 8 ms 13140 KB Output is correct
53 Correct 49 ms 14060 KB Output is correct
54 Correct 7 ms 13780 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 0 ms 724 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Runtime error 5 ms 1828 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 1828 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 0 ms 724 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Correct 89 ms 45160 KB Output is correct
27 Correct 8 ms 14292 KB Output is correct
28 Correct 172 ms 54864 KB Output is correct
29 Correct 213 ms 53196 KB Output is correct
30 Correct 10 ms 15572 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 51 ms 86220 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 7 ms 13112 KB Output is correct
35 Correct 208 ms 53180 KB Output is correct
36 Correct 8 ms 13780 KB Output is correct
37 Correct 39 ms 30816 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 38 ms 31036 KB Output is correct
40 Correct 6 ms 13112 KB Output is correct
41 Correct 7 ms 13268 KB Output is correct
42 Correct 53 ms 14100 KB Output is correct
43 Correct 7 ms 13364 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 49 ms 80936 KB Output is correct
46 Correct 38 ms 31352 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 22 ms 21276 KB Output is correct
49 Correct 336 ms 34452 KB Output is correct
50 Correct 190 ms 66944 KB Output is correct
51 Correct 24 ms 24872 KB Output is correct
52 Correct 8 ms 13140 KB Output is correct
53 Correct 49 ms 14060 KB Output is correct
54 Correct 7 ms 13780 KB Output is correct
55 Correct 1 ms 852 KB Output is correct
56 Runtime error 5 ms 1828 KB Execution killed with signal 11
57 Halted 0 ms 0 KB -