oj.uz

Submission #216878

# Submission time Handle Problem Language Result Execution time Memory
216878 2020-03-28T09:12:08 Z _7_7_ Capital City (JOI20_capital_city) C++14
41 / 100
 3000 ms 35980 KB 
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 53;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

int n, k, a, b, c[N], d[N], cnt[N], par[N], ans = inf, Sz;
bool was[N], ok, used[N], us[N], was1[N];
vi g[N], gg[N], cur;
queue < int > q;


void dfs (int v, int p = 0) {
    cur.pb(v);
    cnt[v] = 1;
    
    for (auto to : g[v])
        if (to != p && !was[to]) {
            dfs(to, v);
            cnt[v] += cnt[to];
        }
}

int Find (int v) {
    for (auto to : g[v])
        if (!was[to] && cnt[to] < cnt[v] && Sz - cnt[to] < cnt[to]) 
            return Find(to);
        
    return v;            
}

void dfs1 (int v, int p = 0) {
    par[v] = p;
    
    for (auto to : g[v])
        if (!was[to] && to != p)
            dfs1(to, v);
}


void dfs2 (int v) {
    was1[v] = 1;
    for (auto to : g[v])
        if (!was[to] && !was1[to])
            dfs2(to);
}

void Centroid (int v) {
    cur.clear();
    
    dfs(v);
    for (auto i : cur) {
        used[i] = us[c[i]] = 0;
        was1[i] = 0;
        gg[c[i]].clear();
    }
    
    for (auto i : cur)
        gg[c[i]].pb(i);
    
    ok = 1;
    for (auto i : cur)
        if (!was[i] && d[c[i]] != sz(gg[c[i]])) {
            ok = 0;
            for (auto j : gg[c[i]])
                was[j] = 1;
        }
        
    if (!ok) {
        vi roots;
        for (auto i : cur)
            if (!was[i] && !was1[i]) {
                dfs2(i); 
                roots.pb(i);
            }
        for (auto i : roots)
            Centroid(i);        
        return;
    }        
        
    
    Sz = cnt[v];
    v = Find(v);
    dfs1(v);
    
    q.push(c[v]);
    used[v] = 1;
    us[c[v]] = 1;
    
    int res = 0;
    while (sz(q)) {
        ++res;        
        int C = q.front();
        q.pop();
        
        for (auto i : gg[C]) {
            while (!used[i]) {
                used[i] = 1;
                if (!us[c[i]]) {
                    us[c[i]] = 1;
                    q.push(c[i]);
                }
                i = par[i];
            }
        }
    }
    
    ans = min(ans, res - 1);
    for (auto i : gg[c[v]])
        was[i] = 1;
    
    vi roots;
    for (auto i : cur)
        if (!was[i] && !was1[i]) {
            dfs2(i); 
            roots.pb(i);
        }
    for (auto i : roots)
        Centroid(i);
}


main () {
    scanf("%d%d", &n, &k);
    for (int i = 1; i < n; ++i) {
        scanf("%d%d", &a, &b);
        g[a].pb(b);
        g[b].pb(a);
    }
    
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &c[i]); 
        ++d[c[i]];
    }
    
    Centroid(1);
    cout << ans << endl;
}

Compilation message

capital_city.cpp:156:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
capital_city.cpp: In function 'int main()':
capital_city.cpp:157:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
capital_city.cpp:159:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~
capital_city.cpp:165:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &c[i]); 
         ~~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 12 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 9728 KB Output is correct
8 Correct 10 ms 9728 KB Output is correct
9 Correct 10 ms 9728 KB Output is correct
10 Correct 10 ms 9728 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 12 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 9728 KB Output is correct
8 Correct 10 ms 9728 KB Output is correct
9 Correct 10 ms 9728 KB Output is correct
10 Correct 10 ms 9728 KB Output is correct
11 Correct 11 ms 9856 KB Output is correct
12 Correct 12 ms 9856 KB Output is correct
13 Correct 11 ms 9856 KB Output is correct
14 Correct 11 ms 9856 KB Output is correct
15 Correct 17 ms 9856 KB Output is correct
16 Correct 12 ms 9856 KB Output is correct
17 Correct 11 ms 9984 KB Output is correct
18 Correct 11 ms 9984 KB Output is correct
19 Correct 11 ms 9948 KB Output is correct
20 Correct 11 ms 9984 KB Output is correct
21 Correct 11 ms 9984 KB Output is correct
22 Correct 11 ms 10016 KB Output is correct
23 Correct 11 ms 9984 KB Output is correct
24 Correct 18 ms 9984 KB Output is correct
25 Correct 11 ms 9984 KB Output is correct
26 Correct 11 ms 9984 KB Output is correct
27 Correct 11 ms 9984 KB Output is correct
28 Correct 11 ms 9984 KB Output is correct
29 Correct 11 ms 9856 KB Output is correct
30 Correct 11 ms 9984 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 35432 KB Output is correct
2 Correct 153 ms 35980 KB Output is correct
3 Correct 266 ms 35180 KB Output is correct
4 Correct 144 ms 35820 KB Output is correct
5 Correct 289 ms 32876 KB Output is correct
6 Correct 142 ms 35820 KB Output is correct
7 Correct 300 ms 33004 KB Output is correct
8 Correct 146 ms 35436 KB Output is correct
9 Correct 387 ms 31416 KB Output is correct
10 Correct 383 ms 29416 KB Output is correct
11 Correct 397 ms 31748 KB Output is correct
12 Correct 391 ms 33864 KB Output is correct
13 Correct 412 ms 29036 KB Output is correct
14 Correct 427 ms 34156 KB Output is correct
15 Correct 408 ms 33924 KB Output is correct
16 Correct 418 ms 29916 KB Output is correct
17 Correct 404 ms 30324 KB Output is correct
18 Correct 374 ms 30420 KB Output is correct
19 Correct 389 ms 33060 KB Output is correct
20 Correct 373 ms 34724 KB Output is correct
21 Correct 11 ms 9728 KB Output is correct

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 12 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 9728 KB Output is correct
8 Correct 10 ms 9728 KB Output is correct
9 Correct 10 ms 9728 KB Output is correct
10 Correct 10 ms 9728 KB Output is correct
11 Correct 11 ms 9856 KB Output is correct
12 Correct 12 ms 9856 KB Output is correct
13 Correct 11 ms 9856 KB Output is correct
14 Correct 11 ms 9856 KB Output is correct
15 Correct 17 ms 9856 KB Output is correct
16 Correct 12 ms 9856 KB Output is correct
17 Correct 11 ms 9984 KB Output is correct
18 Correct 11 ms 9984 KB Output is correct
19 Correct 11 ms 9948 KB Output is correct
20 Correct 11 ms 9984 KB Output is correct
21 Correct 11 ms 9984 KB Output is correct
22 Correct 11 ms 10016 KB Output is correct
23 Correct 11 ms 9984 KB Output is correct
24 Correct 18 ms 9984 KB Output is correct
25 Correct 11 ms 9984 KB Output is correct
26 Correct 11 ms 9984 KB Output is correct
27 Correct 11 ms 9984 KB Output is correct
28 Correct 11 ms 9984 KB Output is correct
29 Correct 11 ms 9856 KB Output is correct
30 Correct 11 ms 9984 KB Output is correct
31 Correct 269 ms 35432 KB Output is correct
32 Correct 153 ms 35980 KB Output is correct
33 Correct 266 ms 35180 KB Output is correct
34 Correct 144 ms 35820 KB Output is correct
35 Correct 289 ms 32876 KB Output is correct
36 Correct 142 ms 35820 KB Output is correct
37 Correct 300 ms 33004 KB Output is correct
38 Correct 146 ms 35436 KB Output is correct
39 Correct 387 ms 31416 KB Output is correct
40 Correct 383 ms 29416 KB Output is correct
41 Correct 397 ms 31748 KB Output is correct
42 Correct 391 ms 33864 KB Output is correct
43 Correct 412 ms 29036 KB Output is correct
44 Correct 427 ms 34156 KB Output is correct
45 Correct 408 ms 33924 KB Output is correct
46 Correct 418 ms 29916 KB Output is correct
47 Correct 404 ms 30324 KB Output is correct
48 Correct 374 ms 30420 KB Output is correct
49 Correct 389 ms 33060 KB Output is correct
50 Correct 373 ms 34724 KB Output is correct
51 Correct 11 ms 9728 KB Output is correct
52 Correct 325 ms 21864 KB Output is correct
53 Correct 327 ms 21844 KB Output is correct
54 Correct 304 ms 21708 KB Output is correct
55 Correct 323 ms 21720 KB Output is correct
56 Correct 326 ms 21608 KB Output is correct
57 Correct 325 ms 21872 KB Output is correct
58 Execution timed out 3076 ms 24552 KB Time limit exceeded
59 Halted 0 ms 0 KB -