oj.uz

Submission #154962

# Submission time Handle Problem Language Result Execution time Memory
154962 2019-09-25T17:04:47 Z karma Mergers (JOI19_mergers) C++14
34 / 100
 3000 ms 24056 KB 
#include<bits/stdc++.h>
#define Task     "test"
#define ll       long long
#define pb       emplace_back
#define mp       make_pair
#define fi       first
#define se       second

using namespace std;

const int N = int(5e5) + 5;
typedef pair<int, int> pii;

vector<int> a[N], g;
int sz[N], n, k, u, v, nstate, full, res = 0;
int cnt[N], s[N], orgcnt[N], deg[N];
int in[N], out[N], Time, Big[N];
bool big[N], choose[N];
vector<pii> vertex;

void DFS(int u, int par) {
    sz[u] = 1; in[u] = ++Time;
    for(int i = 0; i < int(a[u].size()); ++i) {
       if(a[u][i] == par) swap(a[u][i], a[u].back());
       if(a[u][i] != par) {
           DFS(a[u][i], u), sz[u] += sz[a[u][i]];
       }
    }
    if(u != 1) a[u].pop_back();
    out[u] = Time;
}

void Add(int u, int val) {
    if(cnt[s[u]] == 0) ++nstate;
    if(cnt[s[u]] == orgcnt[s[u]]) --full;
    cnt[s[u]] += val;
    if(cnt[s[u]] == orgcnt[s[u]]) ++full;
    if(cnt[s[u]] == 0) --nstate;
    for(int v: a[u])
        if(!big[v]) Add(v, val);
}

void DSU(int u, bool keep) {
    int Big = 0;
    for(int v: a[u])
        if(v != Big) DSU(v, 0);
    if(Big) DSU(Big, 1), big[Big] = 1;
    Add(u, 1);
    if(full == nstate) vertex.pb(mp(in[u], u));
    if(Big) big[Big] = 0;
    if(!keep) Add(u, -1);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> k;
    for(int i = 1; i < n; ++i) {
        cin >> u >> v;
        a[u].pb(v), a[v].pb(u);
    }
    for(int i = 1; i <= n; ++i) cin >> s[i], ++orgcnt[s[i]];
    DFS(1, 1); DSU(1, 1);
    sort(vertex.begin(), vertex.end());
    if(vertex.size() == 1) return cout << 0, 0;
    res = vertex.size();
    for(pii p: vertex) {
      while(!g.empty() && out[g.back()] < p.fi) g.pop_back();
      if(g.size()) {
        if(++deg[g.back()] == 1) --res;
      }
      g.pb(p.se);
    }
    if(deg[1] == 1) ++res;
    cout << (res + 1) / 2;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mergers.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 13 ms 12156 KB Output is correct
3 Correct 14 ms 12168 KB Output is correct
4 Correct 13 ms 12152 KB Output is correct
5 Correct 13 ms 12152 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 13 ms 12152 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 14 ms 12152 KB Output is correct
10 Correct 13 ms 12152 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12152 KB Output is correct
14 Correct 13 ms 12156 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 13 ms 12152 KB Output is correct
17 Correct 13 ms 12152 KB Output is correct
18 Correct 13 ms 12152 KB Output is correct
19 Correct 13 ms 12152 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 14 ms 12152 KB Output is correct
22 Correct 13 ms 12152 KB Output is correct
23 Correct 13 ms 12152 KB Output is correct
24 Correct 13 ms 12152 KB Output is correct
25 Correct 13 ms 12152 KB Output is correct
26 Correct 19 ms 12380 KB Output is correct
27 Correct 28 ms 12280 KB Output is correct
28 Correct 102 ms 12604 KB Output is correct
29 Correct 16 ms 12408 KB Output is correct
30 Correct 16 ms 12280 KB Output is correct
31 Correct 14 ms 12084 KB Output is correct
32 Correct 130 ms 12536 KB Output is correct
33 Correct 13 ms 12152 KB Output is correct
34 Correct 15 ms 12280 KB Output is correct
35 Correct 18 ms 12380 KB Output is correct
36 Correct 19 ms 12284 KB Output is correct
37 Correct 20 ms 12280 KB Output is correct
38 Correct 14 ms 12152 KB Output is correct
39 Correct 16 ms 12280 KB Output is correct
40 Correct 16 ms 12280 KB Output is correct
41 Correct 18 ms 12280 KB Output is correct
42 Correct 14 ms 12280 KB Output is correct
43 Correct 214 ms 12532 KB Output is correct
44 Correct 13 ms 12124 KB Output is correct
45 Correct 55 ms 12536 KB Output is correct
46 Correct 23 ms 12280 KB Output is correct
47 Correct 13 ms 12140 KB Output is correct
48 Correct 19 ms 12284 KB Output is correct
49 Correct 15 ms 12408 KB Output is correct
50 Correct 59 ms 12460 KB Output is correct
51 Correct 18 ms 12284 KB Output is correct
52 Correct 16 ms 12380 KB Output is correct
53 Correct 15 ms 12408 KB Output is correct
54 Correct 17 ms 12252 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 13 ms 12156 KB Output is correct
3 Correct 14 ms 12168 KB Output is correct
4 Correct 13 ms 12152 KB Output is correct
5 Correct 13 ms 12152 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 13 ms 12152 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 14 ms 12152 KB Output is correct
10 Correct 13 ms 12152 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12152 KB Output is correct
14 Correct 13 ms 12156 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 13 ms 12152 KB Output is correct
17 Correct 13 ms 12152 KB Output is correct
18 Correct 13 ms 12152 KB Output is correct
19 Correct 13 ms 12152 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 14 ms 12152 KB Output is correct
22 Correct 13 ms 12152 KB Output is correct
23 Correct 13 ms 12152 KB Output is correct
24 Correct 13 ms 12152 KB Output is correct
25 Correct 13 ms 12152 KB Output is correct
26 Correct 81 ms 18692 KB Output is correct
27 Correct 325 ms 18296 KB Output is correct
28 Correct 27 ms 12280 KB Output is correct
29 Correct 13 ms 12152 KB Output is correct
30 Correct 13 ms 12152 KB Output is correct
31 Correct 1035 ms 18408 KB Output is correct
32 Correct 15 ms 12280 KB Output is correct
33 Execution timed out 3039 ms 24056 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 18668 KB Output is correct
2 Correct 99 ms 20964 KB Output is correct
3 Correct 18 ms 12344 KB Output is correct
4 Correct 29 ms 12380 KB Output is correct
5 Correct 14 ms 12152 KB Output is correct
6 Correct 13 ms 12212 KB Output is correct
7 Correct 15 ms 12284 KB Output is correct
8 Correct 1941 ms 19740 KB Output is correct
9 Correct 20 ms 12280 KB Output is correct
10 Correct 1066 ms 18908 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Execution timed out 3031 ms 18456 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 13 ms 12156 KB Output is correct
3 Correct 14 ms 12168 KB Output is correct
4 Correct 13 ms 12152 KB Output is correct
5 Correct 13 ms 12152 KB Output is correct
6 Correct 13 ms 12152 KB Output is correct
7 Correct 13 ms 12152 KB Output is correct
8 Correct 13 ms 12152 KB Output is correct
9 Correct 14 ms 12152 KB Output is correct
10 Correct 13 ms 12152 KB Output is correct
11 Correct 13 ms 12152 KB Output is correct
12 Correct 13 ms 12152 KB Output is correct
13 Correct 13 ms 12152 KB Output is correct
14 Correct 13 ms 12156 KB Output is correct
15 Correct 13 ms 12152 KB Output is correct
16 Correct 13 ms 12152 KB Output is correct
17 Correct 13 ms 12152 KB Output is correct
18 Correct 13 ms 12152 KB Output is correct
19 Correct 13 ms 12152 KB Output is correct
20 Correct 13 ms 12152 KB Output is correct
21 Correct 14 ms 12152 KB Output is correct
22 Correct 13 ms 12152 KB Output is correct
23 Correct 13 ms 12152 KB Output is correct
24 Correct 13 ms 12152 KB Output is correct
25 Correct 13 ms 12152 KB Output is correct
26 Correct 19 ms 12380 KB Output is correct
27 Correct 28 ms 12280 KB Output is correct
28 Correct 102 ms 12604 KB Output is correct
29 Correct 16 ms 12408 KB Output is correct
30 Correct 16 ms 12280 KB Output is correct
31 Correct 14 ms 12084 KB Output is correct
32 Correct 130 ms 12536 KB Output is correct
33 Correct 13 ms 12152 KB Output is correct
34 Correct 15 ms 12280 KB Output is correct
35 Correct 18 ms 12380 KB Output is correct
36 Correct 19 ms 12284 KB Output is correct
37 Correct 20 ms 12280 KB Output is correct
38 Correct 14 ms 12152 KB Output is correct
39 Correct 16 ms 12280 KB Output is correct
40 Correct 16 ms 12280 KB Output is correct
41 Correct 18 ms 12280 KB Output is correct
42 Correct 14 ms 12280 KB Output is correct
43 Correct 214 ms 12532 KB Output is correct
44 Correct 13 ms 12124 KB Output is correct
45 Correct 55 ms 12536 KB Output is correct
46 Correct 23 ms 12280 KB Output is correct
47 Correct 13 ms 12140 KB Output is correct
48 Correct 19 ms 12284 KB Output is correct
49 Correct 15 ms 12408 KB Output is correct
50 Correct 59 ms 12460 KB Output is correct
51 Correct 18 ms 12284 KB Output is correct
52 Correct 16 ms 12380 KB Output is correct
53 Correct 15 ms 12408 KB Output is correct
54 Correct 17 ms 12252 KB Output is correct
55 Correct 13 ms 12152 KB Output is correct
56 Correct 81 ms 18692 KB Output is correct
57 Correct 325 ms 18296 KB Output is correct
58 Correct 27 ms 12280 KB Output is correct
59 Correct 13 ms 12152 KB Output is correct
60 Correct 13 ms 12152 KB Output is correct
61 Correct 1035 ms 18408 KB Output is correct
62 Correct 15 ms 12280 KB Output is correct
63 Execution timed out 3039 ms 24056 KB Time limit exceeded
64 Halted 0 ms 0 KB -