oj.uz

Submission #602071

# Submission time Handle Problem Language Result Execution time Memory
602071 2022-07-22T14:29:20 Z AA_Surely Capital City (JOI20_capital_city) C++14
41 / 100
 3000 ms 37724 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

int n, k, vcnt;
int eset[N][2], ns[N];
int comp[N], par[N], sz[N];
bool valid[N], vis[N];
VI adj[N], rs, group[N];

void init() {
    cin >> n >> k;
    F0R(i, n - 1) {
        cin >> eset[i][0] >> eset[i][1];
        eset[i][0]--; eset[i][1]--;
    }

    F0R(i, n) {
        cin >> ns[i];
        ns[i]--;
        group[ ns[i] ].pb(i);
    }

    fill(valid, valid + k, 1);
    vcnt = k;
    return;
}

void preD(int now, int c) {
    vis[now] = 1;
    comp[now] = c;

    for(int on : adj[now]) if (!vis[on]) preD(on, c);
    return;
}

bool buildGraph() {
    F0R(i, n) adj[i].clear();
    rs.clear();

    F0R(i, n - 1) {
        if (valid[ ns[ eset[i][0] ] ] && valid[ ns[ eset[i][1] ] ]) {
            adj[ eset[i][0] ].pb(eset[i][1]);
            adj[ eset[i][1] ].pb(eset[i][0]);
        }
    }
    
    memset(vis, 0, sizeof vis);

    int c = 0;
    F0R(i, n) if (!vis[i]) {
        rs.pb(i);
        preD(i, c);
        c++;
    }
    
    F0R(i, k) {
        FOR(j, 1, group[i].size()) {
            if (valid[i] && comp[ group[i][j] ] != comp[ group[i][j - 1] ]) {
                vcnt--;
                valid[i] = 0;
            }
        }
    }

    return 1;
}

int getSz(int now, int p) {
    sz[now] = 1;
    for(int on : adj[now]) if (on != p) sz[now] += getSz(on, now);
    return sz[now];
}

int getCent(int now, int p, int s) {
    for(int on : adj[now]) if (on != p) 
        if (sz[on] > (s / 2)) return getCent(on, now, s);
    return now;
}

void getPar(int now, int p) {
    par[now] = p;
    for(int on : adj[now]) if (on != p) getPar(on, now);
    return;
}

int solve(int root) {
    getSz(root, -1);
    int c = getCent(root, -1, sz[root]);
    getPar(c, -1);

    int ret = 0;
    if (!valid[ ns[c] ]) return INF;

    queue<int> keep;
    keep.push(ns[c]);
    assert(!vis[ ns[c] ]);
    vis[ ns[c] ] = 1;

    while(!keep.empty()) {
        int now = keep.front();
        keep.pop();

        for(int on : group[now]) {
            int p = par[on];
            if (p == -1) continue;
            if (!valid[ ns[p] ]) return INF;
            if (!vis[ ns[p] ]) {
                keep.push(ns[p]);
                vis[ ns[p] ] = 1;
                ret++;
            }
        }
    }
    
    if (valid[ ns[c] ]) vcnt--;
    valid[ ns[c] ] = 0;

    return ret;
}

int main() {
    IOS;
    
    init();

    int ans = INF;
    int cc = 0;
    while(buildGraph() && vcnt) {
        cc++;
        assert(cc <= 1000);
        memset(vis, 0, sizeof vis);
        for(const int &on : rs)
            ans = min(ans, solve(on));
    }
    
    cout << ans;
}

Compilation message

capital_city.cpp: In function 'bool buildGraph()':
capital_city.cpp:3:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define FOR(i,x,n)  for(int i=x; i<n; i++)
......
   88 |         FOR(j, 1, group[i].size()) {
      |             ~~~~~~~~~~~~~~~~~~~~~  
capital_city.cpp:88:9: note: in expansion of macro 'FOR'
   88 |         FOR(j, 1, group[i].size()) {
      |         ^~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9940 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 9940 KB Output is correct
4 Correct 5 ms 9824 KB Output is correct
5 Correct 5 ms 9940 KB Output is correct
6 Correct 5 ms 9940 KB Output is correct
7 Correct 6 ms 9940 KB Output is correct
8 Correct 7 ms 9944 KB Output is correct
9 Correct 5 ms 9940 KB Output is correct
10 Correct 5 ms 9904 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9940 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 9940 KB Output is correct
4 Correct 5 ms 9824 KB Output is correct
5 Correct 5 ms 9940 KB Output is correct
6 Correct 5 ms 9940 KB Output is correct
7 Correct 6 ms 9940 KB Output is correct
8 Correct 7 ms 9944 KB Output is correct
9 Correct 5 ms 9940 KB Output is correct
10 Correct 5 ms 9904 KB Output is correct
11 Correct 6 ms 10028 KB Output is correct
12 Correct 6 ms 10068 KB Output is correct
13 Correct 6 ms 10068 KB Output is correct
14 Correct 6 ms 10068 KB Output is correct
15 Correct 15 ms 10068 KB Output is correct
16 Correct 10 ms 10012 KB Output is correct
17 Correct 6 ms 10068 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 6 ms 10068 KB Output is correct
20 Correct 6 ms 10068 KB Output is correct
21 Correct 7 ms 10068 KB Output is correct
22 Correct 6 ms 10196 KB Output is correct
23 Correct 5 ms 10068 KB Output is correct
24 Correct 25 ms 10068 KB Output is correct
25 Correct 6 ms 10068 KB Output is correct
26 Correct 6 ms 10204 KB Output is correct
27 Correct 7 ms 10088 KB Output is correct
28 Correct 6 ms 10068 KB Output is correct
29 Correct 6 ms 10036 KB Output is correct
30 Correct 7 ms 10068 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 36160 KB Output is correct
2 Correct 89 ms 36556 KB Output is correct
3 Correct 181 ms 35916 KB Output is correct
4 Correct 89 ms 36500 KB Output is correct
5 Correct 195 ms 34696 KB Output is correct
6 Correct 100 ms 37724 KB Output is correct
7 Correct 189 ms 34860 KB Output is correct
8 Correct 102 ms 37388 KB Output is correct
9 Correct 298 ms 33256 KB Output is correct
10 Correct 298 ms 31236 KB Output is correct
11 Correct 277 ms 33576 KB Output is correct
12 Correct 282 ms 35804 KB Output is correct
13 Correct 286 ms 30988 KB Output is correct
14 Correct 378 ms 35940 KB Output is correct
15 Correct 297 ms 35780 KB Output is correct
16 Correct 326 ms 31708 KB Output is correct
17 Correct 341 ms 32140 KB Output is correct
18 Correct 282 ms 32292 KB Output is correct
19 Correct 313 ms 34932 KB Output is correct
20 Correct 322 ms 36656 KB Output is correct
21 Correct 7 ms 9940 KB Output is correct

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9940 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 9940 KB Output is correct
4 Correct 5 ms 9824 KB Output is correct
5 Correct 5 ms 9940 KB Output is correct
6 Correct 5 ms 9940 KB Output is correct
7 Correct 6 ms 9940 KB Output is correct
8 Correct 7 ms 9944 KB Output is correct
9 Correct 5 ms 9940 KB Output is correct
10 Correct 5 ms 9904 KB Output is correct
11 Correct 6 ms 10028 KB Output is correct
12 Correct 6 ms 10068 KB Output is correct
13 Correct 6 ms 10068 KB Output is correct
14 Correct 6 ms 10068 KB Output is correct
15 Correct 15 ms 10068 KB Output is correct
16 Correct 10 ms 10012 KB Output is correct
17 Correct 6 ms 10068 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 6 ms 10068 KB Output is correct
20 Correct 6 ms 10068 KB Output is correct
21 Correct 7 ms 10068 KB Output is correct
22 Correct 6 ms 10196 KB Output is correct
23 Correct 5 ms 10068 KB Output is correct
24 Correct 25 ms 10068 KB Output is correct
25 Correct 6 ms 10068 KB Output is correct
26 Correct 6 ms 10204 KB Output is correct
27 Correct 7 ms 10088 KB Output is correct
28 Correct 6 ms 10068 KB Output is correct
29 Correct 6 ms 10036 KB Output is correct
30 Correct 7 ms 10068 KB Output is correct
31 Correct 184 ms 36160 KB Output is correct
32 Correct 89 ms 36556 KB Output is correct
33 Correct 181 ms 35916 KB Output is correct
34 Correct 89 ms 36500 KB Output is correct
35 Correct 195 ms 34696 KB Output is correct
36 Correct 100 ms 37724 KB Output is correct
37 Correct 189 ms 34860 KB Output is correct
38 Correct 102 ms 37388 KB Output is correct
39 Correct 298 ms 33256 KB Output is correct
40 Correct 298 ms 31236 KB Output is correct
41 Correct 277 ms 33576 KB Output is correct
42 Correct 282 ms 35804 KB Output is correct
43 Correct 286 ms 30988 KB Output is correct
44 Correct 378 ms 35940 KB Output is correct
45 Correct 297 ms 35780 KB Output is correct
46 Correct 326 ms 31708 KB Output is correct
47 Correct 341 ms 32140 KB Output is correct
48 Correct 282 ms 32292 KB Output is correct
49 Correct 313 ms 34932 KB Output is correct
50 Correct 322 ms 36656 KB Output is correct
51 Correct 7 ms 9940 KB Output is correct
52 Correct 289 ms 23588 KB Output is correct
53 Correct 285 ms 23684 KB Output is correct
54 Correct 312 ms 23576 KB Output is correct
55 Correct 258 ms 23620 KB Output is correct
56 Correct 297 ms 23580 KB Output is correct
57 Correct 295 ms 23632 KB Output is correct
58 Execution timed out 3064 ms 25988 KB Time limit exceeded
59 Halted 0 ms 0 KB -