oj.uz

Submission #518608

# Submission time Handle Problem Language Result Execution time Memory
518608 2022-01-24T09:37:19 Z Monarchuwu Dynamic Diameter (CEOI19_diameter) C++17
42 / 100
 5000 ms 14144 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<ll> s;
        for (int i = 1; i < n; ++i)
            s.insert(e[i].w);

        int d;
        ll 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);
            multiset<ll>::iterator it = prev(s.end());
            last = *it + *prev(it);

            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';
        }
    }
}

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

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5008 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 5024 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 4 ms 4940 KB Output is correct
13 Correct 4 ms 5024 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5008 KB Output is correct
17 Correct 4 ms 5020 KB Output is correct
18 Correct 4 ms 5024 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5008 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 5024 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 4 ms 4940 KB Output is correct
13 Correct 4 ms 5024 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5008 KB Output is correct
17 Correct 4 ms 5020 KB Output is correct
18 Correct 4 ms 5024 KB Output is correct
19 Correct 202 ms 5176 KB Output is correct
20 Correct 236 ms 5184 KB Output is correct
21 Correct 210 ms 5196 KB Output is correct
22 Correct 207 ms 5196 KB Output is correct
23 Correct 1507 ms 5744 KB Output is correct
24 Correct 1450 ms 5616 KB Output is correct
25 Correct 1449 ms 5652 KB Output is correct
26 Correct 1434 ms 6112 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5036 KB Output is correct
4 Correct 13 ms 5212 KB Output is correct
5 Correct 35 ms 5456 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 4 ms 5004 KB Output is correct
8 Correct 8 ms 5024 KB Output is correct
9 Correct 62 ms 5100 KB Output is correct
10 Correct 12 ms 5292 KB Output is correct
11 Correct 40 ms 5572 KB Output is correct
12 Correct 15 ms 5412 KB Output is correct
13 Correct 73 ms 5520 KB Output is correct
14 Correct 724 ms 5556 KB Output is correct
15 Correct 13 ms 5708 KB Output is correct
16 Correct 47 ms 6124 KB Output is correct
17 Correct 209 ms 14080 KB Output is correct
18 Correct 1518 ms 14108 KB Output is correct
19 Execution timed out 5053 ms 14144 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5208 KB Output is correct
2 Correct 6 ms 5196 KB Output is correct
3 Correct 16 ms 5452 KB Output is correct
4 Correct 27 ms 5700 KB Output is correct
5 Correct 293 ms 6000 KB Output is correct
6 Correct 9 ms 5828 KB Output is correct
7 Correct 20 ms 6084 KB Output is correct
8 Correct 32 ms 6432 KB Output is correct
9 Correct 1690 ms 9436 KB Output is correct
10 Correct 23 ms 8652 KB Output is correct
11 Correct 34 ms 8868 KB Output is correct
12 Correct 49 ms 9248 KB Output is correct
13 Correct 4024 ms 13748 KB Output is correct
14 Correct 43 ms 12152 KB Output is correct
15 Correct 49 ms 12288 KB Output is correct
16 Correct 63 ms 12560 KB Output is correct
17 Correct 66 ms 12616 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 9692 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5008 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 5024 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 4 ms 4940 KB Output is correct
13 Correct 4 ms 5024 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5008 KB Output is correct
17 Correct 4 ms 5020 KB Output is correct
18 Correct 4 ms 5024 KB Output is correct
19 Correct 202 ms 5176 KB Output is correct
20 Correct 236 ms 5184 KB Output is correct
21 Correct 210 ms 5196 KB Output is correct
22 Correct 207 ms 5196 KB Output is correct
23 Correct 1507 ms 5744 KB Output is correct
24 Correct 1450 ms 5616 KB Output is correct
25 Correct 1449 ms 5652 KB Output is correct
26 Correct 1434 ms 6112 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 4 ms 5036 KB Output is correct
30 Correct 13 ms 5212 KB Output is correct
31 Correct 35 ms 5456 KB Output is correct
32 Correct 3 ms 5028 KB Output is correct
33 Correct 4 ms 5004 KB Output is correct
34 Correct 8 ms 5024 KB Output is correct
35 Correct 62 ms 5100 KB Output is correct
36 Correct 12 ms 5292 KB Output is correct
37 Correct 40 ms 5572 KB Output is correct
38 Correct 15 ms 5412 KB Output is correct
39 Correct 73 ms 5520 KB Output is correct
40 Correct 724 ms 5556 KB Output is correct
41 Correct 13 ms 5708 KB Output is correct
42 Correct 47 ms 6124 KB Output is correct
43 Correct 209 ms 14080 KB Output is correct
44 Correct 1518 ms 14108 KB Output is correct
45 Execution timed out 5053 ms 14144 KB Time limit exceeded
46 Halted 0 ms 0 KB -