oj.uz

Submission #476647

# Submission time Handle Problem Language Result Execution time Memory
476647 2021-09-27T23:42:22 Z Ozy Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 302 ms 50116 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 100000
#define des first
#define val second
#define ini first
#define fin second

struct x{
    lli a;
    lli b;
    lli ab;
    lli ba;
    lli aba;
    lli lazy;
};

lli n,q,w,a,b,c,offset,last,nuevo,in,fi,act;
lli euleriano[MAX*4],prof[MAX*4 ],aristas[MAX+2][3];
pair<lli,lli> rango[MAX+2];
vector<pair<lli,lli> > hijos[MAX+2];
x st[MAX*8];

void combina(lli nodo) {

    lli izq = nodo*2;
    lli der = (nodo*2)+1;

    st[nodo].a = max(st[izq].a, st[der].a);
    st[nodo].b = max(st[izq].b, st[der].b);

    st[nodo].ab = max({st[izq].ab, st[der].ab, (st[izq].a + st[der].b)});
    st[nodo].ba = max({st[izq].ba, st[der].ba, (st[izq].b + st[der].a)});

    st[nodo].aba = max({st[izq].aba, st[der].aba, (st[izq].ab + st[der].a), (st[izq].a + st[der].ba)});
}

void DFS(lli pos, lli padre, lli p) {

    prof[act] = p;
    euleriano[act] = pos;
    act++;

    for (auto h : hijos[pos]) {
        if (h.des == padre) continue;

        DFS(h.des,pos,p+h.val);

        prof[act] = p;
        euleriano[act] = pos;
        act++;
    }
}

void aplica(lli pos) {
    if (st[pos].lazy != 0) {

        st[pos].a += st[pos].lazy;
        st[pos].b -= 2*st[pos].lazy;
        st[pos].ab -= st[pos].lazy;
        st[pos].ba -= st[pos].lazy;

        if (pos <= offset) {
            st[pos*2].lazy += st[pos].lazy;
            st[(pos*2)+1].lazy += st[pos].lazy;
        }

        st[pos].lazy = 0;
    }
}

void actualiza(lli pos, lli ini, lli fin, lli l, lli r, lli sum) {

    aplica(pos);

    if (ini > r || fin < l) return;
    else if (ini >= l && fin <= r) {
        st[pos].lazy = sum;
        aplica(pos);
    }
    else {

        lli mitad = (ini+fin)/2;
        actualiza(pos*2, ini, mitad, l, r, sum);
        actualiza((pos*2)+1, mitad+1, fin, l, r, sum);

        combina(pos);

    }

}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> q >> w;
    rep(i,1,n-1) {

        cin >> a >> b >> c;
        aristas[i][0] = a;
        aristas[i][1] = b;
        aristas[i][2] = c;

        hijos[a].push_back({b,c});
        hijos[b].push_back({a,c});
    }

    //llenar euleriano y profundidad
    act = 1;
    DFS(1,0,0);
    act--;
    //largo de ST es 1 - act
    rep(i,1,act) {
        rango[euleriano[i]].fin = i;
        if (rango[euleriano[i]].ini == 0) rango[euleriano[i]].ini = i;
    }

    offset = 1;
    while (offset < act) offset *= 2;
    offset--;

    rep(i,1,act) {
        st[offset+i].a = prof[i];
        st[offset+i].b = -(2*prof[i]);
        st[offset+i].ab = -prof[i];
        st[offset+i].ba = -prof[i];
        st[offset+i].aba = 0;
    }

    repa(i,offset,1) combina(i);

    last = 0;
    rep(i,1,q){
        cin >> a >> b;
        a = (a+last)%(n-1);
        a++;
        c = (b+last)%w;

        nuevo = c - aristas[a][2];
        aristas[a][2] = c;

        b = aristas[a][1];
        a = aristas[a][0];

        in = max(rango[a].ini, rango[b].ini);
        fi = min(rango[a].fin, rango[b].fin);

        actualiza(1,1,offset+1,in,fi,nuevo);

        last = st[1].aba;
        cout << last << "\n";
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct
10 Correct 1 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct
10 Correct 1 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 6 ms 3020 KB Output is correct
20 Correct 5 ms 3020 KB Output is correct
21 Correct 6 ms 3020 KB Output is correct
22 Correct 6 ms 3020 KB Output is correct
23 Correct 8 ms 4556 KB Output is correct
24 Correct 8 ms 4532 KB Output is correct
25 Correct 11 ms 4556 KB Output is correct
26 Correct 13 ms 4972 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 9 ms 2796 KB Output is correct
5 Correct 40 ms 3040 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 11 ms 2892 KB Output is correct
11 Correct 58 ms 3232 KB Output is correct
12 Correct 4 ms 4556 KB Output is correct
13 Correct 4 ms 4556 KB Output is correct
14 Correct 5 ms 4556 KB Output is correct
15 Correct 15 ms 4644 KB Output is correct
16 Correct 68 ms 5044 KB Output is correct
17 Correct 59 ms 36044 KB Output is correct
18 Correct 47 ms 37220 KB Output is correct
19 Correct 49 ms 37308 KB Output is correct
20 Correct 69 ms 37648 KB Output is correct
21 Correct 150 ms 38912 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3020 KB Output is correct
2 Correct 8 ms 3020 KB Output is correct
3 Correct 40 ms 3304 KB Output is correct
4 Correct 63 ms 3524 KB Output is correct
5 Correct 8 ms 6348 KB Output is correct
6 Correct 16 ms 6476 KB Output is correct
7 Correct 54 ms 6608 KB Output is correct
8 Correct 88 ms 6900 KB Output is correct
9 Correct 28 ms 19724 KB Output is correct
10 Correct 38 ms 19808 KB Output is correct
11 Correct 75 ms 19972 KB Output is correct
12 Correct 140 ms 20420 KB Output is correct
13 Correct 54 ms 36800 KB Output is correct
14 Correct 64 ms 38552 KB Output is correct
15 Correct 106 ms 39312 KB Output is correct
16 Correct 173 ms 40160 KB Output is correct
17 Correct 180 ms 39876 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 38172 KB Output is correct
2 Correct 226 ms 42348 KB Output is correct
3 Correct 216 ms 42308 KB Output is correct
4 Correct 241 ms 42288 KB Output is correct
5 Correct 238 ms 42120 KB Output is correct
6 Correct 233 ms 42064 KB Output is correct
7 Correct 285 ms 45380 KB Output is correct
8 Correct 249 ms 45340 KB Output is correct
9 Correct 239 ms 45268 KB Output is correct
10 Correct 264 ms 45336 KB Output is correct
11 Correct 274 ms 45072 KB Output is correct
12 Correct 239 ms 44200 KB Output is correct
13 Correct 283 ms 49908 KB Output is correct
14 Correct 302 ms 50112 KB Output is correct
15 Correct 289 ms 50044 KB Output is correct
16 Correct 280 ms 50116 KB Output is correct
17 Correct 283 ms 49272 KB Output is correct
18 Correct 257 ms 45856 KB Output is correct
19 Correct 298 ms 49976 KB Output is correct
20 Correct 273 ms 50096 KB Output is correct
21 Correct 297 ms 50076 KB Output is correct
22 Correct 282 ms 50116 KB Output is correct
23 Correct 290 ms 49292 KB Output is correct
24 Correct 290 ms 45876 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct
10 Correct 1 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 6 ms 3020 KB Output is correct
20 Correct 5 ms 3020 KB Output is correct
21 Correct 6 ms 3020 KB Output is correct
22 Correct 6 ms 3020 KB Output is correct
23 Correct 8 ms 4556 KB Output is correct
24 Correct 8 ms 4532 KB Output is correct
25 Correct 11 ms 4556 KB Output is correct
26 Correct 13 ms 4972 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 2 ms 2636 KB Output is correct
30 Correct 9 ms 2796 KB Output is correct
31 Correct 40 ms 3040 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 2 ms 2764 KB Output is correct
35 Correct 3 ms 2764 KB Output is correct
36 Correct 11 ms 2892 KB Output is correct
37 Correct 58 ms 3232 KB Output is correct
38 Correct 4 ms 4556 KB Output is correct
39 Correct 4 ms 4556 KB Output is correct
40 Correct 5 ms 4556 KB Output is correct
41 Correct 15 ms 4644 KB Output is correct
42 Correct 68 ms 5044 KB Output is correct
43 Correct 59 ms 36044 KB Output is correct
44 Correct 47 ms 37220 KB Output is correct
45 Correct 49 ms 37308 KB Output is correct
46 Correct 69 ms 37648 KB Output is correct
47 Correct 150 ms 38912 KB Output is correct
48 Correct 3 ms 3020 KB Output is correct
49 Correct 8 ms 3020 KB Output is correct
50 Correct 40 ms 3304 KB Output is correct
51 Correct 63 ms 3524 KB Output is correct
52 Correct 8 ms 6348 KB Output is correct
53 Correct 16 ms 6476 KB Output is correct
54 Correct 54 ms 6608 KB Output is correct
55 Correct 88 ms 6900 KB Output is correct
56 Correct 28 ms 19724 KB Output is correct
57 Correct 38 ms 19808 KB Output is correct
58 Correct 75 ms 19972 KB Output is correct
59 Correct 140 ms 20420 KB Output is correct
60 Correct 54 ms 36800 KB Output is correct
61 Correct 64 ms 38552 KB Output is correct
62 Correct 106 ms 39312 KB Output is correct
63 Correct 173 ms 40160 KB Output is correct
64 Correct 180 ms 39876 KB Output is correct
65 Correct 234 ms 38172 KB Output is correct
66 Correct 226 ms 42348 KB Output is correct
67 Correct 216 ms 42308 KB Output is correct
68 Correct 241 ms 42288 KB Output is correct
69 Correct 238 ms 42120 KB Output is correct
70 Correct 233 ms 42064 KB Output is correct
71 Correct 285 ms 45380 KB Output is correct
72 Correct 249 ms 45340 KB Output is correct
73 Correct 239 ms 45268 KB Output is correct
74 Correct 264 ms 45336 KB Output is correct
75 Correct 274 ms 45072 KB Output is correct
76 Correct 239 ms 44200 KB Output is correct
77 Correct 283 ms 49908 KB Output is correct
78 Correct 302 ms 50112 KB Output is correct
79 Correct 289 ms 50044 KB Output is correct
80 Correct 280 ms 50116 KB Output is correct
81 Correct 283 ms 49272 KB Output is correct
82 Correct 257 ms 45856 KB Output is correct
83 Correct 298 ms 49976 KB Output is correct
84 Correct 273 ms 50096 KB Output is correct
85 Correct 297 ms 50076 KB Output is correct
86 Correct 282 ms 50116 KB Output is correct
87 Correct 290 ms 49292 KB Output is correct
88 Correct 290 ms 45876 KB Output is correct
89 Correct 221 ms 41288 KB Output is correct
90 Correct 251 ms 41656 KB Output is correct
91 Correct 241 ms 43336 KB Output is correct
92 Correct 226 ms 43240 KB Output is correct
93 Correct 250 ms 46148 KB Output is correct
94 Correct 284 ms 45100 KB Output is correct
95 Correct 295 ms 46968 KB Output is correct
96 Correct 296 ms 45808 KB Output is correct
97 Correct 292 ms 46896 KB Output is correct
98 Correct 292 ms 49200 KB Output is correct
99 Correct 265 ms 46640 KB Output is correct
100 Correct 271 ms 46588 KB Output is correct