oj.uz

Submission #428135

# Submission time Handle Problem Language Result Execution time Memory
428135 2021-06-15T08:19:43 Z juggernaut Capital City (JOI20_capital_city) C++17
11 / 100
 3000 ms 315064 KB 
#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
typedef long long ll;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef IOI2021SG
    #define printl(args...)printf(args)
#else
    #define printl(args...)((void)0)
#endif
int n,k;
int tin[200005],tout[200005],timer,up[200005][18];
vector<int>g[200005],color[200005],g1[200005],g2[200005];
int a[200005];
void dfs(int v,int p){
    tin[v]=++timer;
    up[v][0]=p;
    for(int i=1;i<18;i++)up[v][i]=up[up[v][i-1]][i-1];
    for(int to:g[v])if(to!=p)dfs(to,v);
    tout[v]=++timer;
}
bool upper(int a,int b){
    return tin[a]<=tin[b]&&tout[a]>=tout[b];
}
int lca(int a,int b){
    if(upper(a,b))return a;
    if(upper(b,a))return b;
    for(int i=17;i>=0;i--)if(!upper(up[a][i],b))a=up[a][i];
    return up[a][0];
}
unordered_map<int,bool>vs[200005];
vector<pair<int,int>>edges;
void add_edge(int a,int b){
    if(a^b){
        if(vs[a][b])return;
        vs[a][b]=true;
        edges.emplace_back(a,b);
        g1[a].push_back(b);
        g2[b].push_back(a);
    }
}
void add(int v,int a,int b){
    int lca=::lca(a,b);
    while(a!=lca){
        a=up[a][0];
        add_edge(v,::a[a]);
    }
    while(b!=lca){
        b=up[b][0];
        add_edge(v,::a[b]);
    }
}
int cnt=0;
bool vis[200005];
void run(int v){
    vis[v]=true;
    cnt++;
    for(int to:g1[v])if(!vis[to])run(to);
}
int main(){
    scanf("%d%d",&n,&k);
    for(int i=1;i<n;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        color[a[i]].push_back(i);
    }
    dfs(1,1);
    for(int i=1;i<=k;i++)
        for(int j=1;j<(int)color[i].size();j++)add(i,color[i][0],color[i][j]);
    int ans=k;
    for(int i=1;i<=k;i++){
        for(int j=1;j<=k;j++)vis[j]=false;
        cnt=0;
        run(i);
        umin(ans,cnt);
    }
    printf("%d",ans-1);
}

Compilation message

capital_city.cpp: In function 'void usaco(std::string)':
capital_city.cpp:5:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
capital_city.cpp:5:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
capital_city.cpp: In function 'int main()':
capital_city.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
capital_city.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~
capital_city.cpp:78:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 30004 KB Output is correct
2 Correct 19 ms 30028 KB Output is correct
3 Correct 19 ms 30048 KB Output is correct
4 Correct 18 ms 29960 KB Output is correct
5 Correct 18 ms 29964 KB Output is correct
6 Correct 19 ms 30028 KB Output is correct
7 Correct 18 ms 30056 KB Output is correct
8 Correct 25 ms 30076 KB Output is correct
9 Correct 18 ms 30028 KB Output is correct
10 Correct 18 ms 29984 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 30004 KB Output is correct
2 Correct 19 ms 30028 KB Output is correct
3 Correct 19 ms 30048 KB Output is correct
4 Correct 18 ms 29960 KB Output is correct
5 Correct 18 ms 29964 KB Output is correct
6 Correct 19 ms 30028 KB Output is correct
7 Correct 18 ms 30056 KB Output is correct
8 Correct 25 ms 30076 KB Output is correct
9 Correct 18 ms 30028 KB Output is correct
10 Correct 18 ms 29984 KB Output is correct
11 Correct 25 ms 30828 KB Output is correct
12 Correct 26 ms 30924 KB Output is correct
13 Correct 28 ms 30828 KB Output is correct
14 Correct 25 ms 30840 KB Output is correct
15 Correct 31 ms 31680 KB Output is correct
16 Correct 43 ms 35444 KB Output is correct
17 Correct 39 ms 30476 KB Output is correct
18 Correct 33 ms 30504 KB Output is correct
19 Correct 31 ms 30580 KB Output is correct
20 Correct 28 ms 30384 KB Output is correct
21 Correct 34 ms 30452 KB Output is correct
22 Correct 245 ms 60860 KB Output is correct
23 Correct 259 ms 58624 KB Output is correct
24 Correct 25 ms 30540 KB Output is correct
25 Correct 31 ms 30720 KB Output is correct
26 Correct 29 ms 30584 KB Output is correct
27 Correct 33 ms 30776 KB Output is correct
28 Correct 29 ms 30920 KB Output is correct
29 Correct 34 ms 31000 KB Output is correct
30 Correct 28 ms 30788 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3082 ms 315064 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 30004 KB Output is correct
2 Correct 19 ms 30028 KB Output is correct
3 Correct 19 ms 30048 KB Output is correct
4 Correct 18 ms 29960 KB Output is correct
5 Correct 18 ms 29964 KB Output is correct
6 Correct 19 ms 30028 KB Output is correct
7 Correct 18 ms 30056 KB Output is correct
8 Correct 25 ms 30076 KB Output is correct
9 Correct 18 ms 30028 KB Output is correct
10 Correct 18 ms 29984 KB Output is correct
11 Correct 25 ms 30828 KB Output is correct
12 Correct 26 ms 30924 KB Output is correct
13 Correct 28 ms 30828 KB Output is correct
14 Correct 25 ms 30840 KB Output is correct
15 Correct 31 ms 31680 KB Output is correct
16 Correct 43 ms 35444 KB Output is correct
17 Correct 39 ms 30476 KB Output is correct
18 Correct 33 ms 30504 KB Output is correct
19 Correct 31 ms 30580 KB Output is correct
20 Correct 28 ms 30384 KB Output is correct
21 Correct 34 ms 30452 KB Output is correct
22 Correct 245 ms 60860 KB Output is correct
23 Correct 259 ms 58624 KB Output is correct
24 Correct 25 ms 30540 KB Output is correct
25 Correct 31 ms 30720 KB Output is correct
26 Correct 29 ms 30584 KB Output is correct
27 Correct 33 ms 30776 KB Output is correct
28 Correct 29 ms 30920 KB Output is correct
29 Correct 34 ms 31000 KB Output is correct
30 Correct 28 ms 30788 KB Output is correct
31 Execution timed out 3082 ms 315064 KB Time limit exceeded
32 Halted 0 ms 0 KB -