Submission #290022

# Submission time Handle Problem Language Result Execution time Memory
290022 2020-09-03T09:56:10 Z ngotienhung Dynamic Diameter (CEOI19_diameter) C++14
24 / 100
570 ms 69496 KB
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back

using namespace std;

const int maxN = 1e5 + 10;
const int inf = 1e18;

struct TEdge{int u, v, w;};

int         n,q,w,v;
int         timer = 0;
int         vtx[maxN], tin[maxN], tout[maxN], a[maxN], d[maxN];
TEdge       e[maxN];
vector<int> adj[maxN];

struct Node
{
    int d1, d2, d12, d23, d123, tmp;

    void add(int t){
        d1 += t;
        d2 += t;
        d12 -= t;
        d23 -= t;
        tmp += t;
    }

    void push(Node& a, Node& b){
        a.add(tmp);
        b.add(tmp);
    }
} st[maxN * 4];

Node operator + (Node a, Node b){
    Node x;
    x.d1 = max(a.d1, b.d1);
    x.d2 = min(a.d2, b.d2);
    x.d12 = max(a.d12, max(b.d12, a.d1 - b.d2 * 2));
    x.d23 = max({a.d23, b.d23, -2 * a.d2 + b.d1});
    x.d123 = max(max(a.d123, b.d123), max(a.d12 + b.d1, a.d1 + b.d23));
    x.tmp = 0;
    return x;
}

void dfs(int u){
    tin[u] = timer;

    for(auto x : adj[u]){
        if(vtx[x] != u){
            if(e[x].u == u)
                v = e[x].v;
            else
                v = e[x].u;
            vtx[x] = v;
            d[v] = d[u] + e[x].w;
            a[timer++] = d[u];
            dfs(v);
        }
    }
    a[timer++] = d[u];
    tout[u] = timer;
}

void build(int id, int l, int r){
    if(l + 1 == r){
        st[id] = {a[l], a[l], -inf, -inf, 0, 0};
    }
    else{
        build(id << 1, l, (l + r) >> 1);
        build(id << 1 | 1, (l + r) >> 1, r);
        st[id] = st[id << 1] + st[id << 1 | 1];
    }
}

void update(int id, int l, int r, int u, int v, int d){
    if(u <= l && r <= v){
        st[id].add(d);
        return;
    }

    if(r <= u || l >= v) return;

    st[id].push(st[id << 1], st[id << 1 | 1]);
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, u, v, d);
    update(id << 1 | 1, mid, r, u, v, d);
    st[id] = st[id << 1] + st[id << 1 | 1];
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(); cout.tie();
    //freopen("DD.inp", "r", stdin);

    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(i);
        adj[e[i].v].pb(i);
    }

    dfs(1);
    build(1, 0, 2 * n - 1);

    int last = 0;
    for(int i = 1; i <= q; ++i){
        int x,y;
        cin >> x >> y;
        x = (x + last) % (n - 1);
        y = (y + last) % w;
        int u = vtx[x];
        update(1, 0, 2 * n - 1, tin[u], tout[u], y - e[x].w);
        e[x].w = y;
        last = max(st[1].d1, st[1].d123);
        cout << last << endl;
    }
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2816 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2816 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 18 ms 3072 KB Output is correct
20 Correct 19 ms 3072 KB Output is correct
21 Correct 18 ms 3072 KB Output is correct
22 Correct 21 ms 3192 KB Output is correct
23 Correct 22 ms 4992 KB Output is correct
24 Correct 23 ms 4992 KB Output is correct
25 Correct 24 ms 4992 KB Output is correct
26 Correct 24 ms 5120 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 8 ms 2816 KB Output is correct
4 Correct 56 ms 2944 KB Output is correct
5 Correct 266 ms 3836 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2816 KB Output is correct
8 Correct 3 ms 2816 KB Output is correct
9 Correct 8 ms 2944 KB Output is correct
10 Correct 63 ms 3196 KB Output is correct
11 Correct 294 ms 4216 KB Output is correct
12 Correct 6 ms 4864 KB Output is correct
13 Correct 6 ms 4864 KB Output is correct
14 Correct 13 ms 4864 KB Output is correct
15 Correct 67 ms 5120 KB Output is correct
16 Correct 319 ms 6392 KB Output is correct
17 Runtime error 99 ms 65132 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 3072 KB Output is correct
2 Correct 34 ms 3200 KB Output is correct
3 Correct 159 ms 3808 KB Output is correct
4 Correct 319 ms 4472 KB Output is correct
5 Correct 12 ms 7040 KB Output is correct
6 Correct 44 ms 7168 KB Output is correct
7 Correct 189 ms 7928 KB Output is correct
8 Correct 366 ms 8796 KB Output is correct
9 Correct 40 ms 21240 KB Output is correct
10 Correct 74 ms 21496 KB Output is correct
11 Correct 237 ms 22136 KB Output is correct
12 Correct 432 ms 22904 KB Output is correct
13 Runtime error 111 ms 65528 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 570 ms 69496 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2816 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 18 ms 3072 KB Output is correct
20 Correct 19 ms 3072 KB Output is correct
21 Correct 18 ms 3072 KB Output is correct
22 Correct 21 ms 3192 KB Output is correct
23 Correct 22 ms 4992 KB Output is correct
24 Correct 23 ms 4992 KB Output is correct
25 Correct 24 ms 4992 KB Output is correct
26 Correct 24 ms 5120 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 3 ms 2688 KB Output is correct
29 Correct 8 ms 2816 KB Output is correct
30 Correct 56 ms 2944 KB Output is correct
31 Correct 266 ms 3836 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2816 KB Output is correct
34 Correct 3 ms 2816 KB Output is correct
35 Correct 8 ms 2944 KB Output is correct
36 Correct 63 ms 3196 KB Output is correct
37 Correct 294 ms 4216 KB Output is correct
38 Correct 6 ms 4864 KB Output is correct
39 Correct 6 ms 4864 KB Output is correct
40 Correct 13 ms 4864 KB Output is correct
41 Correct 67 ms 5120 KB Output is correct
42 Correct 319 ms 6392 KB Output is correct
43 Runtime error 99 ms 65132 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -