oj.uz

Submission #710613

# Submission time Handle Problem Language Result Execution time Memory
710613 2023-03-15T12:20:12 Z koks123 Meetings 2 (JOI21_meetings2) C++14
100 / 100
 1888 ms 35024 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
vector<int> g[N], seen;
int n, c, sub[N], done[N], f[N], ans[N], par[N], exc[N];
int maxi;
int upper;
void add(int x, int y) {
    x = upper - x + 1;
    assert(x > 0);
    while (x <= upper) {
        seen.push_back(x);
        f[x] = max(f[x], y);
        x += x & -x;
    }
}
int get(int x) {
    int ans = -N;
    x = upper - x + 1;
    while (x > 0) {
        ans = max(ans, f[x]);
        x -= x & -x;
    }
    return ans;
}
int find_centroid(int x, int p, int sz) {
    for (int to : g[x]) {
        if (!done[to] && to != p && sub[to] > sz / 2) {
            return find_centroid(to, x, sz);
        }
    }
    return x;
}
void calc(int x, int p) {
    sub[x] = 1;
    for (int to : g[x]) {
        if (!done[to] && p != to) {
            calc(to, x);
            sub[x] += sub[to];
        }
    }
}
int excSize(int x, int dir) {
    if (par[x] == dir) {
        return exc[x];
    }
    return n - exc[dir]; 
}
void insert(int x, int p, int anc, int pos, int depth = 1) {
    for (int to : g[x]) {
        if (to != p && !done[to]) {
            insert(to, x, anc, pos, depth + 1);
        }
    }
    int sub_size = excSize(x, p);
    if (pos == 1) {
        add(sub_size, depth);
    } else {
        ans[sub_size] = max(ans[sub_size], depth + get(sub_size) + 1);
        int v = min(sub_size, excSize(c, anc));
        ans[v] = max(ans[v], depth + 1);
    }
}
void find_par(int x, int p) {
    par[x] = p;
    exc[x] = 1;
    for (int to : g[x]) {
        if (to != p) {
            find_par(to, x);
            exc[x] += exc[to];
        }
    }
}
void decomp(int x, int p, int sz) {
    calc(x, p);
    c = find_centroid(x, -1, sz);
    upper = n;
    calc(c, p);
    for (int to : g[c]) {
        if (done[to]) continue;
        insert(to, c, to, 0); 
        insert(to, c, to, 1);
    }
    for (int i : seen) f[i] = -1e9; seen.clear();
  	reverse(g[c].begin(), g[c].end());
  	for (int to : g[c]) {
        if (done[to]) continue;
        insert(to, c, to, 0); 
        insert(to, c, to, 1);
    }
    for (int i : seen) f[i] = -1e9; seen.clear();
    done[c] = 1;
    for (int to : g[c]) {
        if (!done[to]) {
            decomp(to, c, sub[to]);
        }
    }
}
int main() {
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for (int i = 1; i <= n; ++i) {
        f[i] = -1e9;
    }
    find_par(1, 0);
    decomp(1, 0, n);
    ans[n] = 1;
    for (int i = n; i >= 1; --i) {
        ans[i] = max(ans[i], ans[i + 1]);
    }
    for (int i = 1; i <= n; ++i) {
        if (i % 2 == 0) {
            cout << ans[i / 2] << '\n';
        } else {
            cout << "1\n";
        }
    }
}

Compilation message

meetings2.cpp: In function 'void decomp(int, int, int)':
meetings2.cpp:84:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   84 |     for (int i : seen) f[i] = -1e9; seen.clear();
      |     ^~~
meetings2.cpp:84:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   84 |     for (int i : seen) f[i] = -1e9; seen.clear();
      |                                     ^~~~
meetings2.cpp:91:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   91 |     for (int i : seen) f[i] = -1e9; seen.clear();
      |     ^~~
meetings2.cpp:91:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   91 |     for (int i : seen) f[i] = -1e9; seen.clear();
      |                                     ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4920 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5004 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5008 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 5004 KB Output is correct
17 Correct 3 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5004 KB Output is correct
20 Correct 3 ms 4960 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4920 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5004 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5008 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 5004 KB Output is correct
17 Correct 3 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5004 KB Output is correct
20 Correct 3 ms 4960 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 9 ms 5272 KB Output is correct
23 Correct 9 ms 5332 KB Output is correct
24 Correct 9 ms 5276 KB Output is correct
25 Correct 9 ms 5332 KB Output is correct
26 Correct 10 ms 5332 KB Output is correct
27 Correct 9 ms 5332 KB Output is correct
28 Correct 9 ms 5332 KB Output is correct
29 Correct 10 ms 5332 KB Output is correct
30 Correct 10 ms 5248 KB Output is correct
31 Correct 9 ms 5348 KB Output is correct
32 Correct 14 ms 5460 KB Output is correct
33 Correct 14 ms 5596 KB Output is correct
34 Correct 6 ms 5332 KB Output is correct
35 Correct 5 ms 5216 KB Output is correct
36 Correct 10 ms 5336 KB Output is correct
37 Correct 7 ms 5272 KB Output is correct
38 Correct 12 ms 5460 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4920 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5004 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5008 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 5004 KB Output is correct
17 Correct 3 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5004 KB Output is correct
20 Correct 3 ms 4960 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 9 ms 5272 KB Output is correct
23 Correct 9 ms 5332 KB Output is correct
24 Correct 9 ms 5276 KB Output is correct
25 Correct 9 ms 5332 KB Output is correct
26 Correct 10 ms 5332 KB Output is correct
27 Correct 9 ms 5332 KB Output is correct
28 Correct 9 ms 5332 KB Output is correct
29 Correct 10 ms 5332 KB Output is correct
30 Correct 10 ms 5248 KB Output is correct
31 Correct 9 ms 5348 KB Output is correct
32 Correct 14 ms 5460 KB Output is correct
33 Correct 14 ms 5596 KB Output is correct
34 Correct 6 ms 5332 KB Output is correct
35 Correct 5 ms 5216 KB Output is correct
36 Correct 10 ms 5336 KB Output is correct
37 Correct 7 ms 5272 KB Output is correct
38 Correct 12 ms 5460 KB Output is correct
39 Correct 995 ms 20140 KB Output is correct
40 Correct 919 ms 19912 KB Output is correct
41 Correct 933 ms 20084 KB Output is correct
42 Correct 869 ms 20584 KB Output is correct
43 Correct 1035 ms 20600 KB Output is correct
44 Correct 918 ms 20552 KB Output is correct
45 Correct 1888 ms 27940 KB Output is correct
46 Correct 1667 ms 35024 KB Output is correct
47 Correct 285 ms 20424 KB Output is correct
48 Correct 210 ms 20468 KB Output is correct
49 Correct 886 ms 22232 KB Output is correct
50 Correct 267 ms 20480 KB Output is correct
51 Correct 888 ms 30732 KB Output is correct