oj.uz

답안 #518635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518635 2022-01-24T10:28:34 Z Monarchuwu Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 1447 ms 19484 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;

typedef pair<int, ll> pil;
#define ff first
#define ss second

const int N = 1e5 + 9;
int n, q;
ll w, c;
vector<int> g[N];
struct Edge {
    int u, v;
    ll w;
    int operator()(int x) { return u ^ v ^ x; }
} e[N];

namespace subtask12 {
    vector<ll> a[N];
    void dfs(int u, int p) {
        a[u].assign(2, 0);
        for (int id : g[u]) if (p != id) {
            int v = e[id](u);
            dfs(v, id);
            a[u].push_back(a[v][0] + e[id].w);
        }
        sort(all(a[u]), greater<ll>());
    }
    ll gogo() {
        dfs(1, 0);
        ll ans(0);
        for (int i = 1; i <= n; ++i)
            ans = max(ans, a[i][0] + a[i][1]);
        return ans;
    }
    void solve() {
        int d;
        ll ee, last(0); while (q--) {
            cin >> d >> ee;
            d = (d + last) % (n - 1);
            ee = (ee + last) % w;

            e[d + 1].w = ee;
            last = gogo();
            cout << last << '\n';
        }
    }
}

namespace subtask3 {
    void solve() {
        multiset<int, greater<int>> s;
        for (int i = 1; i < n; ++i)
            s.insert(e[i].w);

        int d, ee, last(0); while (q--) {
            cin >> d >> ee;
            d = (d + last) % (n - 1);
            ee = (ee + last) % w;

            s.erase(s.find(e[d + 1].w));
            s.insert(e[d + 1].w = ee);
            last = *s.begin() + *next(s.begin());

            cout << last << '\n';
        }
    }
}

namespace subtask4 {
    bool check() {
        for (int i = 1; i < n; ++i)
            if (e[i].v / 2 != e[i].u) return false;
        return true;
    }

    struct Node {
        ll path, diam;
    } seg[1 << 18];
    ll wei[N];

    void build(int u) {
        if (u > n) return;
        if (u * 2 > n) seg[u].path = seg[u].diam = wei[u];
        else {
            int u1 = u << 1, u2 = u1 | 1;
            build(u1);
            build(u2);
            seg[u].path = max(seg[u1].path, seg[u2].path) + wei[u];
            seg[u].diam = max({ seg[u1].diam, seg[u2].diam, seg[u1].path + seg[u2].path });
        }
    }

    void upd(int u) {
        if (u * 2 > n) seg[u].path = seg[u].diam = wei[u];
        else {
            int u1 = u << 1, u2 = u1 | 1;
            seg[u].path = max(seg[u1].path, seg[u2].path) + wei[u];
        }

        for (u >>= 1; u; u >>= 1) {
            int u1 = u << 1, u2 = u1 | 1;
            seg[u].path = max(seg[u1].path, seg[u2].path) + wei[u];
            seg[u].diam = max({ seg[u1].diam, seg[u2].diam, seg[u1].path + seg[u2].path });
        }
    }

    void solve() {
        wei[1] = 0;
        for (int i = 1; i < n; ++i) wei[e[i].v] = e[i].w;
        build(1);

        int d;
        ll ee, last(0); while (q--) {
            cin >> d >> ee;
            d = (d + last) % (n - 1);
            ee = (ee + last) % w;

            wei[e[d + 1].v] = ee;
            upd(e[d + 1].v);
            last = seg[1].diam;

            cout << last << '\n';
        }
    }
}

namespace subtask5 {
    int tme = 0, tin[N], tout[N];
    int par[N];
    ll wei[N];
    void dfs(int u) {
        tin[u] = ++tme;
        for (int id : g[u]) {
            int v = e[id](u);
            if (v == par[u]) continue;

            par[v] = u;
            wei[v] = e[id].w;
            dfs(v);
        }
        tout[u] = tme;
    }

    struct Node {
        ll ma, laz;
        Node() : ma(0), laz(0) {}
    } seg[1 << 18];

    void upd(int u, int l, int r, int a, int b, ll v) {
        if (a <= l && r <= b) {
            seg[u].ma += v;
            seg[u].laz += v;
            return;
        }
        int m = (l + r) >> 1, u1 = u << 1, u2 = u1 | 1;
        if (seg[u].laz) {
            seg[u1].ma += seg[u].laz;
            seg[u1].laz += seg[u].laz;
            seg[u2].ma += seg[u].laz;
            seg[u2].laz += seg[u].laz;
            seg[u].laz = 0;
        }
        if (a <= m) upd(u1, l, m, a, b, v);
        if (m < b) upd(u2, m + 1, r, a, b, v);
        seg[u].ma = max(seg[u1].ma, seg[u2].ma);
    }

    ll qry(int u, int l, int r, int a, int b) {
        if (b < l || r < a) return 0;
        if (a <= l && r <= b) return seg[u].ma;

        int m = (l + r) >> 1, u1 = u << 1, u2 = u1 | 1;
        if (seg[u].laz) {
            seg[u1].ma += seg[u].laz;
            seg[u1].laz += seg[u].laz;
            seg[u2].ma += seg[u].laz;
            seg[u2].laz += seg[u].laz;
            seg[u].laz = 0;
        }
        return max(qry(u1, l, m, a, b), qry(u2, m + 1, r, a, b));
    }

    ll sum_t[N];
    void solve() {
        dfs(1);
        for (int i = 2; i <= n; ++i)
            upd(1, 1, n, tin[i], tout[i], wei[i]);

        multiset<ll, greater<ll>> s;
        vector<int> a;
        s.insert(0);
        for (int id : g[1]) {
            int v = e[id](1);
            a.push_back(v);

            sum_t[v] = qry(1, 1, n, tin[v], tout[v]);
            s.insert(sum_t[v]);
        }
        sort(all(a), [&](int a, int b) { return tin[a] < tin[b]; });

        int d, u, v, p;
        ll ee, last(0); while (q--) {
            cin >> d >> ee;
            //d = (d + last) % (n - 1);
            //ee = (ee + last) % w;

            u = e[d + 1].u, v = e[d + 1].v;
            if (par[u] == v) swap(u, v);
            // par[v] == u
            upd(1, 1, n, tin[v], tout[v], ee - wei[v]);
            wei[v] = ee;

            p = *prev(upper_bound(all(a), v, [&](int a, int b) { return tin[a] < tin[b]; }));
            s.erase(s.find(sum_t[p]));

            sum_t[p] = qry(1, 1, n, tin[p], tout[p]);
            s.insert(sum_t[p]);

            last = *s.begin() + *next(s.begin());
            cout << last << '\n';
        }
    }
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> q >> w;
    for (int i = 1, u, v; i < n; ++i) {
        cin >> e[i].u >> e[i].v >> e[i].w;
        if (e[i].u > e[i].v) swap(e[i].u, e[i].v);
        g[e[i].u].push_back(i);
        g[e[i].v].push_back(i);
    }

    if (n <= 5000 && q <= 5000) subtask12::solve();
    else if (g[1].size() == n - 1) subtask3::solve();
    else if (subtask4::check()) subtask4::solve();
    else subtask5::solve();
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:234:21: warning: unused variable 'u' [-Wunused-variable]
  234 |     for (int i = 1, u, v; i < n; ++i) {
      |                     ^
diameter.cpp:234:24: warning: unused variable 'v' [-Wunused-variable]
  234 |     for (int i = 1, u, v; i < n; ++i) {
      |                        ^
diameter.cpp:242:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  242 |     else if (g[1].size() == n - 1) subtask3::solve();
      |              ~~~~~~~~~~~~^~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9036 KB Output is correct
2 Correct 4 ms 9036 KB Output is correct
3 Correct 5 ms 9036 KB Output is correct
4 Correct 7 ms 9036 KB Output is correct
5 Correct 5 ms 9036 KB Output is correct
6 Correct 4 ms 9036 KB Output is correct
7 Correct 5 ms 9036 KB Output is correct
8 Correct 4 ms 9036 KB Output is correct
9 Correct 4 ms 9036 KB Output is correct
10 Correct 5 ms 9036 KB Output is correct
11 Correct 5 ms 9040 KB Output is correct
12 Correct 5 ms 9088 KB Output is correct
13 Correct 5 ms 9036 KB Output is correct
14 Correct 5 ms 9036 KB Output is correct
15 Correct 5 ms 9048 KB Output is correct
16 Correct 5 ms 9036 KB Output is correct
17 Correct 4 ms 9036 KB Output is correct
18 Correct 5 ms 9036 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9036 KB Output is correct
2 Correct 4 ms 9036 KB Output is correct
3 Correct 5 ms 9036 KB Output is correct
4 Correct 7 ms 9036 KB Output is correct
5 Correct 5 ms 9036 KB Output is correct
6 Correct 4 ms 9036 KB Output is correct
7 Correct 5 ms 9036 KB Output is correct
8 Correct 4 ms 9036 KB Output is correct
9 Correct 4 ms 9036 KB Output is correct
10 Correct 5 ms 9036 KB Output is correct
11 Correct 5 ms 9040 KB Output is correct
12 Correct 5 ms 9088 KB Output is correct
13 Correct 5 ms 9036 KB Output is correct
14 Correct 5 ms 9036 KB Output is correct
15 Correct 5 ms 9048 KB Output is correct
16 Correct 5 ms 9036 KB Output is correct
17 Correct 4 ms 9036 KB Output is correct
18 Correct 5 ms 9036 KB Output is correct
19 Correct 206 ms 9244 KB Output is correct
20 Correct 205 ms 9212 KB Output is correct
21 Correct 205 ms 9252 KB Output is correct
22 Correct 204 ms 9420 KB Output is correct
23 Correct 1337 ms 9580 KB Output is correct
24 Correct 1422 ms 9596 KB Output is correct
25 Correct 1441 ms 9760 KB Output is correct
26 Correct 1447 ms 10252 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9036 KB Output is correct
2 Correct 5 ms 9036 KB Output is correct
3 Correct 6 ms 9036 KB Output is correct
4 Correct 11 ms 9176 KB Output is correct
5 Correct 34 ms 9552 KB Output is correct
6 Correct 4 ms 9036 KB Output is correct
7 Correct 5 ms 9164 KB Output is correct
8 Correct 11 ms 9184 KB Output is correct
9 Correct 58 ms 9184 KB Output is correct
10 Correct 12 ms 9164 KB Output is correct
11 Correct 43 ms 9628 KB Output is correct
12 Correct 7 ms 9548 KB Output is correct
13 Correct 10 ms 9564 KB Output is correct
14 Correct 8 ms 9548 KB Output is correct
15 Correct 16 ms 9788 KB Output is correct
16 Correct 61 ms 10088 KB Output is correct
17 Correct 55 ms 18824 KB Output is correct
18 Correct 56 ms 18888 KB Output is correct
19 Correct 66 ms 18824 KB Output is correct
20 Correct 68 ms 18916 KB Output is correct
21 Correct 161 ms 19484 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 9224 KB Output is correct
2 Correct 8 ms 9164 KB Output is correct
3 Correct 19 ms 9392 KB Output is correct
4 Correct 30 ms 9696 KB Output is correct
5 Correct 8 ms 9932 KB Output is correct
6 Correct 10 ms 9804 KB Output is correct
7 Correct 21 ms 10212 KB Output is correct
8 Correct 35 ms 10436 KB Output is correct
9 Correct 20 ms 12592 KB Output is correct
10 Correct 25 ms 12688 KB Output is correct
11 Correct 34 ms 12940 KB Output is correct
12 Correct 47 ms 13176 KB Output is correct
13 Correct 37 ms 16064 KB Output is correct
14 Correct 43 ms 16196 KB Output is correct
15 Correct 50 ms 16396 KB Output is correct
16 Correct 63 ms 16708 KB Output is correct
17 Correct 67 ms 16668 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 209 ms 17704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9036 KB Output is correct
2 Correct 4 ms 9036 KB Output is correct
3 Correct 5 ms 9036 KB Output is correct
4 Correct 7 ms 9036 KB Output is correct
5 Correct 5 ms 9036 KB Output is correct
6 Correct 4 ms 9036 KB Output is correct
7 Correct 5 ms 9036 KB Output is correct
8 Correct 4 ms 9036 KB Output is correct
9 Correct 4 ms 9036 KB Output is correct
10 Correct 5 ms 9036 KB Output is correct
11 Correct 5 ms 9040 KB Output is correct
12 Correct 5 ms 9088 KB Output is correct
13 Correct 5 ms 9036 KB Output is correct
14 Correct 5 ms 9036 KB Output is correct
15 Correct 5 ms 9048 KB Output is correct
16 Correct 5 ms 9036 KB Output is correct
17 Correct 4 ms 9036 KB Output is correct
18 Correct 5 ms 9036 KB Output is correct
19 Correct 206 ms 9244 KB Output is correct
20 Correct 205 ms 9212 KB Output is correct
21 Correct 205 ms 9252 KB Output is correct
22 Correct 204 ms 9420 KB Output is correct
23 Correct 1337 ms 9580 KB Output is correct
24 Correct 1422 ms 9596 KB Output is correct
25 Correct 1441 ms 9760 KB Output is correct
26 Correct 1447 ms 10252 KB Output is correct
27 Correct 4 ms 9036 KB Output is correct
28 Correct 5 ms 9036 KB Output is correct
29 Correct 6 ms 9036 KB Output is correct
30 Correct 11 ms 9176 KB Output is correct
31 Correct 34 ms 9552 KB Output is correct
32 Correct 4 ms 9036 KB Output is correct
33 Correct 5 ms 9164 KB Output is correct
34 Correct 11 ms 9184 KB Output is correct
35 Correct 58 ms 9184 KB Output is correct
36 Correct 12 ms 9164 KB Output is correct
37 Correct 43 ms 9628 KB Output is correct
38 Correct 7 ms 9548 KB Output is correct
39 Correct 10 ms 9564 KB Output is correct
40 Correct 8 ms 9548 KB Output is correct
41 Correct 16 ms 9788 KB Output is correct
42 Correct 61 ms 10088 KB Output is correct
43 Correct 55 ms 18824 KB Output is correct
44 Correct 56 ms 18888 KB Output is correct
45 Correct 66 ms 18824 KB Output is correct
46 Correct 68 ms 18916 KB Output is correct
47 Correct 161 ms 19484 KB Output is correct
48 Correct 33 ms 9224 KB Output is correct
49 Correct 8 ms 9164 KB Output is correct
50 Correct 19 ms 9392 KB Output is correct
51 Correct 30 ms 9696 KB Output is correct
52 Correct 8 ms 9932 KB Output is correct
53 Correct 10 ms 9804 KB Output is correct
54 Correct 21 ms 10212 KB Output is correct
55 Correct 35 ms 10436 KB Output is correct
56 Correct 20 ms 12592 KB Output is correct
57 Correct 25 ms 12688 KB Output is correct
58 Correct 34 ms 12940 KB Output is correct
59 Correct 47 ms 13176 KB Output is correct
60 Correct 37 ms 16064 KB Output is correct
61 Correct 43 ms 16196 KB Output is correct
62 Correct 50 ms 16396 KB Output is correct
63 Correct 63 ms 16708 KB Output is correct
64 Correct 67 ms 16668 KB Output is correct
65 Incorrect 209 ms 17704 KB Output isn't correct
66 Halted 0 ms 0 KB -