oj.uz

답안 #943808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943808 2024-03-12T01:17:43 Z guagua0407 수도 (JOI20_capital_city) C++17
100 / 100
 2879 ms 483972 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=2e5+5;
const int inf=1e9;
const int B=17;
vector<int> adj[mxn];
vector<int> adj2[mxn*B],adjr[mxn*B];
bool visited[mxn*B];
int c[mxn];
int up[mxn][B];
int id[mxn][B];
int depth[mxn];
vector<int> belong[mxn];
vector<int> ord;
int L[mxn];
int sz[mxn*B];
int scc[mxn*B];
int out[mxn*B];
int n,k;

void dfs(int v,int p=0){
    up[v][0]=p;
    depth[v]=depth[p]+1;
    for(auto u:adj[v]){
        if(u==p) continue;
        dfs(u,v);
    }
}

void dfs2(int v){
    visited[v]=true;
    for(auto u:adj2[v]){
        if(visited[u]) continue;
        dfs2(u);
    }
    ord.push_back(v);
}

void dfs3(int v,int cur){
    visited[v]=true;
    scc[v]=cur;
    if(v<=k) sz[cur]++;
    for(auto u:adjr[v]){
        if(visited[u]) continue;
        dfs3(u,cur);
    }
}

int lca(int a,int b){
    if(depth[a]<depth[b]) swap(a,b);
    int len=depth[a]-depth[b];
    for(int i=0;i<B;i++){
        if(len&(1<<i)) a=up[a][i];
    }
    if(a==b) return a;
    for(int i=B-1;i>=0;i--){
        int ta=up[a][i];
        int tb=up[b][i];
        if(ta!=tb){
            a=ta;
            b=tb;
        }
    }
    return up[a][0];
}

int main() {_
    cin>>n>>k;
    for(int i=0;i<n-1;i++){
        int a,b;
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for(int i=1;i<=n;i++){
        cin>>c[i];
        belong[c[i]].push_back(i);
    }
    dfs(1);
    for(int j=1;j<B;j++){
        for(int i=1;i<=n;i++){
            up[i][j]=up[up[i][j-1]][j-1];
        }
    }
    for(int i=1;i<=k;i++){
        L[i]=belong[i][0];
        for(int j=1;j<(int)belong[i].size();j++){
            L[i]=lca(L[i],belong[i][j]);
        }
    }
    int cnt=k;
    for(int i=1;i<=n;i++){
        id[i][0]=c[i];
    }
    for(int j=1;j<B;j++){
        for(int i=1;i<=n;i++){
            id[i][j]=++cnt;
            adj2[id[i][j]].push_back(id[i][j-1]);
            adj2[id[i][j]].push_back(id[up[i][j-1]][j-1]);
        }
    }
    for(int i=1;i<=k;i++){
        //cout<<L[i]<<'\n';
        for(auto v:belong[i]){
            int bit=__lg(depth[v]-depth[L[i]]+1);
            adj2[i].push_back(id[v][bit]);
            int len=depth[v]-(depth[L[i]]+(1<<bit)-1);
            int x=v;
            for(int j=0;j<B;j++){
                if(len&(1<<j)) x=up[x][j];
            }
            adj2[i].push_back(id[x][bit]);
            //cout<<v<<' '<<x<<' '<<bit<<'\n';

        }
    }
    for(int i=1;i<=cnt;i++){
        for(auto u:adj2[i]){
            adjr[u].push_back(i);
        }
    }
    fill(visited+1,visited+cnt+1,false);
    for(int i=1;i<=cnt;i++){
        if(!visited[i]){
            dfs2(i);
        }
    }
    reverse(all(ord));
    fill(visited+1,visited+cnt+1,false);
    int sccnt=0;
    for(auto i:ord){
        if(!visited[i]){
            ++sccnt;
            dfs3(i,sccnt);
        }
    }
    for(int i=1;i<=cnt;i++){
        for(auto u:adj2[i]){
            if(scc[u]!=scc[i]) out[scc[i]]++;
        }
    }
    int ans=inf;
    for(int i=1;i<=sccnt;i++){
        if(out[i]==0 and sz[i]>0) ans=min(ans,sz[i]-1);
    }
    cout<<ans<<'\n';
    return 0;
}
//maybe its multiset not set
//yeeorz
//laborz

Compilation message

capital_city.cpp: In function 'void setIO(std::string)':
capital_city.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
capital_city.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 170332 KB Output is correct
2 Correct 45 ms 170324 KB Output is correct
3 Correct 46 ms 170332 KB Output is correct
4 Correct 46 ms 170324 KB Output is correct
5 Correct 45 ms 170332 KB Output is correct
6 Correct 45 ms 170324 KB Output is correct
7 Correct 45 ms 170320 KB Output is correct
8 Correct 45 ms 170328 KB Output is correct
9 Correct 44 ms 170176 KB Output is correct
10 Correct 45 ms 170324 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 170332 KB Output is correct
2 Correct 45 ms 170324 KB Output is correct
3 Correct 46 ms 170332 KB Output is correct
4 Correct 46 ms 170324 KB Output is correct
5 Correct 45 ms 170332 KB Output is correct
6 Correct 45 ms 170324 KB Output is correct
7 Correct 45 ms 170320 KB Output is correct
8 Correct 45 ms 170328 KB Output is correct
9 Correct 44 ms 170176 KB Output is correct
10 Correct 45 ms 170324 KB Output is correct
11 Correct 51 ms 173392 KB Output is correct
12 Correct 55 ms 173304 KB Output is correct
13 Correct 50 ms 173428 KB Output is correct
14 Correct 50 ms 173392 KB Output is correct
15 Correct 51 ms 173388 KB Output is correct
16 Correct 52 ms 173220 KB Output is correct
17 Correct 52 ms 173392 KB Output is correct
18 Correct 51 ms 173392 KB Output is correct
19 Correct 51 ms 173392 KB Output is correct
20 Correct 51 ms 173396 KB Output is correct
21 Correct 50 ms 173396 KB Output is correct
22 Correct 50 ms 173292 KB Output is correct
23 Correct 52 ms 173524 KB Output is correct
24 Correct 53 ms 173260 KB Output is correct
25 Correct 51 ms 173140 KB Output is correct
26 Correct 51 ms 173396 KB Output is correct
27 Correct 51 ms 173352 KB Output is correct
28 Correct 53 ms 173268 KB Output is correct
29 Correct 56 ms 173212 KB Output is correct
30 Correct 52 ms 173136 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2502 ms 467932 KB Output is correct
2 Correct 942 ms 459736 KB Output is correct
3 Correct 2402 ms 468828 KB Output is correct
4 Correct 935 ms 459808 KB Output is correct
5 Correct 2879 ms 483972 KB Output is correct
6 Correct 985 ms 459656 KB Output is correct
7 Correct 2608 ms 473676 KB Output is correct
8 Correct 958 ms 459772 KB Output is correct
9 Correct 2016 ms 451496 KB Output is correct
10 Correct 2009 ms 450556 KB Output is correct
11 Correct 1959 ms 452156 KB Output is correct
12 Correct 1965 ms 453508 KB Output is correct
13 Correct 1955 ms 451284 KB Output is correct
14 Correct 1984 ms 453752 KB Output is correct
15 Correct 2037 ms 454104 KB Output is correct
16 Correct 1968 ms 451888 KB Output is correct
17 Correct 1959 ms 452008 KB Output is correct
18 Correct 2036 ms 452836 KB Output is correct
19 Correct 1991 ms 454488 KB Output is correct
20 Correct 1970 ms 454124 KB Output is correct
21 Correct 39 ms 181844 KB Output is correct

Subtask #4
59.0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 170332 KB Output is correct
2 Correct 45 ms 170324 KB Output is correct
3 Correct 46 ms 170332 KB Output is correct
4 Correct 46 ms 170324 KB Output is correct
5 Correct 45 ms 170332 KB Output is correct
6 Correct 45 ms 170324 KB Output is correct
7 Correct 45 ms 170320 KB Output is correct
8 Correct 45 ms 170328 KB Output is correct
9 Correct 44 ms 170176 KB Output is correct
10 Correct 45 ms 170324 KB Output is correct
11 Correct 51 ms 173392 KB Output is correct
12 Correct 55 ms 173304 KB Output is correct
13 Correct 50 ms 173428 KB Output is correct
14 Correct 50 ms 173392 KB Output is correct
15 Correct 51 ms 173388 KB Output is correct
16 Correct 52 ms 173220 KB Output is correct
17 Correct 52 ms 173392 KB Output is correct
18 Correct 51 ms 173392 KB Output is correct
19 Correct 51 ms 173392 KB Output is correct
20 Correct 51 ms 173396 KB Output is correct
21 Correct 50 ms 173396 KB Output is correct
22 Correct 50 ms 173292 KB Output is correct
23 Correct 52 ms 173524 KB Output is correct
24 Correct 53 ms 173260 KB Output is correct
25 Correct 51 ms 173140 KB Output is correct
26 Correct 51 ms 173396 KB Output is correct
27 Correct 51 ms 173352 KB Output is correct
28 Correct 53 ms 173268 KB Output is correct
29 Correct 56 ms 173212 KB Output is correct
30 Correct 52 ms 173136 KB Output is correct
31 Correct 2502 ms 467932 KB Output is correct
32 Correct 942 ms 459736 KB Output is correct
33 Correct 2402 ms 468828 KB Output is correct
34 Correct 935 ms 459808 KB Output is correct
35 Correct 2879 ms 483972 KB Output is correct
36 Correct 985 ms 459656 KB Output is correct
37 Correct 2608 ms 473676 KB Output is correct
38 Correct 958 ms 459772 KB Output is correct
39 Correct 2016 ms 451496 KB Output is correct
40 Correct 2009 ms 450556 KB Output is correct
41 Correct 1959 ms 452156 KB Output is correct
42 Correct 1965 ms 453508 KB Output is correct
43 Correct 1955 ms 451284 KB Output is correct
44 Correct 1984 ms 453752 KB Output is correct
45 Correct 2037 ms 454104 KB Output is correct
46 Correct 1968 ms 451888 KB Output is correct
47 Correct 1959 ms 452008 KB Output is correct
48 Correct 2036 ms 452836 KB Output is correct
49 Correct 1991 ms 454488 KB Output is correct
50 Correct 1970 ms 454124 KB Output is correct
51 Correct 39 ms 181844 KB Output is correct
52 Correct 882 ms 468312 KB Output is correct
53 Correct 901 ms 467524 KB Output is correct
54 Correct 893 ms 467448 KB Output is correct
55 Correct 904 ms 467832 KB Output is correct
56 Correct 894 ms 467768 KB Output is correct
57 Correct 922 ms 471648 KB Output is correct
58 Correct 1682 ms 465468 KB Output is correct
59 Correct 1661 ms 464024 KB Output is correct
60 Correct 1925 ms 472260 KB Output is correct
61 Correct 1916 ms 468796 KB Output is correct
62 Correct 899 ms 466748 KB Output is correct
63 Correct 904 ms 465688 KB Output is correct
64 Correct 921 ms 465384 KB Output is correct
65 Correct 909 ms 466796 KB Output is correct
66 Correct 1633 ms 464912 KB Output is correct
67 Correct 1804 ms 461700 KB Output is correct
68 Correct 1666 ms 466752 KB Output is correct
69 Correct 1761 ms 462596 KB Output is correct
70 Correct 1854 ms 461964 KB Output is correct
71 Correct 1834 ms 458868 KB Output is correct
72 Correct 1888 ms 456900 KB Output is correct
73 Correct 1988 ms 455396 KB Output is correct
74 Correct 1760 ms 456864 KB Output is correct
75 Correct 1968 ms 456712 KB Output is correct
76 Correct 1186 ms 459880 KB Output is correct
77 Correct 1426 ms 462924 KB Output is correct
78 Correct 2079 ms 455128 KB Output is correct
79 Correct 2012 ms 453504 KB Output is correct
80 Correct 2037 ms 457212 KB Output is correct
81 Correct 2052 ms 455252 KB Output is correct
82 Correct 2074 ms 454884 KB Output is correct
83 Correct 2019 ms 453112 KB Output is correct
84 Correct 2084 ms 457348 KB Output is correct
85 Correct 2035 ms 456240 KB Output is correct
86 Correct 2097 ms 454624 KB Output is correct
87 Correct 2072 ms 454208 KB Output is correct
88 Correct 1960 ms 456656 KB Output is correct
89 Correct 1998 ms 454972 KB Output is correct
90 Correct 1839 ms 455204 KB Output is correct
91 Correct 1940 ms 455824 KB Output is correct
92 Correct 1938 ms 454780 KB Output is correct
93 Correct 2035 ms 456312 KB Output is correct
94 Correct 1941 ms 454536 KB Output is correct
95 Correct 1963 ms 455092 KB Output is correct
96 Correct 1962 ms 454120 KB Output is correct
97 Correct 1922 ms 456080 KB Output is correct