oj.uz

답안 #658067

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658067 2022-11-12T05:20:54 Z azberjibiou 수도 (JOI20_capital_city) C++17
31 / 100
 764 ms 104968 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN=200005;
const int mxK=25;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
typedef long long ll;
const ll MOD=1000000007;
const ll INF=1e18;

int N, K;
vector <int> v[mxN];
vector <int> ct[mxN];
int C[mxN];
int dep[mxN], par[mxN], sps[mxN][mxK];
int root[mxN];
int in[mxN], out[mxN], iidx;
set <pii> s;
struct cmp1{
     bool operator()(const int a, const int b)const {
        return in[a]<in[b];
     }
};
set <int, cmp1> et[mxN];
set <int> np[mxN];
int cnt[mxN];
int ans=mxN;
void dfs1(int now, int pre=-1)
{
    in[now]=++iidx;
    for(int i=1;i<=19;i++)  sps[now][i]=sps[sps[now][i-1]][i-1];
    for(int nxt : v[now])   if(nxt!=pre)
    {
        dep[nxt]=dep[now]+1;
        sps[nxt][0]=par[nxt]=now;
        dfs1(nxt, now);
    }
    out[now]=iidx;
}
int lca(int a, int b)
{
    if(dep[a]<dep[b])   swap(a, b);
    for(int i=19;i>=0;i--)
    {
        if(dep[a]-(1<<i)>=dep[b])   a=sps[a][i];
    }
    if(a==b)    return a;

    for(int i=19;i>=0;i--)
    {
        if(sps[a][i]!=sps[b][i])    a=sps[a][i], b=sps[b][i];
    }
    return sps[a][0];
}
void onion(int c1, int c2)
{
    int r2=root[c2];
    bool ok=false;
    for(int e : et[c1])
    {
        auto it=et[c2].lower_bound(e);
        if(it!=et[c2].end() && *it!=r2) ok=true;
    }
    if(ok && s.find(pii(et[c2].size(), c2))!=s.end())
    {
        s.erase(pii(et[c2].size(), c2));
        np[c1].erase(par[root[c1]]);
        np[c2].erase(par[root[c2]]);
        root[c2]=lca(root[c1], root[c2]);
        np[c2].insert(par[root[c2]]);
        for(int e : et[c1])
        {
            C[e]=c2;
            if(np[c2].find(e)!=np[c2].end())    np[c2].erase(e);
        }
        for(int e : np[c1])
        {
            if(et[c2].find(e)==et[c2].end())    np[c2].insert(e);
        }
        for(int e : et[c1]) et[c2].insert(e);
        et[c1].clear();
        np[c1].clear();
        cnt[c2]+=cnt[c1];
        s.insert(pii(et[c2].size(), c2));
    }
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    dep[0]=-1;
    cin >> N >> K;
    for(int i=1;i<N;i++)
    {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(int i=1;i<=N;i++)   cin >> C[i], ct[C[i]].push_back(i);
    for(int i=1;i<=K;i++)   if(ct[i].size()==1)
    {
        cout << 0;
        return  0;
    }
    dfs1(1);
    for(int i=1;i<=K;i++)
    {
        root[i]=ct[i][0];
        for(int ele : ct[i])    root[i]=lca(root[i], ele);
        np[i].insert(par[root[i]]);
    }
    for(int i=1;i<=K;i++)   s.insert(pii(ct[i].size(), i));
    for(int i=1;i<=K;i++)   for(int ele : ct[i])    et[i].insert(ele);
    for(int i=1;i<=K;i++)   for(int ele : ct[i])    if(C[par[ele]]!=i)   np[i].insert(par[ele]);
    for(int i=1;i<=K;i++)   cnt[i]=1;
    /*for(int i=1;i<=K;i++)
    {
        printf("i=%d: ", i);
        for(int ele : np[i])    printf("%d ", ele);
        printf("\n");
    }*/
    while(s.size())
    {
        int c1=s.begin()->se;
        s.erase(s.begin());
        if(np[c1].size()==1)
        {
            ans=min(ans, cnt[c1]);
            continue;
        }
        auto it=np[c1].begin();
        int x=*it;
        if(x==par[root[c1]])    x=*(++it);
        int c2=C[x];
        onion(c1, c2);
        /*for(int i=1;i<=K;i++)
        {
            printf("i=%d: ", i);
            for(int ele : np[i])    printf("%d ", ele);
            printf("\n");
        }*/
    }
    cout << ans-1;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28464 KB Output is correct
3 Correct 15 ms 28520 KB Output is correct
4 Correct 14 ms 28516 KB Output is correct
5 Correct 14 ms 28448 KB Output is correct
6 Correct 16 ms 28460 KB Output is correct
7 Correct 18 ms 28504 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 13 ms 28540 KB Output is correct
10 Correct 13 ms 28520 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28464 KB Output is correct
3 Correct 15 ms 28520 KB Output is correct
4 Correct 14 ms 28516 KB Output is correct
5 Correct 14 ms 28448 KB Output is correct
6 Correct 16 ms 28460 KB Output is correct
7 Correct 18 ms 28504 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 13 ms 28540 KB Output is correct
10 Correct 13 ms 28520 KB Output is correct
11 Incorrect 17 ms 29028 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 480 ms 104824 KB Output is correct
2 Correct 170 ms 104928 KB Output is correct
3 Correct 453 ms 104768 KB Output is correct
4 Correct 172 ms 104968 KB Output is correct
5 Correct 614 ms 101392 KB Output is correct
6 Correct 228 ms 104716 KB Output is correct
7 Correct 439 ms 99892 KB Output is correct
8 Correct 171 ms 101920 KB Output is correct
9 Correct 764 ms 96904 KB Output is correct
10 Correct 696 ms 94500 KB Output is correct
11 Correct 670 ms 97380 KB Output is correct
12 Correct 722 ms 100016 KB Output is correct
13 Correct 677 ms 94076 KB Output is correct
14 Correct 748 ms 100388 KB Output is correct
15 Correct 717 ms 99984 KB Output is correct
16 Correct 682 ms 95096 KB Output is correct
17 Correct 663 ms 95552 KB Output is correct
18 Correct 752 ms 95744 KB Output is correct
19 Correct 661 ms 98848 KB Output is correct
20 Correct 655 ms 101144 KB Output is correct
21 Correct 16 ms 28628 KB Output is correct

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28464 KB Output is correct
3 Correct 15 ms 28520 KB Output is correct
4 Correct 14 ms 28516 KB Output is correct
5 Correct 14 ms 28448 KB Output is correct
6 Correct 16 ms 28460 KB Output is correct
7 Correct 18 ms 28504 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 13 ms 28540 KB Output is correct
10 Correct 13 ms 28520 KB Output is correct
11 Incorrect 17 ms 29028 KB Output isn't correct
12 Halted 0 ms 0 KB -