oj.uz

답안 #1092159

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092159 2024-09-23T11:15:53 Z vjudge1 수도 (JOI20_capital_city) C++17
41 / 100
 3000 ms 32692 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);
    }
}
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 (vis[u]) continue;
        if (!flag[u])
        {
            res=n;
            break;
        }
        vis[u]=1;
        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);
    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 9820 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 6 ms 9864 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9820 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 9820 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 6 ms 9864 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 5 ms 9820 KB Output is correct
13 Correct 8 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 6 ms 9832 KB Output is correct
16 Correct 9 ms 10040 KB Output is correct
17 Correct 6 ms 9952 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 6 ms 9816 KB Output is correct
20 Correct 6 ms 10072 KB Output is correct
21 Correct 6 ms 9820 KB Output is correct
22 Correct 5 ms 10076 KB Output is correct
23 Correct 5 ms 10076 KB Output is correct
24 Correct 5 ms 9816 KB Output is correct
25 Correct 6 ms 10080 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 6 ms 10072 KB Output is correct
28 Correct 6 ms 10072 KB Output is correct
29 Correct 6 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 299 ms 32200 KB Output is correct
2 Correct 131 ms 32348 KB Output is correct
3 Correct 314 ms 32080 KB Output is correct
4 Correct 126 ms 32528 KB Output is correct
5 Correct 547 ms 30808 KB Output is correct
6 Correct 135 ms 32336 KB Output is correct
7 Correct 1146 ms 31052 KB Output is correct
8 Correct 1398 ms 32460 KB Output is correct
9 Correct 1434 ms 29904 KB Output is correct
10 Correct 1727 ms 28880 KB Output is correct
11 Correct 1492 ms 30156 KB Output is correct
12 Correct 1297 ms 31180 KB Output is correct
13 Correct 1166 ms 28624 KB Output is correct
14 Correct 1438 ms 31248 KB Output is correct
15 Correct 931 ms 31184 KB Output is correct
16 Correct 1297 ms 29188 KB Output is correct
17 Correct 1177 ms 29392 KB Output is correct
18 Correct 1247 ms 29388 KB Output is correct
19 Correct 855 ms 30648 KB Output is correct
20 Correct 2109 ms 31696 KB Output is correct
21 Correct 4 ms 9820 KB Output is correct

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 6 ms 9864 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 4 ms 9820 KB Output is correct
11 Correct 5 ms 9820 KB Output is correct
12 Correct 5 ms 9820 KB Output is correct
13 Correct 8 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 6 ms 9832 KB Output is correct
16 Correct 9 ms 10040 KB Output is correct
17 Correct 6 ms 9952 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 6 ms 9816 KB Output is correct
20 Correct 6 ms 10072 KB Output is correct
21 Correct 6 ms 9820 KB Output is correct
22 Correct 5 ms 10076 KB Output is correct
23 Correct 5 ms 10076 KB Output is correct
24 Correct 5 ms 9816 KB Output is correct
25 Correct 6 ms 10080 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 6 ms 10072 KB Output is correct
28 Correct 6 ms 10072 KB Output is correct
29 Correct 6 ms 9820 KB Output is correct
30 Correct 6 ms 9820 KB Output is correct
31 Correct 299 ms 32200 KB Output is correct
32 Correct 131 ms 32348 KB Output is correct
33 Correct 314 ms 32080 KB Output is correct
34 Correct 126 ms 32528 KB Output is correct
35 Correct 547 ms 30808 KB Output is correct
36 Correct 135 ms 32336 KB Output is correct
37 Correct 1146 ms 31052 KB Output is correct
38 Correct 1398 ms 32460 KB Output is correct
39 Correct 1434 ms 29904 KB Output is correct
40 Correct 1727 ms 28880 KB Output is correct
41 Correct 1492 ms 30156 KB Output is correct
42 Correct 1297 ms 31180 KB Output is correct
43 Correct 1166 ms 28624 KB Output is correct
44 Correct 1438 ms 31248 KB Output is correct
45 Correct 931 ms 31184 KB Output is correct
46 Correct 1297 ms 29188 KB Output is correct
47 Correct 1177 ms 29392 KB Output is correct
48 Correct 1247 ms 29388 KB Output is correct
49 Correct 855 ms 30648 KB Output is correct
50 Correct 2109 ms 31696 KB Output is correct
51 Correct 4 ms 9820 KB Output is correct
52 Correct 233 ms 25120 KB Output is correct
53 Correct 237 ms 25036 KB Output is correct
54 Correct 250 ms 25196 KB Output is correct
55 Correct 257 ms 25072 KB Output is correct
56 Correct 245 ms 25032 KB Output is correct
57 Correct 243 ms 25288 KB Output is correct
58 Correct 231 ms 26560 KB Output is correct
59 Correct 226 ms 26452 KB Output is correct
60 Correct 277 ms 26496 KB Output is correct
61 Correct 257 ms 26704 KB Output is correct
62 Correct 141 ms 32340 KB Output is correct
63 Correct 124 ms 32340 KB Output is correct
64 Correct 862 ms 32692 KB Output is correct
65 Correct 142 ms 32324 KB Output is correct
66 Execution timed out 3076 ms 28964 KB Time limit exceeded
67 Halted 0 ms 0 KB -