oj.uz

Submission #198629

# Submission time Handle Problem Language Result Execution time Memory
198629 2020-01-27T02:48:20 Z arnold518 Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 829 ms 61676 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;
const ll INF = 1e18;

struct Edge { int u, v; ll w; };

int N, Q, S;
ll W, ans;
Edge edge[MAXN+10];

vector<pll> adj[MAXN+10];
ll dist[MAXN+10];
vector<int> tour;
int ss[MAXN+10], ee[MAXN+10];

void dfs(int now, int bef, ll dep)
{
    dist[now]=dep;
    tour.push_back(now);
    for(auto nxt : adj[now])
    {
        if(nxt.first==bef) continue;
        dfs(nxt.first, now, dep+nxt.second);
        tour.push_back(now);
    }
}

struct Node
{
    ll aba, ab, ba, a, b;
    Node() : aba(-INF), ab(-INF), ba(-INF), a(-INF), b(-INF) {}
};
Node tree[4*MAXN+10];
ll lazy[4*MAXN+10];

Node operator + (const Node &p, const Node &q)
{
    Node ret;
    ret.aba=max({p.aba, q.aba, p.ab+q.a, p.a+q.ba});
    ret.ab=max({p.ab, q.ab, p.a+q.b});
    ret.ba=max({p.ba, q.ba, p.b+q.a});
    ret.a=max(p.a, q.a);
    ret.b=max(p.b, q.b);
    return ret;
}

void init(int node, int tl, int tr)
{
    if(tl==tr)
    {
        tree[node].a=dist[tour[tl]];
        tree[node].b=-2*dist[tour[tl]];
        tree[node].ab=tree[node].ba=-dist[tour[tl]];
        tree[node].aba=0;
        return;
    }
    int mid=tl+tr>>1;
    init(node*2, tl, mid);
    init(node*2+1, mid+1, tr);
    tree[node]=tree[node*2]+tree[node*2+1];
    lazy[node]=0;
}

void busy(int node, int tl, int tr)
{
    if(lazy[node]==0) return;
    if(tl!=tr) lazy[node*2]+=lazy[node], lazy[node*2+1]+=lazy[node];
    tree[node].ab-=lazy[node];
    tree[node].ba-=lazy[node];
    tree[node].a+=lazy[node];
    tree[node].b-=2*lazy[node];
    lazy[node]=0;
}

void update(int node, int tl, int tr, int l, int r, ll val)
{
    busy(node, tl, tr);
    if(r<tl || tr<l) return;
    if(l<=tl && tr<=r)
    {
        lazy[node]+=val;
        busy(node, tl, tr);
        return;
    }
    int mid=tl+tr>>1;
    update(node*2, tl, mid, l, r, val);
    update(node*2+1, mid+1, tr, l, r, val);
    tree[node]=tree[node*2]+tree[node*2+1];
}

ll query()
{
    busy(1, 1, S);
    return tree[1].aba;
}

int main()
{
    int i, j;

    scanf("%d%d%lld", &N, &Q, &W);
    for(i=0; i<N-1; i++)
    {
        int u, v; ll w;
        scanf("%d%d%lld", &u, &v, &w);
        edge[i]={u, v, w};
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }

    tour.push_back(-1);
    dfs(1, 0, 0);
    S=tour.size()-1;

    for(i=1; i<=S; i++) ee[tour[i]]=i;
    for(i=S; i>=1; i--) ss[tour[i]]=i;

    for(i=0; i<N-1; i++) if(dist[edge[i].u]>dist[edge[i].v]) swap(edge[i].u, edge[i].v);

    init(1, 1, S);

    while(Q--)
    {
        int d; ll e;
        scanf("%d%lld", &d, &e);
        d=(d+ans)%(N-1);
        e=(e+ans)%W;

        update(1, 1, S, ss[edge[d].v], ee[edge[d].v], e-edge[d].w);
        edge[d].w=e;

        ans=query();
        printf("%lld\n", ans);
    }
}

Compilation message

diameter.cpp: In function 'void init(int, int, int)':
diameter.cpp:63:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
diameter.cpp: In function 'void update(int, int, int, int, int, ll)':
diameter.cpp:91:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
diameter.cpp: In function 'int main()':
diameter.cpp:105:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
diameter.cpp:107:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%lld", &N, &Q, &W);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:111:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%lld", &u, &v, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:131:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%lld", &d, &e);
         ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36472 KB Output is correct
2 Correct 23 ms 36344 KB Output is correct
3 Correct 24 ms 36344 KB Output is correct
4 Correct 25 ms 36344 KB Output is correct
5 Correct 24 ms 36344 KB Output is correct
6 Correct 23 ms 36348 KB Output is correct
7 Correct 23 ms 36320 KB Output is correct
8 Correct 22 ms 36344 KB Output is correct
9 Correct 22 ms 36344 KB Output is correct
10 Correct 25 ms 36344 KB Output is correct
11 Correct 24 ms 36344 KB Output is correct
12 Correct 23 ms 36344 KB Output is correct
13 Correct 29 ms 36344 KB Output is correct
14 Correct 24 ms 36344 KB Output is correct
15 Correct 23 ms 36344 KB Output is correct
16 Correct 23 ms 36348 KB Output is correct
17 Correct 22 ms 36344 KB Output is correct
18 Correct 27 ms 36344 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36472 KB Output is correct
2 Correct 23 ms 36344 KB Output is correct
3 Correct 24 ms 36344 KB Output is correct
4 Correct 25 ms 36344 KB Output is correct
5 Correct 24 ms 36344 KB Output is correct
6 Correct 23 ms 36348 KB Output is correct
7 Correct 23 ms 36320 KB Output is correct
8 Correct 22 ms 36344 KB Output is correct
9 Correct 22 ms 36344 KB Output is correct
10 Correct 25 ms 36344 KB Output is correct
11 Correct 24 ms 36344 KB Output is correct
12 Correct 23 ms 36344 KB Output is correct
13 Correct 29 ms 36344 KB Output is correct
14 Correct 24 ms 36344 KB Output is correct
15 Correct 23 ms 36344 KB Output is correct
16 Correct 23 ms 36348 KB Output is correct
17 Correct 22 ms 36344 KB Output is correct
18 Correct 27 ms 36344 KB Output is correct
19 Correct 28 ms 36600 KB Output is correct
20 Correct 29 ms 36572 KB Output is correct
21 Correct 30 ms 36600 KB Output is correct
22 Correct 31 ms 36600 KB Output is correct
23 Correct 31 ms 37240 KB Output is correct
24 Correct 33 ms 37240 KB Output is correct
25 Correct 36 ms 37368 KB Output is correct
26 Correct 36 ms 37624 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36344 KB Output is correct
2 Correct 23 ms 36344 KB Output is correct
3 Correct 24 ms 36344 KB Output is correct
4 Correct 33 ms 36600 KB Output is correct
5 Correct 74 ms 37496 KB Output is correct
6 Correct 24 ms 36344 KB Output is correct
7 Correct 23 ms 36344 KB Output is correct
8 Correct 24 ms 36504 KB Output is correct
9 Correct 25 ms 36472 KB Output is correct
10 Correct 36 ms 36728 KB Output is correct
11 Correct 91 ms 37752 KB Output is correct
12 Correct 26 ms 37112 KB Output is correct
13 Correct 26 ms 37112 KB Output is correct
14 Correct 29 ms 37220 KB Output is correct
15 Correct 46 ms 37496 KB Output is correct
16 Correct 118 ms 38696 KB Output is correct
17 Correct 81 ms 49380 KB Output is correct
18 Correct 82 ms 49508 KB Output is correct
19 Correct 86 ms 50916 KB Output is correct
20 Correct 109 ms 51684 KB Output is correct
21 Correct 263 ms 52964 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 36600 KB Output is correct
2 Correct 33 ms 36600 KB Output is correct
3 Correct 68 ms 37240 KB Output is correct
4 Correct 121 ms 37880 KB Output is correct
5 Correct 32 ms 38136 KB Output is correct
6 Correct 43 ms 38264 KB Output is correct
7 Correct 91 ms 38904 KB Output is correct
8 Correct 147 ms 39672 KB Output is correct
9 Correct 59 ms 43892 KB Output is correct
10 Correct 71 ms 44148 KB Output is correct
11 Correct 148 ms 45044 KB Output is correct
12 Correct 220 ms 45812 KB Output is correct
13 Correct 93 ms 50924 KB Output is correct
14 Correct 113 ms 51688 KB Output is correct
15 Correct 176 ms 52328 KB Output is correct
16 Correct 299 ms 53228 KB Output is correct
17 Correct 272 ms 52972 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 55540 KB Output is correct
2 Correct 363 ms 55404 KB Output is correct
3 Correct 391 ms 55532 KB Output is correct
4 Correct 379 ms 55404 KB Output is correct
5 Correct 360 ms 55020 KB Output is correct
6 Correct 352 ms 54228 KB Output is correct
7 Correct 428 ms 57832 KB Output is correct
8 Correct 465 ms 57836 KB Output is correct
9 Correct 439 ms 57836 KB Output is correct
10 Correct 499 ms 57960 KB Output is correct
11 Correct 528 ms 57452 KB Output is correct
12 Correct 409 ms 55732 KB Output is correct
13 Correct 800 ms 61672 KB Output is correct
14 Correct 550 ms 61676 KB Output is correct
15 Correct 566 ms 61556 KB Output is correct
16 Correct 655 ms 61548 KB Output is correct
17 Correct 485 ms 60908 KB Output is correct
18 Correct 399 ms 57192 KB Output is correct
19 Correct 495 ms 61548 KB Output is correct
20 Correct 528 ms 61548 KB Output is correct
21 Correct 518 ms 61676 KB Output is correct
22 Correct 641 ms 61676 KB Output is correct
23 Correct 578 ms 61036 KB Output is correct
24 Correct 404 ms 57324 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 36472 KB Output is correct
2 Correct 23 ms 36344 KB Output is correct
3 Correct 24 ms 36344 KB Output is correct
4 Correct 25 ms 36344 KB Output is correct
5 Correct 24 ms 36344 KB Output is correct
6 Correct 23 ms 36348 KB Output is correct
7 Correct 23 ms 36320 KB Output is correct
8 Correct 22 ms 36344 KB Output is correct
9 Correct 22 ms 36344 KB Output is correct
10 Correct 25 ms 36344 KB Output is correct
11 Correct 24 ms 36344 KB Output is correct
12 Correct 23 ms 36344 KB Output is correct
13 Correct 29 ms 36344 KB Output is correct
14 Correct 24 ms 36344 KB Output is correct
15 Correct 23 ms 36344 KB Output is correct
16 Correct 23 ms 36348 KB Output is correct
17 Correct 22 ms 36344 KB Output is correct
18 Correct 27 ms 36344 KB Output is correct
19 Correct 28 ms 36600 KB Output is correct
20 Correct 29 ms 36572 KB Output is correct
21 Correct 30 ms 36600 KB Output is correct
22 Correct 31 ms 36600 KB Output is correct
23 Correct 31 ms 37240 KB Output is correct
24 Correct 33 ms 37240 KB Output is correct
25 Correct 36 ms 37368 KB Output is correct
26 Correct 36 ms 37624 KB Output is correct
27 Correct 23 ms 36344 KB Output is correct
28 Correct 23 ms 36344 KB Output is correct
29 Correct 24 ms 36344 KB Output is correct
30 Correct 33 ms 36600 KB Output is correct
31 Correct 74 ms 37496 KB Output is correct
32 Correct 24 ms 36344 KB Output is correct
33 Correct 23 ms 36344 KB Output is correct
34 Correct 24 ms 36504 KB Output is correct
35 Correct 25 ms 36472 KB Output is correct
36 Correct 36 ms 36728 KB Output is correct
37 Correct 91 ms 37752 KB Output is correct
38 Correct 26 ms 37112 KB Output is correct
39 Correct 26 ms 37112 KB Output is correct
40 Correct 29 ms 37220 KB Output is correct
41 Correct 46 ms 37496 KB Output is correct
42 Correct 118 ms 38696 KB Output is correct
43 Correct 81 ms 49380 KB Output is correct
44 Correct 82 ms 49508 KB Output is correct
45 Correct 86 ms 50916 KB Output is correct
46 Correct 109 ms 51684 KB Output is correct
47 Correct 263 ms 52964 KB Output is correct
48 Correct 28 ms 36600 KB Output is correct
49 Correct 33 ms 36600 KB Output is correct
50 Correct 68 ms 37240 KB Output is correct
51 Correct 121 ms 37880 KB Output is correct
52 Correct 32 ms 38136 KB Output is correct
53 Correct 43 ms 38264 KB Output is correct
54 Correct 91 ms 38904 KB Output is correct
55 Correct 147 ms 39672 KB Output is correct
56 Correct 59 ms 43892 KB Output is correct
57 Correct 71 ms 44148 KB Output is correct
58 Correct 148 ms 45044 KB Output is correct
59 Correct 220 ms 45812 KB Output is correct
60 Correct 93 ms 50924 KB Output is correct
61 Correct 113 ms 51688 KB Output is correct
62 Correct 176 ms 52328 KB Output is correct
63 Correct 299 ms 53228 KB Output is correct
64 Correct 272 ms 52972 KB Output is correct
65 Correct 350 ms 55540 KB Output is correct
66 Correct 363 ms 55404 KB Output is correct
67 Correct 391 ms 55532 KB Output is correct
68 Correct 379 ms 55404 KB Output is correct
69 Correct 360 ms 55020 KB Output is correct
70 Correct 352 ms 54228 KB Output is correct
71 Correct 428 ms 57832 KB Output is correct
72 Correct 465 ms 57836 KB Output is correct
73 Correct 439 ms 57836 KB Output is correct
74 Correct 499 ms 57960 KB Output is correct
75 Correct 528 ms 57452 KB Output is correct
76 Correct 409 ms 55732 KB Output is correct
77 Correct 800 ms 61672 KB Output is correct
78 Correct 550 ms 61676 KB Output is correct
79 Correct 566 ms 61556 KB Output is correct
80 Correct 655 ms 61548 KB Output is correct
81 Correct 485 ms 60908 KB Output is correct
82 Correct 399 ms 57192 KB Output is correct
83 Correct 495 ms 61548 KB Output is correct
84 Correct 528 ms 61548 KB Output is correct
85 Correct 518 ms 61676 KB Output is correct
86 Correct 641 ms 61676 KB Output is correct
87 Correct 578 ms 61036 KB Output is correct
88 Correct 404 ms 57324 KB Output is correct
89 Correct 769 ms 54384 KB Output is correct
90 Correct 472 ms 54892 KB Output is correct
91 Correct 398 ms 56020 KB Output is correct
92 Correct 407 ms 56336 KB Output is correct
93 Correct 543 ms 58348 KB Output is correct
94 Correct 429 ms 57708 KB Output is correct
95 Correct 465 ms 59236 KB Output is correct
96 Correct 829 ms 58064 KB Output is correct
97 Correct 599 ms 59116 KB Output is correct
98 Correct 589 ms 60904 KB Output is correct
99 Correct 447 ms 58788 KB Output is correct
100 Correct 600 ms 58732 KB Output is correct