oj.uz

Submission #245367

# Submission time Handle Problem Language Result Execution time Memory
245367 2020-07-06T07:06:34 Z karma Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 555 ms 75508 KB 
#include <bits/stdc++.h>
#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
//#define int         int64_t

using namespace std;

const int N = (int)2e5 + 2;
const ll inf = (ll)1e18;
typedef pair<int, int> pii;

ll lst, W, d[N], lz[N << 2];
struct TEdge {int u, v; ll w;} e[N];
int n, q, in[N], out[N], rv[N * 2], l[N << 2], h[N << 2], Time = 0;
vector<pii> adj[N];
vector<pair<int, ll>> path;

struct TNode { /// x + y - 2 * z
    ll xz, zx, x, z, res;
    int type;
    TNode() {zx = xz = x = z = res = -inf; type = 1;}
    void modify() {
        if(zx < -inf) zx = -inf;
        if(xz < -inf) xz = -inf;
        if(x < -inf) x = -inf;
        if(z < -inf) z = -inf;
        if(res < -inf) res = -inf;
    }
    void update(ll v) {
        x += v, z -= v * 2;
        xz -= v, zx -= v;
        modify();
    }
} st[N << 2];

ostream& operator << (ostream& cout, TNode& x) {
    cout << x.x << ' ' << x.z << ' ' << x.zx << ' ' << x.xz << ' ' << x.res;
    return cout;
}

void update(int& x, int l, int r) {
    st[x].x = max(st[l].x, st[r].x);
    st[x].z = max(st[l].z, st[r].z);
    st[x].xz = max({st[l].xz, st[r].xz, st[l].x + st[r].z});
    st[x].zx = max({st[l].zx, st[r].zx, st[l].z + st[r].x});
    st[x].res = max({st[l].res, st[r].res, st[l].xz + st[r].x, st[l].x + st[r].zx});
    st[x].modify();
}

void down(int x) {
    if(lz[x] == 0 || l[x] == h[x]) return;
    st[x << 1].update(lz[x]);
    st[x << 1 | 1].update(lz[x]);
    lz[x << 1] += lz[x], lz[x << 1 | 1] += lz[x];
    lz[x] = 0;
}

void build(int x, int low, int high) {
    l[x] = low, h[x] = high;
    if(low == high) {
        st[x].type = path[low].fi;
        if(st[x].type == 1) st[x].x = path[low].se;
        else st[x].z = path[low].se;
        return;
    }
    int mid = (low + high) >> 1;
    build(x << 1, low, mid);
    build(x << 1 | 1, mid + 1, high);
    update(x, x << 1, x << 1 | 1);
    //cout << x << ' ' << low << ' ' << high << ' ';
    //cout << st[x] << '\n';
}

void upd(int x, int low, int high, ll val) {
    down(x);
    if(l[x] > high || h[x] < low) return;
    if(low <= l[x] && h[x] <= high) {
        st[x].update(val);
        lz[x] += val;
        return;
    }
    upd(x << 1, low, high, val);
    upd(x << 1 | 1, low, high, val);
    update(x, x << 1, x << 1 | 1);
}

void dfs(int u, int p) {
    path.pb(1, d[u]);
    in[u] = path.size() - 1;
    for(auto& v: adj[u]) {
        if(v.fi == p) continue;
        if(v.fi == e[v.se].u) swap(e[v.se].u, e[v.se].v);
        d[v.fi] = d[u] + e[v.se].w;
        dfs(v.fi, u);
        path.pb(-2, -2ll * d[u]);
    }
    out[u] = path.size() - 1;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> q >> W;
    for(int i = 0; i < n - 1; ++i) {
        cin >> e[i].u >> e[i].v >> e[i].w;
        adj[e[i].u].pb(e[i].v, i);
        adj[e[i].v].pb(e[i].u, i);
    }
    dfs(1, 0);
    build(1, 0, path.size() - 1);
    lst = 0;
    ll i, w;
    while(q --) {
        cin >> i >> w;
        i = (lst + i) % (n - 1);
        w = (w + lst) % W;
        upd(1, in[e[i].v], out[e[i].v], w - e[i].w);
        e[i].w = w, lst = max(st[1].res, st[1].x);
        cout << lst << '\n';
    }
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:108:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 42624 KB Output is correct
2 Correct 29 ms 42624 KB Output is correct
3 Correct 29 ms 42624 KB Output is correct
4 Correct 26 ms 42752 KB Output is correct
5 Correct 28 ms 42624 KB Output is correct
6 Correct 27 ms 42624 KB Output is correct
7 Correct 29 ms 42624 KB Output is correct
8 Correct 29 ms 42744 KB Output is correct
9 Correct 27 ms 42752 KB Output is correct
10 Correct 27 ms 42624 KB Output is correct
11 Correct 26 ms 42624 KB Output is correct
12 Correct 31 ms 42624 KB Output is correct
13 Correct 27 ms 42624 KB Output is correct
14 Correct 26 ms 42624 KB Output is correct
15 Correct 29 ms 42744 KB Output is correct
16 Correct 27 ms 42624 KB Output is correct
17 Correct 29 ms 42624 KB Output is correct
18 Correct 27 ms 42624 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 42624 KB Output is correct
2 Correct 29 ms 42624 KB Output is correct
3 Correct 29 ms 42624 KB Output is correct
4 Correct 26 ms 42752 KB Output is correct
5 Correct 28 ms 42624 KB Output is correct
6 Correct 27 ms 42624 KB Output is correct
7 Correct 29 ms 42624 KB Output is correct
8 Correct 29 ms 42744 KB Output is correct
9 Correct 27 ms 42752 KB Output is correct
10 Correct 27 ms 42624 KB Output is correct
11 Correct 26 ms 42624 KB Output is correct
12 Correct 31 ms 42624 KB Output is correct
13 Correct 27 ms 42624 KB Output is correct
14 Correct 26 ms 42624 KB Output is correct
15 Correct 29 ms 42744 KB Output is correct
16 Correct 27 ms 42624 KB Output is correct
17 Correct 29 ms 42624 KB Output is correct
18 Correct 27 ms 42624 KB Output is correct
19 Correct 30 ms 43008 KB Output is correct
20 Correct 32 ms 43000 KB Output is correct
21 Correct 32 ms 43000 KB Output is correct
22 Correct 33 ms 43008 KB Output is correct
23 Correct 36 ms 44028 KB Output is correct
24 Correct 37 ms 44028 KB Output is correct
25 Correct 37 ms 44016 KB Output is correct
26 Correct 40 ms 44408 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42624 KB Output is correct
2 Correct 26 ms 42624 KB Output is correct
3 Correct 31 ms 42752 KB Output is correct
4 Correct 35 ms 42880 KB Output is correct
5 Correct 73 ms 43768 KB Output is correct
6 Correct 26 ms 42624 KB Output is correct
7 Correct 30 ms 42752 KB Output is correct
8 Correct 26 ms 42752 KB Output is correct
9 Correct 28 ms 42752 KB Output is correct
10 Correct 40 ms 43008 KB Output is correct
11 Correct 86 ms 44152 KB Output is correct
12 Correct 32 ms 43644 KB Output is correct
13 Correct 31 ms 43900 KB Output is correct
14 Correct 30 ms 43896 KB Output is correct
15 Correct 42 ms 44148 KB Output is correct
16 Correct 107 ms 45300 KB Output is correct
17 Correct 78 ms 58340 KB Output is correct
18 Correct 78 ms 58724 KB Output is correct
19 Correct 85 ms 60640 KB Output is correct
20 Correct 99 ms 61664 KB Output is correct
21 Correct 277 ms 63072 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 42880 KB Output is correct
2 Correct 39 ms 43000 KB Output is correct
3 Correct 75 ms 43516 KB Output is correct
4 Correct 116 ms 44260 KB Output is correct
5 Correct 41 ms 44916 KB Output is correct
6 Correct 46 ms 45180 KB Output is correct
7 Correct 95 ms 45808 KB Output is correct
8 Correct 168 ms 46580 KB Output is correct
9 Correct 56 ms 52716 KB Output is correct
10 Correct 73 ms 52992 KB Output is correct
11 Correct 145 ms 53612 KB Output is correct
12 Correct 226 ms 54376 KB Output is correct
13 Correct 88 ms 61924 KB Output is correct
14 Correct 108 ms 63124 KB Output is correct
15 Correct 207 ms 63592 KB Output is correct
16 Correct 317 ms 64472 KB Output is correct
17 Correct 234 ms 63196 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 66656 KB Output is correct
2 Correct 344 ms 66744 KB Output is correct
3 Correct 412 ms 66652 KB Output is correct
4 Correct 335 ms 66652 KB Output is correct
5 Correct 330 ms 66276 KB Output is correct
6 Correct 308 ms 64864 KB Output is correct
7 Correct 428 ms 70112 KB Output is correct
8 Correct 426 ms 69984 KB Output is correct
9 Correct 422 ms 70112 KB Output is correct
10 Correct 437 ms 70024 KB Output is correct
11 Correct 383 ms 69476 KB Output is correct
12 Correct 359 ms 67304 KB Output is correct
13 Correct 529 ms 75356 KB Output is correct
14 Correct 509 ms 75508 KB Output is correct
15 Correct 473 ms 75356 KB Output is correct
16 Correct 492 ms 75356 KB Output is correct
17 Correct 481 ms 74208 KB Output is correct
18 Correct 421 ms 69260 KB Output is correct
19 Correct 465 ms 75360 KB Output is correct
20 Correct 468 ms 75356 KB Output is correct
21 Correct 499 ms 75484 KB Output is correct
22 Correct 471 ms 75360 KB Output is correct
23 Correct 461 ms 74208 KB Output is correct
24 Correct 434 ms 69160 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 42624 KB Output is correct
2 Correct 29 ms 42624 KB Output is correct
3 Correct 29 ms 42624 KB Output is correct
4 Correct 26 ms 42752 KB Output is correct
5 Correct 28 ms 42624 KB Output is correct
6 Correct 27 ms 42624 KB Output is correct
7 Correct 29 ms 42624 KB Output is correct
8 Correct 29 ms 42744 KB Output is correct
9 Correct 27 ms 42752 KB Output is correct
10 Correct 27 ms 42624 KB Output is correct
11 Correct 26 ms 42624 KB Output is correct
12 Correct 31 ms 42624 KB Output is correct
13 Correct 27 ms 42624 KB Output is correct
14 Correct 26 ms 42624 KB Output is correct
15 Correct 29 ms 42744 KB Output is correct
16 Correct 27 ms 42624 KB Output is correct
17 Correct 29 ms 42624 KB Output is correct
18 Correct 27 ms 42624 KB Output is correct
19 Correct 30 ms 43008 KB Output is correct
20 Correct 32 ms 43000 KB Output is correct
21 Correct 32 ms 43000 KB Output is correct
22 Correct 33 ms 43008 KB Output is correct
23 Correct 36 ms 44028 KB Output is correct
24 Correct 37 ms 44028 KB Output is correct
25 Correct 37 ms 44016 KB Output is correct
26 Correct 40 ms 44408 KB Output is correct
27 Correct 27 ms 42624 KB Output is correct
28 Correct 26 ms 42624 KB Output is correct
29 Correct 31 ms 42752 KB Output is correct
30 Correct 35 ms 42880 KB Output is correct
31 Correct 73 ms 43768 KB Output is correct
32 Correct 26 ms 42624 KB Output is correct
33 Correct 30 ms 42752 KB Output is correct
34 Correct 26 ms 42752 KB Output is correct
35 Correct 28 ms 42752 KB Output is correct
36 Correct 40 ms 43008 KB Output is correct
37 Correct 86 ms 44152 KB Output is correct
38 Correct 32 ms 43644 KB Output is correct
39 Correct 31 ms 43900 KB Output is correct
40 Correct 30 ms 43896 KB Output is correct
41 Correct 42 ms 44148 KB Output is correct
42 Correct 107 ms 45300 KB Output is correct
43 Correct 78 ms 58340 KB Output is correct
44 Correct 78 ms 58724 KB Output is correct
45 Correct 85 ms 60640 KB Output is correct
46 Correct 99 ms 61664 KB Output is correct
47 Correct 277 ms 63072 KB Output is correct
48 Correct 31 ms 42880 KB Output is correct
49 Correct 39 ms 43000 KB Output is correct
50 Correct 75 ms 43516 KB Output is correct
51 Correct 116 ms 44260 KB Output is correct
52 Correct 41 ms 44916 KB Output is correct
53 Correct 46 ms 45180 KB Output is correct
54 Correct 95 ms 45808 KB Output is correct
55 Correct 168 ms 46580 KB Output is correct
56 Correct 56 ms 52716 KB Output is correct
57 Correct 73 ms 52992 KB Output is correct
58 Correct 145 ms 53612 KB Output is correct
59 Correct 226 ms 54376 KB Output is correct
60 Correct 88 ms 61924 KB Output is correct
61 Correct 108 ms 63124 KB Output is correct
62 Correct 207 ms 63592 KB Output is correct
63 Correct 317 ms 64472 KB Output is correct
64 Correct 234 ms 63196 KB Output is correct
65 Correct 350 ms 66656 KB Output is correct
66 Correct 344 ms 66744 KB Output is correct
67 Correct 412 ms 66652 KB Output is correct
68 Correct 335 ms 66652 KB Output is correct
69 Correct 330 ms 66276 KB Output is correct
70 Correct 308 ms 64864 KB Output is correct
71 Correct 428 ms 70112 KB Output is correct
72 Correct 426 ms 69984 KB Output is correct
73 Correct 422 ms 70112 KB Output is correct
74 Correct 437 ms 70024 KB Output is correct
75 Correct 383 ms 69476 KB Output is correct
76 Correct 359 ms 67304 KB Output is correct
77 Correct 529 ms 75356 KB Output is correct
78 Correct 509 ms 75508 KB Output is correct
79 Correct 473 ms 75356 KB Output is correct
80 Correct 492 ms 75356 KB Output is correct
81 Correct 481 ms 74208 KB Output is correct
82 Correct 421 ms 69260 KB Output is correct
83 Correct 465 ms 75360 KB Output is correct
84 Correct 468 ms 75356 KB Output is correct
85 Correct 499 ms 75484 KB Output is correct
86 Correct 471 ms 75360 KB Output is correct
87 Correct 461 ms 74208 KB Output is correct
88 Correct 434 ms 69160 KB Output is correct
89 Correct 339 ms 65628 KB Output is correct
90 Correct 397 ms 66216 KB Output is correct
91 Correct 362 ms 67804 KB Output is correct
92 Correct 448 ms 67940 KB Output is correct
93 Correct 424 ms 71132 KB Output is correct
94 Correct 429 ms 69600 KB Output is correct
95 Correct 517 ms 71776 KB Output is correct
96 Correct 453 ms 70500 KB Output is correct
97 Correct 454 ms 71648 KB Output is correct
98 Correct 461 ms 74416 KB Output is correct
99 Correct 555 ms 71388 KB Output is correct
100 Correct 460 ms 71388 KB Output is correct