oj.uz

Submission #470676

# Submission time Handle Problem Language Result Execution time Memory
470676 2021-09-05T00:32:02 Z aZvezda Mergers (JOI19_mergers) C++14
34 / 100
 3000 ms 24456 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 1e5 + 10;
vector<int> g[MAX_N], nw[MAX_N];
int cnt[MAX_N], cntNow[MAX_N], col[MAX_N];
int n, k, ret;
int sz[MAX_N], big[MAX_N];
int cntok;

void add(int x, int p, int delta = 1) {
    if(cntNow[col[x]] == 0 || cntNow[col[x]] == cnt[col[x]]) {
        cntok --;
    }
    cntNow[col[x]] += delta;
    if(cntNow[col[x]] == 0 || cntNow[col[x]] == cnt[col[x]]) {
        cntok ++;
    }
    for(auto it : g[x]) {
        if(it == p) {continue;}
        add(it, x, delta);
    }
}

void calcSize(int x, int p) {
    sz[x] = 1;
    big[x] = 0;
    for(auto it : g[x]) {
        if(it == p) {continue;}
        calcSize(it, x);
        sz[x] += sz[it];
        if(sz[it] > sz[big[x]]) {
            big[x] = it;
        }
    }
}

vector<int> dfs(int x, int p, bool keep = false) {
    vector<int> ret;

    for(auto it : g[x]) {
        if(it == p || it == big[x]) {continue;}
        auto curr = dfs(it, x, false);
        for(auto it2 : curr) {
            ret.push_back(it2);
        }
    }

    if(big[x] != 0) {
        auto curr = dfs(big[x], x, true);
        for(auto it2 : curr) {
            ret.push_back(it2);
        }
    }

    for(auto it : g[x]) {
        if(it == p || it == big[x]) {continue;}
        add(it, x, 1);
    }

    if(cntNow[col[x]] == 0 || cntNow[col[x]] == cnt[col[x]]) {
        cntok --;
    }
    cntNow[col[x]] ++;
    if(cntNow[col[x]] == 0 || cntNow[col[x]] == cnt[col[x]]) {
        cntok ++;
    }

    if(cntok == k) {
        for(auto it : ret) {
            nw[x].push_back(it);
        }
        ret = {x};
    }

    if(!keep) {
        add(x, p, -1);
    }

    return ret;
}

void calc(int x, int d) {
    if(x == 1 && nw[x].size() == 1) {
        ret ++;
    } else if(nw[x].size() == 0) {
        ret ++;
    }
    for(auto it : nw[x]) {
        calc(it, d + 1);
    }
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> n >> k;
    cntok = k;
    for(int i = 0; i < n - 1; i ++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i = 1; i <= n; i ++) {
        cin >> col[i];
        cnt[col[i]] ++;
    }
    dfs(1, 0, 1);
    calc(1, 0);
    if(ret != 1) {
        cout << (ret + 1) / 2 << endl;
    } else {
        cout << 0 << endl;
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 8 ms 5172 KB Output is correct
27 Correct 20 ms 5188 KB Output is correct
28 Correct 96 ms 5436 KB Output is correct
29 Correct 7 ms 5212 KB Output is correct
30 Correct 6 ms 5068 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 139 ms 5524 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 4 ms 5068 KB Output is correct
35 Correct 7 ms 5112 KB Output is correct
36 Correct 9 ms 5068 KB Output is correct
37 Correct 10 ms 5196 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 6 ms 5068 KB Output is correct
40 Correct 6 ms 5068 KB Output is correct
41 Correct 7 ms 5068 KB Output is correct
42 Correct 5 ms 5068 KB Output is correct
43 Correct 209 ms 5580 KB Output is correct
44 Correct 3 ms 4940 KB Output is correct
45 Correct 59 ms 5196 KB Output is correct
46 Correct 12 ms 5164 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 9 ms 5148 KB Output is correct
49 Correct 4 ms 5196 KB Output is correct
50 Correct 52 ms 5308 KB Output is correct
51 Correct 8 ms 5068 KB Output is correct
52 Correct 4 ms 5068 KB Output is correct
53 Correct 4 ms 5068 KB Output is correct
54 Correct 6 ms 5140 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 52 ms 8900 KB Output is correct
27 Correct 231 ms 8648 KB Output is correct
28 Correct 21 ms 5184 KB Output is correct
29 Correct 3 ms 4992 KB Output is correct
30 Correct 3 ms 4940 KB Output is correct
31 Correct 768 ms 8616 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Execution timed out 3080 ms 24456 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 8928 KB Output is correct
2 Correct 64 ms 10772 KB Output is correct
3 Correct 8 ms 5244 KB Output is correct
4 Correct 21 ms 5216 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 1743 ms 10920 KB Output is correct
9 Correct 10 ms 5068 KB Output is correct
10 Correct 818 ms 10212 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Execution timed out 3075 ms 10236 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 8 ms 5172 KB Output is correct
27 Correct 20 ms 5188 KB Output is correct
28 Correct 96 ms 5436 KB Output is correct
29 Correct 7 ms 5212 KB Output is correct
30 Correct 6 ms 5068 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 139 ms 5524 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 4 ms 5068 KB Output is correct
35 Correct 7 ms 5112 KB Output is correct
36 Correct 9 ms 5068 KB Output is correct
37 Correct 10 ms 5196 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 6 ms 5068 KB Output is correct
40 Correct 6 ms 5068 KB Output is correct
41 Correct 7 ms 5068 KB Output is correct
42 Correct 5 ms 5068 KB Output is correct
43 Correct 209 ms 5580 KB Output is correct
44 Correct 3 ms 4940 KB Output is correct
45 Correct 59 ms 5196 KB Output is correct
46 Correct 12 ms 5164 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 9 ms 5148 KB Output is correct
49 Correct 4 ms 5196 KB Output is correct
50 Correct 52 ms 5308 KB Output is correct
51 Correct 8 ms 5068 KB Output is correct
52 Correct 4 ms 5068 KB Output is correct
53 Correct 4 ms 5068 KB Output is correct
54 Correct 6 ms 5140 KB Output is correct
55 Correct 3 ms 4940 KB Output is correct
56 Correct 52 ms 8900 KB Output is correct
57 Correct 231 ms 8648 KB Output is correct
58 Correct 21 ms 5184 KB Output is correct
59 Correct 3 ms 4992 KB Output is correct
60 Correct 3 ms 4940 KB Output is correct
61 Correct 768 ms 8616 KB Output is correct
62 Correct 4 ms 5068 KB Output is correct
63 Execution timed out 3080 ms 24456 KB Time limit exceeded
64 Halted 0 ms 0 KB -