oj.uz

Submission #410178

# Submission time Handle Problem Language Result Execution time Memory
410178 2021-05-22T07:19:02 Z jhwest2 Meetings 2 (JOI21_meetings2) C++14
100 / 100
 3178 ms 29992 KB 
#include <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef long long lint;
typedef pair<int, int> pint;
const int M = 2e5 + 10;
const int INF = 1e9 + 10;

int n, Sub[M], Chk[M], Dep[M];
vector<int> G[M];

struct SEG {
    int T[M << 1], L[M << 1];

    void init() {
        for (int i = 0; i < M << 1; i++) L[i] = -2 * INF;
    }
    void push(int lo, int hi, int idx) {
        if (L[idx] == -2 * INF) return;
        if (lo != hi) {
            L[idx << 1] = L[idx];
            L[idx << 1 | 1] = L[idx];
        }
        T[idx] = L[idx]; L[idx] = -2 * INF;
    }
    int update(int a, int b, int x, int lo = 1, int hi = n >> 1, int idx = 1) {
        push(lo, hi, idx);
        if (b < lo || a > hi) return T[idx];
        if (a <= lo && hi <= b) {
            L[idx] = x; push(lo, hi, idx); return T[idx];
        }
        return T[idx] = max(update(a, b, x, lo, lo + hi >> 1, idx << 1), update(a, b, x, 1 + (lo + hi >> 1), hi, idx << 1 | 1));
    }
    int query(int a, int lo = 1, int hi = n >> 1, int idx = 1) {
        push(lo, hi, idx);
        if (lo == hi) return T[idx];
        if (a <= lo + hi >> 1) return query(a, lo, lo + hi >> 1, idx << 1);
        else return query(a, 1 + (lo + hi >> 1), hi, idx << 1 | 1);
    }
    int find(int x, int lo = 1, int hi = n >> 1, int idx = 1) {
        push(lo, hi, idx);
        if (lo == hi) {
            if (T[idx] >= x) return lo;
            return lo - 1;
        }
        push(1 + (lo + hi >> 1), hi, idx << 1 | 1);
        if (T[idx << 1 | 1] >= x) return find(x, 1 + (lo + hi >> 1), hi, idx << 1 | 1);
        return find(x, lo, lo + hi >> 1, idx << 1);
    }
} S, Ans;


void dfs(int p, int cur) {
    Sub[cur] = 1;
    for (int x : G[cur]) if (p != x && !Chk[x]) {
        dfs(cur, x); Sub[cur] += Sub[x];
    }
}
int cent(int p, int cur, int s) {
    for (int x : G[cur]) if (p != x && !Chk[x]) {
        if (Sub[x] > s / 2) return cent(cur, x, s);
    }
    return cur;
}
void dfs2(int p, int cur) {
    if (Chk[cur]) return; Sub[cur] = 1;
    for (int x : G[cur]) if (p != x) {
        Dep[x] = Dep[cur] + 1;
        dfs2(cur, x); Sub[cur] += Sub[x];
    }
}
void dp(int p, int cur) {
    for (int x : G[cur]) if (p != x && !Chk[x]) {
        dp(cur, x);
    }
    int a = S.query(Sub[cur]);
    if (a == -INF) return;

    int k = Ans.find(Dep[cur] + a);
    Ans.update(k + 1, Sub[cur], Dep[cur] + a);
}
void update(int p, int cur) {
    int k = S.find(Dep[cur]);
    S.update(k + 1, Sub[cur], Dep[cur]);
    for (int x : G[cur]) if (p != x && !Chk[x]) {
        update(cur, x);
    }
}
void solve(int cur) {
    dfs(cur, cur); int k = cent(cur, cur, Sub[cur]);
    Dep[k] = 0; Sub[k] = 1;
    S.update(1, n, -INF);
    for (int i = 0; i < G[k].size(); i++) if (!Chk[G[k][i]]) {
        int x = G[k][i]; Dep[x] = 1;
        dfs2(k, x);
        int l = S.find(0);
        S.update(l + 1, n - Sub[x], 0);
        dp(k, x); update(k, x);
        l = S.find(1);
        S.update(l + 1, n - Sub[x], -INF);
    }
    S.update(1, n, -INF);
    for (int i = G[k].size() - 1; i >= 0; i--) if (!Chk[G[k][i]]) {
        int x = G[k][i];
        dp(k, x); update(k, x);
    }

    Chk[k] = 1;
    vector<int> V(G[k].size());
    for (int i = 0; i < G[k].size(); i++) V[i] = Sub[G[k][i]];
    for (int i = 0; i < G[k].size(); i++) if (!Chk[G[k][i]]) {
        Sub[k] = n - V[i]; solve(G[k][i]);
    }
}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i < n; i++) {
        int x, y; cin >> x >> y;
        G[x].push_back(y); G[y].push_back(x);
    }
    S.init(); solve(1);
    for (int i = 1; i <= n; i++) {
        if (i & 1) cout << 1 << '\n';
        else cout << Ans.query(i / 2) + 1 << '\n';
    }
}

Compilation message

meetings2.cpp: In member function 'int SEG::update(int, int, int, int, int, int)':
meetings2.cpp:33:52: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |         return T[idx] = max(update(a, b, x, lo, lo + hi >> 1, idx << 1), update(a, b, x, 1 + (lo + hi >> 1), hi, idx << 1 | 1));
      |                                                 ~~~^~~~
meetings2.cpp:33:98: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |         return T[idx] = max(update(a, b, x, lo, lo + hi >> 1, idx << 1), update(a, b, x, 1 + (lo + hi >> 1), hi, idx << 1 | 1));
      |                                                                                               ~~~^~~~
meetings2.cpp: In member function 'int SEG::query(int, int, int, int)':
meetings2.cpp:38:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |         if (a <= lo + hi >> 1) return query(a, lo, lo + hi >> 1, idx << 1);
      |                  ~~~^~~~
meetings2.cpp:38:55: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |         if (a <= lo + hi >> 1) return query(a, lo, lo + hi >> 1, idx << 1);
      |                                                    ~~~^~~~
meetings2.cpp:39:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |         else return query(a, 1 + (lo + hi >> 1), hi, idx << 1 | 1);
      |                                   ~~~^~~~
meetings2.cpp: In member function 'int SEG::find(int, int, int, int)':
meetings2.cpp:47:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |         push(1 + (lo + hi >> 1), hi, idx << 1 | 1);
      |                   ~~~^~~~
meetings2.cpp:48:58: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |         if (T[idx << 1 | 1] >= x) return find(x, 1 + (lo + hi >> 1), hi, idx << 1 | 1);
      |                                                       ~~~^~~~
meetings2.cpp:49:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |         return find(x, lo, lo + hi >> 1, idx << 1);
      |                            ~~~^~~~
meetings2.cpp: In function 'void dfs2(int, int)':
meetings2.cpp:67:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   67 |     if (Chk[cur]) return; Sub[cur] = 1;
      |     ^~
meetings2.cpp:67:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   67 |     if (Chk[cur]) return; Sub[cur] = 1;
      |                           ^~~
meetings2.cpp: In function 'void solve(int)':
meetings2.cpp:94:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for (int i = 0; i < G[k].size(); i++) if (!Chk[G[k][i]]) {
      |                     ~~^~~~~~~~~~~~~
meetings2.cpp:111:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     for (int i = 0; i < G[k].size(); i++) V[i] = Sub[G[k][i]];
      |                     ~~^~~~~~~~~~~~~
meetings2.cpp:112:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for (int i = 0; i < G[k].size(); i++) if (!Chk[G[k][i]]) {
      |                     ~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6476 KB Output is correct
2 Correct 4 ms 6604 KB Output is correct
3 Correct 4 ms 6604 KB Output is correct
4 Correct 5 ms 6604 KB Output is correct
5 Correct 4 ms 6556 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 4 ms 6568 KB Output is correct
8 Correct 5 ms 6604 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 5 ms 6604 KB Output is correct
12 Correct 5 ms 6604 KB Output is correct
13 Correct 4 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 4 ms 6604 KB Output is correct
16 Correct 4 ms 6604 KB Output is correct
17 Correct 4 ms 6500 KB Output is correct
18 Correct 5 ms 6604 KB Output is correct
19 Correct 5 ms 6604 KB Output is correct
20 Correct 5 ms 6604 KB Output is correct
21 Correct 4 ms 6604 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6476 KB Output is correct
2 Correct 4 ms 6604 KB Output is correct
3 Correct 4 ms 6604 KB Output is correct
4 Correct 5 ms 6604 KB Output is correct
5 Correct 4 ms 6556 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 4 ms 6568 KB Output is correct
8 Correct 5 ms 6604 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 5 ms 6604 KB Output is correct
12 Correct 5 ms 6604 KB Output is correct
13 Correct 4 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 4 ms 6604 KB Output is correct
16 Correct 4 ms 6604 KB Output is correct
17 Correct 4 ms 6500 KB Output is correct
18 Correct 5 ms 6604 KB Output is correct
19 Correct 5 ms 6604 KB Output is correct
20 Correct 5 ms 6604 KB Output is correct
21 Correct 4 ms 6604 KB Output is correct
22 Correct 21 ms 6764 KB Output is correct
23 Correct 20 ms 6832 KB Output is correct
24 Correct 20 ms 6832 KB Output is correct
25 Correct 21 ms 6840 KB Output is correct
26 Correct 21 ms 6732 KB Output is correct
27 Correct 20 ms 6828 KB Output is correct
28 Correct 21 ms 6836 KB Output is correct
29 Correct 21 ms 6828 KB Output is correct
30 Correct 20 ms 6836 KB Output is correct
31 Correct 21 ms 6840 KB Output is correct
32 Correct 27 ms 6964 KB Output is correct
33 Correct 27 ms 6988 KB Output is correct
34 Correct 11 ms 6804 KB Output is correct
35 Correct 10 ms 6844 KB Output is correct
36 Correct 21 ms 6848 KB Output is correct
37 Correct 12 ms 6860 KB Output is correct
38 Correct 19 ms 6860 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6476 KB Output is correct
2 Correct 4 ms 6604 KB Output is correct
3 Correct 4 ms 6604 KB Output is correct
4 Correct 5 ms 6604 KB Output is correct
5 Correct 4 ms 6556 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 4 ms 6568 KB Output is correct
8 Correct 5 ms 6604 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 5 ms 6604 KB Output is correct
12 Correct 5 ms 6604 KB Output is correct
13 Correct 4 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 4 ms 6604 KB Output is correct
16 Correct 4 ms 6604 KB Output is correct
17 Correct 4 ms 6500 KB Output is correct
18 Correct 5 ms 6604 KB Output is correct
19 Correct 5 ms 6604 KB Output is correct
20 Correct 5 ms 6604 KB Output is correct
21 Correct 4 ms 6604 KB Output is correct
22 Correct 21 ms 6764 KB Output is correct
23 Correct 20 ms 6832 KB Output is correct
24 Correct 20 ms 6832 KB Output is correct
25 Correct 21 ms 6840 KB Output is correct
26 Correct 21 ms 6732 KB Output is correct
27 Correct 20 ms 6828 KB Output is correct
28 Correct 21 ms 6836 KB Output is correct
29 Correct 21 ms 6828 KB Output is correct
30 Correct 20 ms 6836 KB Output is correct
31 Correct 21 ms 6840 KB Output is correct
32 Correct 27 ms 6964 KB Output is correct
33 Correct 27 ms 6988 KB Output is correct
34 Correct 11 ms 6804 KB Output is correct
35 Correct 10 ms 6844 KB Output is correct
36 Correct 21 ms 6848 KB Output is correct
37 Correct 12 ms 6860 KB Output is correct
38 Correct 19 ms 6860 KB Output is correct
39 Correct 2138 ms 18188 KB Output is correct
40 Correct 2057 ms 17788 KB Output is correct
41 Correct 2113 ms 17976 KB Output is correct
42 Correct 2012 ms 18068 KB Output is correct
43 Correct 2095 ms 18256 KB Output is correct
44 Correct 2040 ms 18380 KB Output is correct
45 Correct 3178 ms 24596 KB Output is correct
46 Correct 2923 ms 29992 KB Output is correct
47 Correct 555 ms 20800 KB Output is correct
48 Correct 456 ms 20848 KB Output is correct
49 Correct 2165 ms 22192 KB Output is correct
50 Correct 675 ms 21352 KB Output is correct
51 Correct 1760 ms 27424 KB Output is correct