oj.uz

Submission #895209

# Submission time Handle Problem Language Result Execution time Memory
895209 2023-12-29T15:43:20 Z fanwen Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 374 ms 64080 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define file(name)                  \
    if(fopen(name".inp", "r"))      \
        freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout);


template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); }

const int MAX = 2e5 + 5;

struct edge {
    int u, v;
    long long w;
    edge(int u = 0, int v = 0, long long w = 0) : u(u), v(v), w(w) {}
    int get(int x) {
        return u ^ x ^ v;
    }
} e[MAX];

int n, q, m, time_in[MAX], time_out[MAX];
vector <int> adj[MAX];
long long W, last;

struct info {
    long long max_depth, min_depth, diam, limp, rimp;
    info(long long max_depth = 0,
         long long min_depth = 0,
         long long diam = 0,
         long long limp = 0,
         long long rimp = 0) :
        max_depth(max_depth),
        min_depth(min_depth),
        diam(diam),
        limp(limp),
        rimp(rimp) {}
};

info operator + (const info &lhs, const info &rhs) {
    info ans;
    ans.max_depth = max(lhs.max_depth, rhs.max_depth);
    ans.min_depth = min(lhs.min_depth, rhs.min_depth);
    ans.limp = max(lhs.limp, rhs.limp, lhs.max_depth - 2 * rhs.min_depth);
    ans.rimp = max(lhs.rimp, rhs.rimp, rhs.max_depth - 2 * lhs.min_depth);
    ans.diam = max(lhs.diam, rhs.diam);
    ans.diam = max(ans.diam, lhs.max_depth + rhs.rimp, rhs.max_depth + lhs.limp);
    return ans;
}

info it[4 * MAX];
long long lazy[4 * MAX];

void apply(int idx, long long val) {
    info &p = it[idx];
    p.max_depth += val;
    p.min_depth += val;
    p.limp -= val;
    p.rimp -= val;
    lazy[idx] += val;
}

void push(int p) {
    if(lazy[p] == 0) return;
    apply(p << 1, lazy[p]);
    apply(p << 1 | 1, lazy[p]);
    lazy[p] = 0;
}

void update(int idx, int l, int r, int u, int v, long long val) {
    if(l > v || r < u) return;
    if(l >= u && r <= v) return apply(idx, val);

    push(idx);
    int mid = l + r >> 1;
    update(idx << 1, l, mid, u, v, val);
    update(idx << 1 | 1, mid + 1, r, u, v, val);

    it[idx] = it[idx << 1] + it[idx << 1 | 1];
}

void dfs(int u, int p) {
    static int run = 0;
    run++;
    for (int i : adj[u]) if(e[i].get(u) != p) {
        int v = e[i].get(u);
        time_in[i] = run;
        dfs(v, u);
        time_out[i] = run++;
        update(1, 1, 2 * n, time_in[i] + 1, time_out[i], e[i].w);
    }

}

void you_make_it(void) {
    cin >> n >> q >> W;
    for (int i = 1; i < n; ++i) {
        cin >> e[i].u >> e[i].v >> e[i].w;
        adj[e[i].u].push_back(i);
        adj[e[i].v].push_back(i);
    }

    dfs(1, 0);

    while(q--) {
        int d; long long f; cin >> d >> f;
        d = (d + last % (n - 1)) % (n - 1) + 1;
        f = (f + last) % W;
        update(1, 1, 2 * n, time_in[d] + 1, time_out[d], - e[d].w);
        e[d].w = f;
        update(1, 1, 2 * n, time_in[d] + 1, time_out[d], + e[d].w);
        cout << (last = it[1].diam) << '\n';
    }
}


signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    file("diameter");
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Compilation message

diameter.cpp: In function 'void update(int, int, int, int, int, long long int)':
diameter.cpp:79:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   79 |     int mid = l + r >> 1;
      |               ~~^~~
diameter.cpp: In function 'int main()':
diameter.cpp:10:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:127:5: note: in expansion of macro 'file'
  127 |     file("diameter");
      |     ^~~~
diameter.cpp:10:49: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout);
      |                                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:127:5: note: in expansion of macro 'file'
  127 |     file("diameter");
      |     ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 43100 KB Output is correct
2 Correct 7 ms 43100 KB Output is correct
3 Correct 8 ms 43100 KB Output is correct
4 Correct 7 ms 43096 KB Output is correct
5 Correct 7 ms 43100 KB Output is correct
6 Correct 7 ms 43036 KB Output is correct
7 Correct 7 ms 43096 KB Output is correct
8 Correct 7 ms 43100 KB Output is correct
9 Correct 7 ms 43072 KB Output is correct
10 Correct 7 ms 43100 KB Output is correct
11 Correct 7 ms 43100 KB Output is correct
12 Correct 8 ms 43088 KB Output is correct
13 Correct 7 ms 43100 KB Output is correct
14 Correct 9 ms 43084 KB Output is correct
15 Correct 7 ms 43100 KB Output is correct
16 Correct 7 ms 43036 KB Output is correct
17 Correct 7 ms 43100 KB Output is correct
18 Correct 7 ms 43056 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 43100 KB Output is correct
2 Correct 7 ms 43100 KB Output is correct
3 Correct 8 ms 43100 KB Output is correct
4 Correct 7 ms 43096 KB Output is correct
5 Correct 7 ms 43100 KB Output is correct
6 Correct 7 ms 43036 KB Output is correct
7 Correct 7 ms 43096 KB Output is correct
8 Correct 7 ms 43100 KB Output is correct
9 Correct 7 ms 43072 KB Output is correct
10 Correct 7 ms 43100 KB Output is correct
11 Correct 7 ms 43100 KB Output is correct
12 Correct 8 ms 43088 KB Output is correct
13 Correct 7 ms 43100 KB Output is correct
14 Correct 9 ms 43084 KB Output is correct
15 Correct 7 ms 43100 KB Output is correct
16 Correct 7 ms 43036 KB Output is correct
17 Correct 7 ms 43100 KB Output is correct
18 Correct 7 ms 43056 KB Output is correct
19 Correct 11 ms 43100 KB Output is correct
20 Correct 11 ms 43072 KB Output is correct
21 Correct 12 ms 43100 KB Output is correct
22 Correct 12 ms 43268 KB Output is correct
23 Correct 15 ms 45540 KB Output is correct
24 Correct 16 ms 45400 KB Output is correct
25 Correct 18 ms 45404 KB Output is correct
26 Correct 18 ms 45916 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 43100 KB Output is correct
2 Correct 7 ms 43100 KB Output is correct
3 Correct 8 ms 43148 KB Output is correct
4 Correct 15 ms 43100 KB Output is correct
5 Correct 45 ms 43356 KB Output is correct
6 Correct 8 ms 43100 KB Output is correct
7 Correct 7 ms 43100 KB Output is correct
8 Correct 8 ms 43064 KB Output is correct
9 Correct 8 ms 43096 KB Output is correct
10 Correct 18 ms 43100 KB Output is correct
11 Correct 64 ms 43600 KB Output is correct
12 Correct 10 ms 45400 KB Output is correct
13 Correct 10 ms 45404 KB Output is correct
14 Correct 11 ms 45404 KB Output is correct
15 Correct 24 ms 45404 KB Output is correct
16 Correct 79 ms 45908 KB Output is correct
17 Correct 60 ms 49868 KB Output is correct
18 Correct 60 ms 51088 KB Output is correct
19 Correct 63 ms 51152 KB Output is correct
20 Correct 84 ms 51364 KB Output is correct
21 Correct 177 ms 52684 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 43352 KB Output is correct
2 Correct 16 ms 43100 KB Output is correct
3 Correct 47 ms 43356 KB Output is correct
4 Correct 87 ms 43604 KB Output is correct
5 Correct 14 ms 45656 KB Output is correct
6 Correct 23 ms 45660 KB Output is correct
7 Correct 65 ms 46168 KB Output is correct
8 Correct 123 ms 46224 KB Output is correct
9 Correct 39 ms 46684 KB Output is correct
10 Correct 51 ms 46632 KB Output is correct
11 Correct 101 ms 46820 KB Output is correct
12 Correct 161 ms 47188 KB Output is correct
13 Correct 74 ms 50516 KB Output is correct
14 Correct 105 ms 52108 KB Output is correct
15 Correct 145 ms 52820 KB Output is correct
16 Correct 209 ms 53584 KB Output is correct
17 Correct 212 ms 53344 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 53932 KB Output is correct
2 Correct 243 ms 56120 KB Output is correct
3 Correct 226 ms 56144 KB Output is correct
4 Correct 238 ms 56400 KB Output is correct
5 Correct 231 ms 56144 KB Output is correct
6 Correct 251 ms 56088 KB Output is correct
7 Correct 262 ms 58960 KB Output is correct
8 Correct 301 ms 58964 KB Output is correct
9 Correct 273 ms 59104 KB Output is correct
10 Correct 295 ms 59124 KB Output is correct
11 Correct 314 ms 59084 KB Output is correct
12 Correct 256 ms 58064 KB Output is correct
13 Correct 328 ms 63764 KB Output is correct
14 Correct 334 ms 63828 KB Output is correct
15 Correct 339 ms 63828 KB Output is correct
16 Correct 329 ms 63872 KB Output is correct
17 Correct 319 ms 63056 KB Output is correct
18 Correct 299 ms 59852 KB Output is correct
19 Correct 326 ms 63716 KB Output is correct
20 Correct 329 ms 63756 KB Output is correct
21 Correct 338 ms 63828 KB Output is correct
22 Correct 374 ms 64080 KB Output is correct
23 Correct 351 ms 63028 KB Output is correct
24 Correct 282 ms 59852 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 43100 KB Output is correct
2 Correct 7 ms 43100 KB Output is correct
3 Correct 8 ms 43100 KB Output is correct
4 Correct 7 ms 43096 KB Output is correct
5 Correct 7 ms 43100 KB Output is correct
6 Correct 7 ms 43036 KB Output is correct
7 Correct 7 ms 43096 KB Output is correct
8 Correct 7 ms 43100 KB Output is correct
9 Correct 7 ms 43072 KB Output is correct
10 Correct 7 ms 43100 KB Output is correct
11 Correct 7 ms 43100 KB Output is correct
12 Correct 8 ms 43088 KB Output is correct
13 Correct 7 ms 43100 KB Output is correct
14 Correct 9 ms 43084 KB Output is correct
15 Correct 7 ms 43100 KB Output is correct
16 Correct 7 ms 43036 KB Output is correct
17 Correct 7 ms 43100 KB Output is correct
18 Correct 7 ms 43056 KB Output is correct
19 Correct 11 ms 43100 KB Output is correct
20 Correct 11 ms 43072 KB Output is correct
21 Correct 12 ms 43100 KB Output is correct
22 Correct 12 ms 43268 KB Output is correct
23 Correct 15 ms 45540 KB Output is correct
24 Correct 16 ms 45400 KB Output is correct
25 Correct 18 ms 45404 KB Output is correct
26 Correct 18 ms 45916 KB Output is correct
27 Correct 7 ms 43100 KB Output is correct
28 Correct 7 ms 43100 KB Output is correct
29 Correct 8 ms 43148 KB Output is correct
30 Correct 15 ms 43100 KB Output is correct
31 Correct 45 ms 43356 KB Output is correct
32 Correct 8 ms 43100 KB Output is correct
33 Correct 7 ms 43100 KB Output is correct
34 Correct 8 ms 43064 KB Output is correct
35 Correct 8 ms 43096 KB Output is correct
36 Correct 18 ms 43100 KB Output is correct
37 Correct 64 ms 43600 KB Output is correct
38 Correct 10 ms 45400 KB Output is correct
39 Correct 10 ms 45404 KB Output is correct
40 Correct 11 ms 45404 KB Output is correct
41 Correct 24 ms 45404 KB Output is correct
42 Correct 79 ms 45908 KB Output is correct
43 Correct 60 ms 49868 KB Output is correct
44 Correct 60 ms 51088 KB Output is correct
45 Correct 63 ms 51152 KB Output is correct
46 Correct 84 ms 51364 KB Output is correct
47 Correct 177 ms 52684 KB Output is correct
48 Correct 9 ms 43352 KB Output is correct
49 Correct 16 ms 43100 KB Output is correct
50 Correct 47 ms 43356 KB Output is correct
51 Correct 87 ms 43604 KB Output is correct
52 Correct 14 ms 45656 KB Output is correct
53 Correct 23 ms 45660 KB Output is correct
54 Correct 65 ms 46168 KB Output is correct
55 Correct 123 ms 46224 KB Output is correct
56 Correct 39 ms 46684 KB Output is correct
57 Correct 51 ms 46632 KB Output is correct
58 Correct 101 ms 46820 KB Output is correct
59 Correct 161 ms 47188 KB Output is correct
60 Correct 74 ms 50516 KB Output is correct
61 Correct 105 ms 52108 KB Output is correct
62 Correct 145 ms 52820 KB Output is correct
63 Correct 209 ms 53584 KB Output is correct
64 Correct 212 ms 53344 KB Output is correct
65 Correct 226 ms 53932 KB Output is correct
66 Correct 243 ms 56120 KB Output is correct
67 Correct 226 ms 56144 KB Output is correct
68 Correct 238 ms 56400 KB Output is correct
69 Correct 231 ms 56144 KB Output is correct
70 Correct 251 ms 56088 KB Output is correct
71 Correct 262 ms 58960 KB Output is correct
72 Correct 301 ms 58964 KB Output is correct
73 Correct 273 ms 59104 KB Output is correct
74 Correct 295 ms 59124 KB Output is correct
75 Correct 314 ms 59084 KB Output is correct
76 Correct 256 ms 58064 KB Output is correct
77 Correct 328 ms 63764 KB Output is correct
78 Correct 334 ms 63828 KB Output is correct
79 Correct 339 ms 63828 KB Output is correct
80 Correct 329 ms 63872 KB Output is correct
81 Correct 319 ms 63056 KB Output is correct
82 Correct 299 ms 59852 KB Output is correct
83 Correct 326 ms 63716 KB Output is correct
84 Correct 329 ms 63756 KB Output is correct
85 Correct 338 ms 63828 KB Output is correct
86 Correct 374 ms 64080 KB Output is correct
87 Correct 351 ms 63028 KB Output is correct
88 Correct 282 ms 59852 KB Output is correct
89 Correct 237 ms 55108 KB Output is correct
90 Correct 238 ms 55504 KB Output is correct
91 Correct 268 ms 57172 KB Output is correct
92 Correct 264 ms 56912 KB Output is correct
93 Correct 282 ms 59864 KB Output is correct
94 Correct 325 ms 58868 KB Output is correct
95 Correct 314 ms 61016 KB Output is correct
96 Correct 336 ms 59472 KB Output is correct
97 Correct 316 ms 60624 KB Output is correct
98 Correct 339 ms 63044 KB Output is correct
99 Correct 305 ms 60456 KB Output is correct
100 Correct 327 ms 60272 KB Output is correct