oj.uz

Submission #235280

# Submission time Handle Problem Language Result Execution time Memory
235280 2020-05-27T14:54:28 Z 2fat2code Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 439 ms 47208 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define sz() size()
#define fr first
#define sc second
#define int long long
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int nmax=100005;

int n,q,w,weight[nmax],first[nmax],last[nmax],last_ans,ans;
vector<pair<int,int>>nod[nmax];
vector<int>path;

void DFS(int s,int par){
    for(auto it:nod[s]){
        if(it.fr!=par){
            path.push_back(it.sc);
            DFS(it.fr,s);
            path.push_back(it.sc);
        }
    }
}

struct tree{
    int last,max_abc,max_a,max_bc,max_ab,max_b;
}aint[8*nmax];

tree merge(tree a,tree b){
    tree ANS;
    ANS.last=(a.last+b.last);
    ANS.max_abc=max({a.max_abc,a.max_a+b.max_bc-a.last,a.max_ab+b.max_a+a.last,b.max_abc});
    ANS.max_a=max({a.max_a,b.max_a+a.last});
    ANS.max_bc=max({a.max_bc,a.max_b+b.max_a+a.last,b.max_bc-a.last});
    ANS.max_ab=max({a.max_ab,a.max_a+b.max_b-2*a.last,b.max_ab-a.last});
    ANS.max_b=max({a.max_b,b.max_b-2*a.last});
    return ANS;
}

void update(int l,int r,int pos,int nod){
    if(l==r){
        int curr=weight[path[pos-1]];
        if(first[path[pos-1]]==pos) aint[nod]={ curr,curr,curr,curr,0,0};
        if(last[path[pos-1]]==pos)  aint[nod]={-curr,curr,0,curr,curr,2*curr};
    }
    else{
        int mid=l+(r-l)/2;
        if(pos<=mid) update(l,mid,pos,2*nod);
        else update(mid+1,r,pos,2*nod+1);
        aint[nod]=merge(aint[2*nod],aint[2*nod+1]);
    }
}


int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    cin >> n >> q >> w;
    for(int i=1;i<n;i++){
        int x,y,z;
        cin >> x >> y >> z;
        nod[x].push_back({y,i});
        nod[y].push_back({x,i});
        weight[i]=z;
    }
    DFS(1,-1);
    for(int i=0;i<path.size();i++){
        last[path[i]]=(i+1);
        if(first[path[i]]==0) first[path[i]]=(i+1);
    }
    for(int i=1;i<=2*n-2;i++){
        update(1,2*n-2,i,1);
    }
    for(int i=1;i<=q;i++){
        int x,y;
        cin >> x >> y;
        x=(x+last_ans)%(n-1)+1;
        y=(y+last_ans)%w;
        weight[x]=y;
        update(1,2*n-2,first[x],1);
        update(1,2*n-2,last[x],1);
        last_ans=aint[1].max_abc;
        cout << last_ans << '\n';
    }
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:74:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<path.size();i++){
                 ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2740 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Correct 7 ms 2688 KB Output is correct
8 Correct 6 ms 2688 KB Output is correct
9 Correct 6 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 8 ms 2688 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2816 KB Output is correct
15 Correct 6 ms 2688 KB Output is correct
16 Correct 8 ms 2688 KB Output is correct
17 Correct 6 ms 2816 KB Output is correct
18 Correct 8 ms 2816 KB Output is correct
19 Correct 11 ms 3200 KB Output is correct
20 Correct 11 ms 3072 KB Output is correct
21 Correct 10 ms 3072 KB Output is correct
22 Correct 11 ms 3200 KB Output is correct
23 Correct 16 ms 4992 KB Output is correct
24 Correct 16 ms 4992 KB Output is correct
25 Correct 17 ms 5120 KB Output is correct
26 Correct 16 ms 5248 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2664 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 7 ms 2816 KB Output is correct
4 Correct 16 ms 2916 KB Output is correct
5 Correct 60 ms 3832 KB Output is correct
6 Correct 6 ms 2720 KB Output is correct
7 Correct 7 ms 2816 KB Output is correct
8 Correct 7 ms 2816 KB Output is correct
9 Correct 8 ms 2944 KB Output is correct
10 Correct 32 ms 3192 KB Output is correct
11 Correct 74 ms 4216 KB Output is correct
12 Correct 11 ms 4864 KB Output is correct
13 Correct 12 ms 4864 KB Output is correct
14 Correct 13 ms 4992 KB Output is correct
15 Correct 29 ms 5120 KB Output is correct
16 Correct 93 ms 6392 KB Output is correct
17 Correct 124 ms 37216 KB Output is correct
18 Correct 129 ms 37320 KB Output is correct
19 Correct 120 ms 37344 KB Output is correct
20 Correct 176 ms 37600 KB Output is correct
21 Correct 292 ms 39000 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3072 KB Output is correct
2 Correct 13 ms 3192 KB Output is correct
3 Correct 43 ms 3712 KB Output is correct
4 Correct 92 ms 4472 KB Output is correct
5 Correct 18 ms 7040 KB Output is correct
6 Correct 26 ms 7168 KB Output is correct
7 Correct 61 ms 7804 KB Output is correct
8 Correct 110 ms 8620 KB Output is correct
9 Correct 78 ms 20584 KB Output is correct
10 Correct 90 ms 20844 KB Output is correct
11 Correct 126 ms 21480 KB Output is correct
12 Correct 186 ms 22376 KB Output is correct
13 Correct 131 ms 38476 KB Output is correct
14 Correct 161 ms 38628 KB Output is correct
15 Correct 197 ms 39268 KB Output is correct
16 Correct 282 ms 40180 KB Output is correct
17 Correct 290 ms 39932 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 42212 KB Output is correct
2 Correct 353 ms 42212 KB Output is correct
3 Correct 394 ms 42316 KB Output is correct
4 Correct 346 ms 42212 KB Output is correct
5 Correct 341 ms 42072 KB Output is correct
6 Correct 327 ms 42084 KB Output is correct
7 Correct 368 ms 44108 KB Output is correct
8 Correct 365 ms 44388 KB Output is correct
9 Correct 385 ms 44124 KB Output is correct
10 Correct 375 ms 44132 KB Output is correct
11 Correct 383 ms 44112 KB Output is correct
12 Correct 364 ms 43240 KB Output is correct
13 Correct 439 ms 46948 KB Output is correct
14 Correct 389 ms 46876 KB Output is correct
15 Correct 381 ms 46944 KB Output is correct
16 Correct 398 ms 46948 KB Output is correct
17 Correct 377 ms 46564 KB Output is correct
18 Correct 349 ms 44260 KB Output is correct
19 Correct 389 ms 46948 KB Output is correct
20 Correct 394 ms 46820 KB Output is correct
21 Correct 390 ms 47208 KB Output is correct
22 Correct 387 ms 46948 KB Output is correct
23 Correct 397 ms 46728 KB Output is correct
24 Correct 338 ms 44256 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2740 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Correct 7 ms 2688 KB Output is correct
8 Correct 6 ms 2688 KB Output is correct
9 Correct 6 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 8 ms 2688 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2816 KB Output is correct
15 Correct 6 ms 2688 KB Output is correct
16 Correct 8 ms 2688 KB Output is correct
17 Correct 6 ms 2816 KB Output is correct
18 Correct 8 ms 2816 KB Output is correct
19 Correct 11 ms 3200 KB Output is correct
20 Correct 11 ms 3072 KB Output is correct
21 Correct 10 ms 3072 KB Output is correct
22 Correct 11 ms 3200 KB Output is correct
23 Correct 16 ms 4992 KB Output is correct
24 Correct 16 ms 4992 KB Output is correct
25 Correct 17 ms 5120 KB Output is correct
26 Correct 16 ms 5248 KB Output is correct
27 Correct 7 ms 2664 KB Output is correct
28 Correct 6 ms 2688 KB Output is correct
29 Correct 7 ms 2816 KB Output is correct
30 Correct 16 ms 2916 KB Output is correct
31 Correct 60 ms 3832 KB Output is correct
32 Correct 6 ms 2720 KB Output is correct
33 Correct 7 ms 2816 KB Output is correct
34 Correct 7 ms 2816 KB Output is correct
35 Correct 8 ms 2944 KB Output is correct
36 Correct 32 ms 3192 KB Output is correct
37 Correct 74 ms 4216 KB Output is correct
38 Correct 11 ms 4864 KB Output is correct
39 Correct 12 ms 4864 KB Output is correct
40 Correct 13 ms 4992 KB Output is correct
41 Correct 29 ms 5120 KB Output is correct
42 Correct 93 ms 6392 KB Output is correct
43 Correct 124 ms 37216 KB Output is correct
44 Correct 129 ms 37320 KB Output is correct
45 Correct 120 ms 37344 KB Output is correct
46 Correct 176 ms 37600 KB Output is correct
47 Correct 292 ms 39000 KB Output is correct
48 Correct 8 ms 3072 KB Output is correct
49 Correct 13 ms 3192 KB Output is correct
50 Correct 43 ms 3712 KB Output is correct
51 Correct 92 ms 4472 KB Output is correct
52 Correct 18 ms 7040 KB Output is correct
53 Correct 26 ms 7168 KB Output is correct
54 Correct 61 ms 7804 KB Output is correct
55 Correct 110 ms 8620 KB Output is correct
56 Correct 78 ms 20584 KB Output is correct
57 Correct 90 ms 20844 KB Output is correct
58 Correct 126 ms 21480 KB Output is correct
59 Correct 186 ms 22376 KB Output is correct
60 Correct 131 ms 38476 KB Output is correct
61 Correct 161 ms 38628 KB Output is correct
62 Correct 197 ms 39268 KB Output is correct
63 Correct 282 ms 40180 KB Output is correct
64 Correct 290 ms 39932 KB Output is correct
65 Correct 378 ms 42212 KB Output is correct
66 Correct 353 ms 42212 KB Output is correct
67 Correct 394 ms 42316 KB Output is correct
68 Correct 346 ms 42212 KB Output is correct
69 Correct 341 ms 42072 KB Output is correct
70 Correct 327 ms 42084 KB Output is correct
71 Correct 368 ms 44108 KB Output is correct
72 Correct 365 ms 44388 KB Output is correct
73 Correct 385 ms 44124 KB Output is correct
74 Correct 375 ms 44132 KB Output is correct
75 Correct 383 ms 44112 KB Output is correct
76 Correct 364 ms 43240 KB Output is correct
77 Correct 439 ms 46948 KB Output is correct
78 Correct 389 ms 46876 KB Output is correct
79 Correct 381 ms 46944 KB Output is correct
80 Correct 398 ms 46948 KB Output is correct
81 Correct 377 ms 46564 KB Output is correct
82 Correct 349 ms 44260 KB Output is correct
83 Correct 389 ms 46948 KB Output is correct
84 Correct 394 ms 46820 KB Output is correct
85 Correct 390 ms 47208 KB Output is correct
86 Correct 387 ms 46948 KB Output is correct
87 Correct 397 ms 46728 KB Output is correct
88 Correct 338 ms 44256 KB Output is correct
89 Correct 380 ms 41452 KB Output is correct
90 Correct 348 ms 41572 KB Output is correct
91 Correct 357 ms 42604 KB Output is correct
92 Correct 360 ms 42572 KB Output is correct
93 Correct 364 ms 44264 KB Output is correct
94 Correct 392 ms 43748 KB Output is correct
95 Correct 384 ms 44748 KB Output is correct
96 Correct 437 ms 44148 KB Output is correct
97 Correct 385 ms 44760 KB Output is correct
98 Correct 384 ms 46092 KB Output is correct
99 Correct 423 ms 44552 KB Output is correct
100 Correct 394 ms 44520 KB Output is correct