oj.uz

답안 #1092160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092160 2024-09-23T11:24:27 Z vjudge1 수도 (JOI20_capital_city) C++17
41 / 100
 3000 ms 32340 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],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;
    dd[c[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;
    dd[c[u]]=0;
    for(int v:adj[u])
    {
        if (v==pre||used[v]) continue;
        dfs_off(v,u);
    }
}
vector<int>Q;
int centroid(int u)
{
    dfs_sz(u,-1);
    u=Find_cen(u,-1,sz[u]);
    used[u]=1;
    dfs_on(u,-1);
    Q.clear();
    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 (!flag[u])
        {
            res=n;
            break;
        }
        if (par[u]==-1) continue;
        if (!dd[c[par[u]]])
        {
            for(int v:L[c[par[u]]])
            {
                if (!flag[v])
                {
                    res=n;
                    break;
                }
                Q.pb(v);
            }
            if (!Q.empty() && !flag[Q.back()]) break;
            dd[c[par[u]]]=1;
            res++;
        }
    }
//    Q.clear();
    dfs_off(u,-1);
//    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 5 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9888 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9748 KB Output is correct
6 Correct 4 ms 9636 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 5 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9888 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9748 KB Output is correct
6 Correct 4 ms 9636 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 5 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 6 ms 9820 KB Output is correct
13 Correct 8 ms 10028 KB Output is correct
14 Correct 5 ms 10012 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 5 ms 9820 KB Output is correct
17 Correct 7 ms 9816 KB Output is correct
18 Correct 6 ms 9820 KB Output is correct
19 Correct 6 ms 9820 KB Output is correct
20 Correct 7 ms 9960 KB Output is correct
21 Correct 6 ms 10060 KB Output is correct
22 Correct 5 ms 10076 KB Output is correct
23 Correct 5 ms 9820 KB Output is correct
24 Correct 5 ms 10044 KB Output is correct
25 Correct 5 ms 9952 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 5 ms 9832 KB Output is correct
28 Correct 5 ms 9820 KB Output is correct
29 Correct 5 ms 9820 KB Output is correct
30 Correct 6 ms 9820 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 359 ms 32124 KB Output is correct
2 Correct 129 ms 32336 KB Output is correct
3 Correct 290 ms 31992 KB Output is correct
4 Correct 130 ms 32084 KB Output is correct
5 Correct 541 ms 30600 KB Output is correct
6 Correct 140 ms 32120 KB Output is correct
7 Correct 1133 ms 31056 KB Output is correct
8 Correct 1435 ms 32292 KB Output is correct
9 Correct 1465 ms 29644 KB Output is correct
10 Correct 1753 ms 28704 KB Output is correct
11 Correct 1440 ms 29908 KB Output is correct
12 Correct 1301 ms 30980 KB Output is correct
13 Correct 1224 ms 28408 KB Output is correct
14 Correct 1483 ms 31248 KB Output is correct
15 Correct 912 ms 30924 KB Output is correct
16 Correct 1222 ms 28988 KB Output is correct
17 Correct 1208 ms 29132 KB Output is correct
18 Correct 1337 ms 29100 KB Output is correct
19 Correct 894 ms 30664 KB Output is correct
20 Correct 2141 ms 31440 KB Output is correct
21 Correct 4 ms 9816 KB Output is correct

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9888 KB Output is correct
4 Correct 5 ms 9820 KB Output is correct
5 Correct 4 ms 9748 KB Output is correct
6 Correct 4 ms 9636 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 5 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 6 ms 9820 KB Output is correct
13 Correct 8 ms 10028 KB Output is correct
14 Correct 5 ms 10012 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 5 ms 9820 KB Output is correct
17 Correct 7 ms 9816 KB Output is correct
18 Correct 6 ms 9820 KB Output is correct
19 Correct 6 ms 9820 KB Output is correct
20 Correct 7 ms 9960 KB Output is correct
21 Correct 6 ms 10060 KB Output is correct
22 Correct 5 ms 10076 KB Output is correct
23 Correct 5 ms 9820 KB Output is correct
24 Correct 5 ms 10044 KB Output is correct
25 Correct 5 ms 9952 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 5 ms 9832 KB Output is correct
28 Correct 5 ms 9820 KB Output is correct
29 Correct 5 ms 9820 KB Output is correct
30 Correct 6 ms 9820 KB Output is correct
31 Correct 359 ms 32124 KB Output is correct
32 Correct 129 ms 32336 KB Output is correct
33 Correct 290 ms 31992 KB Output is correct
34 Correct 130 ms 32084 KB Output is correct
35 Correct 541 ms 30600 KB Output is correct
36 Correct 140 ms 32120 KB Output is correct
37 Correct 1133 ms 31056 KB Output is correct
38 Correct 1435 ms 32292 KB Output is correct
39 Correct 1465 ms 29644 KB Output is correct
40 Correct 1753 ms 28704 KB Output is correct
41 Correct 1440 ms 29908 KB Output is correct
42 Correct 1301 ms 30980 KB Output is correct
43 Correct 1224 ms 28408 KB Output is correct
44 Correct 1483 ms 31248 KB Output is correct
45 Correct 912 ms 30924 KB Output is correct
46 Correct 1222 ms 28988 KB Output is correct
47 Correct 1208 ms 29132 KB Output is correct
48 Correct 1337 ms 29100 KB Output is correct
49 Correct 894 ms 30664 KB Output is correct
50 Correct 2141 ms 31440 KB Output is correct
51 Correct 4 ms 9816 KB Output is correct
52 Correct 235 ms 25040 KB Output is correct
53 Correct 238 ms 25036 KB Output is correct
54 Correct 249 ms 24824 KB Output is correct
55 Correct 250 ms 25036 KB Output is correct
56 Correct 231 ms 25036 KB Output is correct
57 Correct 240 ms 25032 KB Output is correct
58 Correct 240 ms 26428 KB Output is correct
59 Correct 231 ms 26196 KB Output is correct
60 Correct 264 ms 26192 KB Output is correct
61 Correct 283 ms 26192 KB Output is correct
62 Correct 132 ms 32164 KB Output is correct
63 Correct 130 ms 32340 KB Output is correct
64 Correct 850 ms 32136 KB Output is correct
65 Correct 140 ms 32256 KB Output is correct
66 Execution timed out 3041 ms 28840 KB Time limit exceeded
67 Halted 0 ms 0 KB -