oj.uz

Submission #978063

# Submission time Handle Problem Language Result Execution time Memory
978063 2024-05-08T18:14:45 Z yeediot Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 381 ms 58112 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e5+5;
const int inf=-1e18;
int n, q, w, ord[2*mxn], timer, in[mxn], out[mxn], d[mxn];

vector<pair<int,int>>adj[mxn];
vector<tuple<int,int,int>>edges;
struct segtree{
    struct node{
        int ijk,ij,jk,i,j,k;
    }seg[8*mxn];
    int tag[8*mxn];
    void build(int l,int r,int id){
        seg[id].ijk=seg[id].ij=seg[id].jk=seg[id].i=seg[id].j=seg[id].k=0;
        tag[id]=0;
        if(l==r){
            return;
        }
        int mm=l+r>>1;
        build(l,mm,id*2);
        build(mm+1,r,id*2+1);
    }
    void upd(int id,int v){
        seg[id].ij-=v;
        seg[id].jk-=v;
        seg[id].i+=v;
        seg[id].j-=2*v;
        seg[id].k+=v;
        tag[id]+=v;
    }
    void push(int id){
        upd(id*2,tag[id]);
        upd(id*2+1,tag[id]);
        tag[id]=0;
    }
    node merge(node a,node b){
        node res={inf,inf,inf,inf,inf,inf};
        res.ijk=max({a.ijk,b.ijk,a.i+b.jk,a.ij+b.k});
        res.ij=max({a.ij,b.ij,a.i+b.j});
        res.jk=max({a.jk,b.jk,a.j+b.k});
        res.i=max({a.i,b.i});
        res.j=max({a.j,b.j});
        res.k=max({a.k,b.k});
        return res;
    }
    void modify(int l,int r,int id,int ql,int qr,int v){
        if(qr<l or r<ql){
            return;
        }
        if(ql<=l and r<=qr){
            upd(id,v);
            return;
        }
        push(id);
        int mm=l+r>>1;
        modify(l,mm,id*2,ql,qr,v);
        modify(mm+1,r,id*2+1,ql,qr,v);
        seg[id]=merge(seg[id*2],seg[id*2+1]);
    }
    void modify(int l,int r,int v){
        modify(1,2*n-1,1,l,r,v);
    }
}tr;
void dfs(int v,int pa){
    ord[++timer]=v;
    in[v]=timer;
    for(auto [u,len]:adj[v]){
        if(u==pa){
            continue;
        }
        d[u]=d[v]+len;
        dfs(u,v);
        ord[++timer]=v;
    }
    out[v]=timer;
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>q>>w;
    for(int i=1;i<n;i++){
        int a,b,c;
        cin>>a>>b>>c;
        adj[a].pb({b,c});
        adj[b].pb({a,c});
        edges.pb({a,b,c});
    }
    dfs(1,1);
    tr.build(1,2*n-1,1);
    for(int i=0;i+1<n;i++){
        auto &[a,b,c]=edges[i];
        if(d[a]>d[b]){
            swap(a,b);
        }
        tr.modify(in[b],out[b],c);
        debug(a,b,c,in[b],out[b]);
    }
    int prev=0;
    for(int i=0;i<q;i++){
        int f,s;
        cin>>f>>s;
        f=(f+prev)%(n-1);
        s=(s+prev)%w;
        auto &[a,b,c]=edges[f];
        int dif=s-c;
        c=s;
        tr.modify(in[b],out[b],dif);
        prev=tr.seg[1].ijk;
        cout<<prev<<'\n';
    }
}
 /*
 input:
 1 2 3 2 4 2 1
 */

Compilation message

diameter.cpp: In member function 'void segtree::build(long long int, long long int, long long int)':
diameter.cpp:71:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |         int mm=l+r>>1;
      |                ~^~
diameter.cpp: In member function 'void segtree::modify(long long int, long long int, long long int, long long int, long long int, long long int)':
diameter.cpp:107:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  107 |         int mm=l+r>>1;
      |                ~^~
diameter.cpp: In function 'void setIO(std::string)':
diameter.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 4 ms 8792 KB Output is correct
20 Correct 5 ms 9024 KB Output is correct
21 Correct 4 ms 9052 KB Output is correct
22 Correct 5 ms 9052 KB Output is correct
23 Correct 8 ms 9560 KB Output is correct
24 Correct 8 ms 9564 KB Output is correct
25 Correct 8 ms 9564 KB Output is correct
26 Correct 10 ms 9880 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6576 KB Output is correct
4 Correct 7 ms 6748 KB Output is correct
5 Correct 29 ms 7756 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6744 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 9 ms 6836 KB Output is correct
11 Correct 38 ms 8224 KB Output is correct
12 Correct 4 ms 9308 KB Output is correct
13 Correct 4 ms 9384 KB Output is correct
14 Correct 6 ms 9564 KB Output is correct
15 Correct 13 ms 9608 KB Output is correct
16 Correct 49 ms 10816 KB Output is correct
17 Correct 64 ms 46268 KB Output is correct
18 Correct 62 ms 46264 KB Output is correct
19 Correct 66 ms 46656 KB Output is correct
20 Correct 76 ms 46784 KB Output is correct
21 Correct 162 ms 48288 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Correct 7 ms 9052 KB Output is correct
3 Correct 33 ms 9584 KB Output is correct
4 Correct 51 ms 10320 KB Output is correct
5 Correct 8 ms 11924 KB Output is correct
6 Correct 16 ms 12176 KB Output is correct
7 Correct 50 ms 12688 KB Output is correct
8 Correct 74 ms 13592 KB Output is correct
9 Correct 36 ms 26896 KB Output is correct
10 Correct 43 ms 27148 KB Output is correct
11 Correct 74 ms 27760 KB Output is correct
12 Correct 111 ms 28672 KB Output is correct
13 Correct 77 ms 47612 KB Output is correct
14 Correct 83 ms 47616 KB Output is correct
15 Correct 119 ms 48380 KB Output is correct
16 Correct 162 ms 49660 KB Output is correct
17 Correct 160 ms 49760 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 51704 KB Output is correct
2 Correct 234 ms 51456 KB Output is correct
3 Correct 227 ms 52064 KB Output is correct
4 Correct 221 ms 51288 KB Output is correct
5 Correct 210 ms 51196 KB Output is correct
6 Correct 209 ms 51068 KB Output is correct
7 Correct 261 ms 54220 KB Output is correct
8 Correct 273 ms 53836 KB Output is correct
9 Correct 248 ms 53756 KB Output is correct
10 Correct 265 ms 54080 KB Output is correct
11 Correct 249 ms 53544 KB Output is correct
12 Correct 223 ms 52964 KB Output is correct
13 Correct 309 ms 57592 KB Output is correct
14 Correct 319 ms 57556 KB Output is correct
15 Correct 328 ms 57892 KB Output is correct
16 Correct 312 ms 57620 KB Output is correct
17 Correct 310 ms 57600 KB Output is correct
18 Correct 228 ms 54080 KB Output is correct
19 Correct 315 ms 58112 KB Output is correct
20 Correct 305 ms 57596 KB Output is correct
21 Correct 328 ms 57476 KB Output is correct
22 Correct 316 ms 57528 KB Output is correct
23 Correct 381 ms 56840 KB Output is correct
24 Correct 268 ms 54164 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 4 ms 8792 KB Output is correct
20 Correct 5 ms 9024 KB Output is correct
21 Correct 4 ms 9052 KB Output is correct
22 Correct 5 ms 9052 KB Output is correct
23 Correct 8 ms 9560 KB Output is correct
24 Correct 8 ms 9564 KB Output is correct
25 Correct 8 ms 9564 KB Output is correct
26 Correct 10 ms 9880 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 2 ms 6576 KB Output is correct
30 Correct 7 ms 6748 KB Output is correct
31 Correct 29 ms 7756 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 2 ms 6744 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 9 ms 6836 KB Output is correct
37 Correct 38 ms 8224 KB Output is correct
38 Correct 4 ms 9308 KB Output is correct
39 Correct 4 ms 9384 KB Output is correct
40 Correct 6 ms 9564 KB Output is correct
41 Correct 13 ms 9608 KB Output is correct
42 Correct 49 ms 10816 KB Output is correct
43 Correct 64 ms 46268 KB Output is correct
44 Correct 62 ms 46264 KB Output is correct
45 Correct 66 ms 46656 KB Output is correct
46 Correct 76 ms 46784 KB Output is correct
47 Correct 162 ms 48288 KB Output is correct
48 Correct 3 ms 8796 KB Output is correct
49 Correct 7 ms 9052 KB Output is correct
50 Correct 33 ms 9584 KB Output is correct
51 Correct 51 ms 10320 KB Output is correct
52 Correct 8 ms 11924 KB Output is correct
53 Correct 16 ms 12176 KB Output is correct
54 Correct 50 ms 12688 KB Output is correct
55 Correct 74 ms 13592 KB Output is correct
56 Correct 36 ms 26896 KB Output is correct
57 Correct 43 ms 27148 KB Output is correct
58 Correct 74 ms 27760 KB Output is correct
59 Correct 111 ms 28672 KB Output is correct
60 Correct 77 ms 47612 KB Output is correct
61 Correct 83 ms 47616 KB Output is correct
62 Correct 119 ms 48380 KB Output is correct
63 Correct 162 ms 49660 KB Output is correct
64 Correct 160 ms 49760 KB Output is correct
65 Correct 227 ms 51704 KB Output is correct
66 Correct 234 ms 51456 KB Output is correct
67 Correct 227 ms 52064 KB Output is correct
68 Correct 221 ms 51288 KB Output is correct
69 Correct 210 ms 51196 KB Output is correct
70 Correct 209 ms 51068 KB Output is correct
71 Correct 261 ms 54220 KB Output is correct
72 Correct 273 ms 53836 KB Output is correct
73 Correct 248 ms 53756 KB Output is correct
74 Correct 265 ms 54080 KB Output is correct
75 Correct 249 ms 53544 KB Output is correct
76 Correct 223 ms 52964 KB Output is correct
77 Correct 309 ms 57592 KB Output is correct
78 Correct 319 ms 57556 KB Output is correct
79 Correct 328 ms 57892 KB Output is correct
80 Correct 312 ms 57620 KB Output is correct
81 Correct 310 ms 57600 KB Output is correct
82 Correct 228 ms 54080 KB Output is correct
83 Correct 315 ms 58112 KB Output is correct
84 Correct 305 ms 57596 KB Output is correct
85 Correct 328 ms 57476 KB Output is correct
86 Correct 316 ms 57528 KB Output is correct
87 Correct 381 ms 56840 KB Output is correct
88 Correct 268 ms 54164 KB Output is correct
89 Correct 218 ms 51028 KB Output is correct
90 Correct 226 ms 50672 KB Output is correct
91 Correct 265 ms 52452 KB Output is correct
92 Correct 263 ms 52364 KB Output is correct
93 Correct 284 ms 54292 KB Output is correct
94 Correct 286 ms 53600 KB Output is correct
95 Correct 291 ms 54916 KB Output is correct
96 Correct 302 ms 53996 KB Output is correct
97 Correct 325 ms 55036 KB Output is correct
98 Correct 305 ms 56820 KB Output is correct
99 Correct 289 ms 54556 KB Output is correct
100 Correct 308 ms 54540 KB Output is correct