oj.uz

답안 #526416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526416 2022-02-14T17:53:35 Z CPSC 수도 (JOI20_capital_city) C++14
11 / 100
 3000 ms 47992 KB 
# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
const int N = 3e5 + 5;
int  sz[N],par[N],col[N],viss[N],blocked[N],now[N],vis[N],ans,n,k,a,b;
vector <int> v[N],vv[N];
void dfs(int a, int p) {
    if (vis[a]) return ;
    sz[a] = 1;
    par[a] = p;
    now[a] = 1;
    for (int i = 0; i < v[a].size(); i++) {
        int to = v[a][i];
        //cout<<a<<"          "<<to<<endl;
        if (to == p || vis[to]) continue;
        dfs(to,a);
        sz[a] += sz[to];
    }
}
int find_centroid(int a, int p, int raod) {
    for (int i = 0; i < v[a].size(); i++) {
        int to = v[a][i];
        if (vis[to] || to == p) continue;
        if (sz[to] > raod/2) return find_centroid(to,a,raod);
    }
    return a;
}
void init(int a, int p) {
    if (vis[a]) return;
    now[a] = 0;
    for (int i = 0; i < v[a].size(); i++) {
        int to = v[a][i];
        if (to == p || vis[to]) continue;
         init(to,a);
    }
}
void init_centroid(int a, int p){ 
    dfs(a,p);

    int c = find_centroid(a, p ,sz[a]); 
    dfs(c,p);
    vis[c] = 1;
    par[c] = p;
    int x = col[c];
    queue <int> q;
    for (int i = 0; i < vv[x].size(); i++) {
         q.push(vv[x][i]);
         viss[x] = 1;
    }
    int pas = 0;
    int ff = 0;

    vector <int> vvv;
    vvv.pb(x);
    //cout<<q.size()<<endl;
    //cout<<c<<"centroid"<<endl;
    while (q.size()) {
        int vert = q.front();
        int parr = par[vert];
        if (!now[vert]) {
            ff = 1;break;
        }
        if (blocked[col[vert]]) {
            ff = 1;
             break;
        }
        q.pop();
        if (parr == -1) continue;
        if (vert != c && par[vert] && !viss[col[parr]]) {
            pas++;
             vvv.pb(col[parr]);
            for (int i = 0; i < vv[col[parr]].size(); i++) {
                int vert1 = vv[col[parr]][i];
                 q.push(vert1);
            }
            viss[col[parr]] = 1;
        }
    }
    if (!ff) {
        ans = min(ans, pas);
    }
    for (int i = 0; i < vvv.size(); i++) viss[vvv[i]] = 0;
    init(a,p);
    blocked[col[c]] = 1;
    vis[c] = 1;
    
    for (int i = 0; i < v[c].size(); i++) {
        if(!vis[v[c][i]]) init_centroid(v[c][i],c);
    }
}
main() {
    cin>>n>>k;
    ans = 1e9;
    for (int i = 1; i <= n - 1; i++) {
        cin>>a>>b;
        v[a].pb(b);
        v[b].pb(a);
    }
    for (int i = 1; i <= n; i++) {
        cin>>col[i];
        vv[col[i]].pb(i);
    } //cout<<endl<<endl;
    init_centroid(1,-1);
    cout<<ans<<endl;
}

Compilation message

capital_city.cpp: In function 'void dfs(int, int)':
capital_city.cpp:14:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i = 0; i < v[a].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
capital_city.cpp: In function 'int find_centroid(int, int, int)':
capital_city.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 0; i < v[a].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
capital_city.cpp: In function 'void init(int, int)':
capital_city.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < v[a].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
capital_city.cpp: In function 'void init_centroid(int, int)':
capital_city.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 0; i < vv[x].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
capital_city.cpp:74:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             for (int i = 0; i < vv[col[parr]].size(); i++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~
capital_city.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (int i = 0; i < vvv.size(); i++) viss[vvv[i]] = 0;
      |                     ~~^~~~~~~~~~~~
capital_city.cpp:89:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for (int i = 0; i < v[c].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
capital_city.cpp: At global scope:
capital_city.cpp:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main() {
      | ^~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 7 ms 14368 KB Output is correct
3 Correct 7 ms 14412 KB Output is correct
4 Correct 7 ms 14412 KB Output is correct
5 Correct 7 ms 14412 KB Output is correct
6 Correct 7 ms 14412 KB Output is correct
7 Correct 10 ms 14328 KB Output is correct
8 Correct 8 ms 14412 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 7 ms 14412 KB Output is correct
11 Correct 9 ms 14540 KB Output is correct
12 Correct 10 ms 14540 KB Output is correct
13 Correct 9 ms 14472 KB Output is correct
14 Correct 10 ms 14540 KB Output is correct
15 Correct 10 ms 14540 KB Output is correct
16 Correct 12 ms 14524 KB Output is correct
17 Correct 18 ms 14668 KB Output is correct
18 Correct 17 ms 14668 KB Output is correct
19 Correct 18 ms 14668 KB Output is correct
20 Correct 16 ms 14588 KB Output is correct
21 Correct 16 ms 14696 KB Output is correct
22 Correct 10 ms 14660 KB Output is correct
23 Correct 10 ms 14668 KB Output is correct
24 Correct 10 ms 14540 KB Output is correct
25 Correct 10 ms 14656 KB Output is correct
26 Correct 13 ms 14780 KB Output is correct
27 Correct 12 ms 14668 KB Output is correct
28 Correct 11 ms 14668 KB Output is correct
29 Correct 11 ms 14532 KB Output is correct
30 Correct 11 ms 14660 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 647 ms 43652 KB Output is correct
2 Correct 326 ms 44268 KB Output is correct
3 Correct 727 ms 43436 KB Output is correct
4 Correct 343 ms 44388 KB Output is correct
5 Correct 2120 ms 41504 KB Output is correct
6 Correct 388 ms 47992 KB Output is correct
7 Execution timed out 3085 ms 46376 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 7 ms 14368 KB Output is correct
3 Correct 7 ms 14412 KB Output is correct
4 Correct 7 ms 14412 KB Output is correct
5 Correct 7 ms 14412 KB Output is correct
6 Correct 7 ms 14412 KB Output is correct
7 Correct 10 ms 14328 KB Output is correct
8 Correct 8 ms 14412 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 7 ms 14412 KB Output is correct
11 Correct 9 ms 14540 KB Output is correct
12 Correct 10 ms 14540 KB Output is correct
13 Correct 9 ms 14472 KB Output is correct
14 Correct 10 ms 14540 KB Output is correct
15 Correct 10 ms 14540 KB Output is correct
16 Correct 12 ms 14524 KB Output is correct
17 Correct 18 ms 14668 KB Output is correct
18 Correct 17 ms 14668 KB Output is correct
19 Correct 18 ms 14668 KB Output is correct
20 Correct 16 ms 14588 KB Output is correct
21 Correct 16 ms 14696 KB Output is correct
22 Correct 10 ms 14660 KB Output is correct
23 Correct 10 ms 14668 KB Output is correct
24 Correct 10 ms 14540 KB Output is correct
25 Correct 10 ms 14656 KB Output is correct
26 Correct 13 ms 14780 KB Output is correct
27 Correct 12 ms 14668 KB Output is correct
28 Correct 11 ms 14668 KB Output is correct
29 Correct 11 ms 14532 KB Output is correct
30 Correct 11 ms 14660 KB Output is correct
31 Correct 647 ms 43652 KB Output is correct
32 Correct 326 ms 44268 KB Output is correct
33 Correct 727 ms 43436 KB Output is correct
34 Correct 343 ms 44388 KB Output is correct
35 Correct 2120 ms 41504 KB Output is correct
36 Correct 388 ms 47992 KB Output is correct
37 Execution timed out 3085 ms 46376 KB Time limit exceeded
38 Halted 0 ms 0 KB -