oj.uz

답안 #1092157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092157 2024-09-23T11:07:48 Z vjudge1 수도 (JOI20_capital_city) C++17
11 / 100
 3000 ms 37184 KB 

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define all(x) x.begin(),x.end()
#define pb push_back
#define for1(i,x,n) for(int i=x;i<=n;i++)
#define for2(i,x,n) for(int i=x;i>=n;i--)
#define int ll

typedef long long ll;
typedef pair<int,int> pii;

const ll maxn=2e5+69;
const ll mod=1e9+7;
const ll inf=1e18;

int n,k,c[maxn];
vector<int> adj[maxn],L[maxn];

int sz[maxn],par[maxn];
bool flag[maxn],vis[maxn],used[maxn],dd[maxn];

void dfs_sz(int u,int pre)
{
    sz[u]=1;
    for(int v: adj[u])
    {
        if (v==pre||used[v]) continue;
        dfs_sz(v,u);
        sz[u]+=sz[v];
    }
}
int Find_cen(int u,int pre,int ts)
{
    for(int v:adj[u])
    {
        if (v==pre||used[v]) continue;
        if (sz[v]*2>ts) return Find_cen(v,u,ts);
    }
    return u;
}
void dfs_on(int u,int pre)
{
    flag[u]=1;
    par[u]=pre;
    vis[u]=0;
    for(int v:adj[u])
    {
        if (v==pre||used[v]) continue;
        dfs_on(v,u);
    }
}
void dfs_off(int u,int pre)
{
    flag[u]=0;
    vis[u]=0;
    dd[c[u]]=0;
    for(int v:adj[u])
    {
        if (v==pre||used[v]) continue;
        dfs_off(v,u);
    }
}
int centroid(int u)
{
    dfs_sz(u,-1);
    u=Find_cen(u,-1,sz[u]);
    used[u]=1;
    dfs_on(u,-1);
    vector<int>Q;
    for(int v:L[c[u]]) Q.pb(v);
    dd[c[u]]=1;
    int res=0;
    while (!Q.empty())
    {
        int u=Q.back();
        Q.pop_back();
        if (vis[u]) continue;
        if (!flag[u])
        {
            res=inf;
            break;
        }
        vis[u]=1;
        if (par[u]==-1) continue;
        if (!dd[c[par[u]]])
        {
            for(int v:L[c[par[u]]]) Q.pb(v);
            dd[c[par[u]]]=1;
            res++;
        }
    }
    dfs_off(u,-1);
    for(int v: adj[u]) if (!used[v]) res=min(res,centroid(v));
    return res;
}
void sol()
{
    cin >> n>>k;
    for1(i,1,n-1)
    {
        int u,v; cin >> u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    for1(i,1,n)
    {
        cin >>c[i];
        L[c[i]].pb(i);
    }
    cout << centroid(1);
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("wall.inp","r",stdin);
//    freopen("wall.out","w",stdout);
    int t=1;//cin >> t;
    while (t--)
    {
//        cerr<<"avdsava "<< t<<'\n';
        sol();
    }
}
/*
1
3
3 2 3 1 1 2
4 1
6 1
3 5
5 1
2 4
*/

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9820 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 5 ms 9820 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9780 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9820 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 5 ms 9820 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9780 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 6 ms 10072 KB Output is correct
12 Correct 7 ms 10076 KB Output is correct
13 Correct 5 ms 10076 KB Output is correct
14 Correct 6 ms 10076 KB Output is correct
15 Correct 5 ms 10076 KB Output is correct
16 Correct 6 ms 10076 KB Output is correct
17 Correct 7 ms 10076 KB Output is correct
18 Correct 6 ms 10076 KB Output is correct
19 Correct 10 ms 10164 KB Output is correct
20 Correct 6 ms 10076 KB Output is correct
21 Correct 7 ms 9968 KB Output is correct
22 Correct 5 ms 10080 KB Output is correct
23 Correct 6 ms 10076 KB Output is correct
24 Correct 5 ms 10076 KB Output is correct
25 Correct 7 ms 10076 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 6 ms 10076 KB Output is correct
28 Correct 6 ms 10076 KB Output is correct
29 Correct 5 ms 9876 KB Output is correct
30 Correct 6 ms 10076 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 33872 KB Output is correct
2 Correct 134 ms 34128 KB Output is correct
3 Correct 309 ms 33656 KB Output is correct
4 Correct 131 ms 34132 KB Output is correct
5 Correct 1157 ms 34756 KB Output is correct
6 Correct 146 ms 34556 KB Output is correct
7 Execution timed out 3082 ms 37184 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9820 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 5 ms 9820 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9780 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 6 ms 10072 KB Output is correct
12 Correct 7 ms 10076 KB Output is correct
13 Correct 5 ms 10076 KB Output is correct
14 Correct 6 ms 10076 KB Output is correct
15 Correct 5 ms 10076 KB Output is correct
16 Correct 6 ms 10076 KB Output is correct
17 Correct 7 ms 10076 KB Output is correct
18 Correct 6 ms 10076 KB Output is correct
19 Correct 10 ms 10164 KB Output is correct
20 Correct 6 ms 10076 KB Output is correct
21 Correct 7 ms 9968 KB Output is correct
22 Correct 5 ms 10080 KB Output is correct
23 Correct 6 ms 10076 KB Output is correct
24 Correct 5 ms 10076 KB Output is correct
25 Correct 7 ms 10076 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 6 ms 10076 KB Output is correct
28 Correct 6 ms 10076 KB Output is correct
29 Correct 5 ms 9876 KB Output is correct
30 Correct 6 ms 10076 KB Output is correct
31 Correct 305 ms 33872 KB Output is correct
32 Correct 134 ms 34128 KB Output is correct
33 Correct 309 ms 33656 KB Output is correct
34 Correct 131 ms 34132 KB Output is correct
35 Correct 1157 ms 34756 KB Output is correct
36 Correct 146 ms 34556 KB Output is correct
37 Execution timed out 3082 ms 37184 KB Time limit exceeded
38 Halted 0 ms 0 KB -