oj.uz

Submission #876945

# Submission time Handle Problem Language Result Execution time Memory
876945 2023-11-22T14:44:52 Z Cookie Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 1016 ms 69828 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("ANTNEST.INP");
ofstream fout("ANTNEST.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359;
//using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 7;
const int mxn = 2e5 + 5, mxq = 2e5 + 5, sq = 350, mxv = 5e5 + 5;
const ll inf = 1e18;
const ld prec = 1e-9;

int n, q;
ll MX;
struct BIT{
    ll bit[mxn + 1];
    void upd(int p, ll v){
        while(p <= n){
            bit[p] += v; p += p & (-p);
        }
    }
    ll get(int p){
        ll ans = 0;
        while(p){
            ans += bit[p]; p -= p & (-p);
        }
        return(ans);
    }
    ll query(int l, int r){
        return(get(r) - get(l - 1));
    }
};
BIT bit;
pii up[mxn + 1][19];
int tin[mxn + 1], tout[mxn + 1], siz[mxn + 1], dep[mxn + 1], tonode[mxn + 1], tt = 0, eu = 0, eutin[mxn + 1];
int u[mxn + 1], v[mxn + 1];
ll w[mxn + 1];
vt<pll>adj[mxn + 1];
pii getmn(int l, int r){
    int lg = __lg(r - l + 1);
    return(min(up[l][lg], up[r - (1 << lg) + 1][lg]));
}
int lca(int u, int v){
    if(tin[u] > tin[v])swap(u, v);
    return(getmn(tin[u], tin[v]).se);
}
ll getdist(int u, int v){
    return(bit.get(eutin[u]) + bit.get(eutin[v]) - 2 * bit.get(eutin[lca(u, v)]));
}
void dfs(int s, int pre){
    tin[s] = ++tt; tonode[tt] = s; siz[s] = 1;
    eutin[s] = ++eu;
    for(auto [i, w]: adj[s]){
        if(i != pre){
            dep[i] = dep[s] + 1;
            dfs(i, s); siz[s] += siz[i];
            tonode[++tt] = s;
        }
    }
    tout[s] = tt;
}
struct Node{
    int u, v; ll d;
    Node(){
        
    }
    Node(int _u, int _v, ll _d){
        u = _u; v = _v; d = _d;
    }
    friend bool operator <(Node a, Node b){
        return(a.d < b.d);
    }
    friend Node operator +(Node a, Node b){
        Node res = Node(-1, -1, -1);
        res = max(res, a); res = max(res, b);
        res = max(res, Node(a.u, b.u, getdist(a.u, b.u)));
        res = max(res, Node(a.u, b.v, getdist(a.u, b.v)));
        res = max(res, Node(a.v, b.u, getdist(a.v, b.u)));
        res = max(res, Node(a.v, b.v, getdist(a.v, b.v)));
        return(res);
    }
};
Node st[4 * mxn + 1];
void build(int nd, int l, int r){
    if(l == r){
        st[nd] = Node(tonode[l], tonode[l], 0);
        return;
    }
    int mid = (l + r) >> 1;
    build(nd << 1, l, mid); build(nd << 1 | 1, mid + 1, r);
    st[nd] = st[nd << 1] + st[nd << 1 | 1];
}
void upd(int nd, int l, int r, int ql, int qr){     
    if(ql > r || qr < l)return;
    if(ql <= l && qr >= r)return;
    int mid = (l + r) >> 1;
    upd(nd << 1, l, mid, ql, qr); upd(nd << 1 | 1, mid + 1, r, ql, qr);
    st[nd] = st[nd << 1] + st[nd << 1 | 1];
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q >> MX;
    for(int i = 0; i < n - 1; i++){
        cin >> u[i] >> v[i] >> w[i];
        adj[u[i]].pb(mpp(v[i], w[i])); adj[v[i]].pb(mpp(u[i], w[i]));
    }
    dfs(1, -1);
    for(int i = 0; i < n - 1; i++){
       
        if(dep[u[i]] > dep[v[i]])swap(u[i], v[i]);
        bit.upd(eutin[v[i]], w[i]); bit.upd(eutin[v[i]] + siz[v[i]], -w[i]); 
    }
    for(int i = 1; i <= tt; i++)up[i][0] = mpp(dep[tonode[i]], tonode[i]);
    for(int i = 1; i < 19; i++){
        for(int j = 1; j + (1 << i) - 1 <= tt; j++){
            up[j][i] = min(up[j][i - 1], up[j + (1 << (i - 1))][i - 1]);
        }
    }
    
    build(1, 1, tt);
    
    
    ll last = 0;
    while(q--){
        ll d, e; cin >> d >> e; d = (d + last) % (n - 1); e = (e + last) % MX;
        bit.upd(eutin[v[d]], e - w[d]); bit.upd(eutin[v[d]] + siz[v[d]], -(e - w[d]));
        upd(1, 1, tt, tin[v[d]], tout[v[d]]);
        last = st[1].d; w[d] = e;
        cout << last << "\n";
        
    }
    return(0);
}

Compilation message

diameter.cpp: In function 'void dfs(int, int)':
diameter.cpp:68:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   68 |     for(auto [i, w]: adj[s]){
      |              ^

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14828 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 15 ms 14940 KB Output is correct
20 Correct 15 ms 14940 KB Output is correct
21 Correct 15 ms 14940 KB Output is correct
22 Correct 14 ms 14940 KB Output is correct
23 Correct 22 ms 17344 KB Output is correct
24 Correct 24 ms 17244 KB Output is correct
25 Correct 24 ms 17500 KB Output is correct
26 Correct 24 ms 17756 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 13 ms 14916 KB Output is correct
5 Correct 59 ms 15152 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 4 ms 14684 KB Output is correct
8 Correct 3 ms 14824 KB Output is correct
9 Correct 5 ms 14936 KB Output is correct
10 Correct 28 ms 14992 KB Output is correct
11 Correct 131 ms 15332 KB Output is correct
12 Correct 5 ms 17244 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 9 ms 17244 KB Output is correct
15 Correct 45 ms 17832 KB Output is correct
16 Correct 193 ms 17780 KB Output is correct
17 Correct 81 ms 55736 KB Output is correct
18 Correct 78 ms 55740 KB Output is correct
19 Correct 98 ms 55996 KB Output is correct
20 Correct 160 ms 55932 KB Output is correct
21 Correct 474 ms 56316 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14940 KB Output is correct
2 Correct 27 ms 15012 KB Output is correct
3 Correct 112 ms 15016 KB Output is correct
4 Correct 220 ms 15464 KB Output is correct
5 Correct 14 ms 19800 KB Output is correct
6 Correct 48 ms 19804 KB Output is correct
7 Correct 203 ms 20052 KB Output is correct
8 Correct 394 ms 20308 KB Output is correct
9 Correct 50 ms 36688 KB Output is correct
10 Correct 96 ms 36700 KB Output is correct
11 Correct 329 ms 37140 KB Output is correct
12 Correct 588 ms 37476 KB Output is correct
13 Correct 106 ms 56440 KB Output is correct
14 Correct 170 ms 56612 KB Output is correct
15 Correct 437 ms 56912 KB Output is correct
16 Correct 772 ms 56988 KB Output is correct
17 Correct 625 ms 57224 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 738 ms 57996 KB Output is correct
2 Correct 759 ms 62036 KB Output is correct
3 Correct 763 ms 61940 KB Output is correct
4 Correct 778 ms 61956 KB Output is correct
5 Correct 768 ms 61820 KB Output is correct
6 Correct 661 ms 61632 KB Output is correct
7 Correct 855 ms 65220 KB Output is correct
8 Correct 819 ms 65156 KB Output is correct
9 Correct 833 ms 64996 KB Output is correct
10 Correct 839 ms 65040 KB Output is correct
11 Correct 850 ms 65108 KB Output is correct
12 Correct 778 ms 64148 KB Output is correct
13 Correct 943 ms 69828 KB Output is correct
14 Correct 886 ms 69712 KB Output is correct
15 Correct 898 ms 69748 KB Output is correct
16 Correct 879 ms 69644 KB Output is correct
17 Correct 876 ms 68940 KB Output is correct
18 Correct 781 ms 65524 KB Output is correct
19 Correct 998 ms 69704 KB Output is correct
20 Correct 996 ms 69624 KB Output is correct
21 Correct 1016 ms 69784 KB Output is correct
22 Correct 862 ms 69560 KB Output is correct
23 Correct 951 ms 68992 KB Output is correct
24 Correct 974 ms 65728 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14828 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 15 ms 14940 KB Output is correct
20 Correct 15 ms 14940 KB Output is correct
21 Correct 15 ms 14940 KB Output is correct
22 Correct 14 ms 14940 KB Output is correct
23 Correct 22 ms 17344 KB Output is correct
24 Correct 24 ms 17244 KB Output is correct
25 Correct 24 ms 17500 KB Output is correct
26 Correct 24 ms 17756 KB Output is correct
27 Correct 3 ms 14684 KB Output is correct
28 Correct 3 ms 14684 KB Output is correct
29 Correct 4 ms 14684 KB Output is correct
30 Correct 13 ms 14916 KB Output is correct
31 Correct 59 ms 15152 KB Output is correct
32 Correct 3 ms 14684 KB Output is correct
33 Correct 4 ms 14684 KB Output is correct
34 Correct 3 ms 14824 KB Output is correct
35 Correct 5 ms 14936 KB Output is correct
36 Correct 28 ms 14992 KB Output is correct
37 Correct 131 ms 15332 KB Output is correct
38 Correct 5 ms 17244 KB Output is correct
39 Correct 5 ms 17244 KB Output is correct
40 Correct 9 ms 17244 KB Output is correct
41 Correct 45 ms 17832 KB Output is correct
42 Correct 193 ms 17780 KB Output is correct
43 Correct 81 ms 55736 KB Output is correct
44 Correct 78 ms 55740 KB Output is correct
45 Correct 98 ms 55996 KB Output is correct
46 Correct 160 ms 55932 KB Output is correct
47 Correct 474 ms 56316 KB Output is correct
48 Correct 5 ms 14940 KB Output is correct
49 Correct 27 ms 15012 KB Output is correct
50 Correct 112 ms 15016 KB Output is correct
51 Correct 220 ms 15464 KB Output is correct
52 Correct 14 ms 19800 KB Output is correct
53 Correct 48 ms 19804 KB Output is correct
54 Correct 203 ms 20052 KB Output is correct
55 Correct 394 ms 20308 KB Output is correct
56 Correct 50 ms 36688 KB Output is correct
57 Correct 96 ms 36700 KB Output is correct
58 Correct 329 ms 37140 KB Output is correct
59 Correct 588 ms 37476 KB Output is correct
60 Correct 106 ms 56440 KB Output is correct
61 Correct 170 ms 56612 KB Output is correct
62 Correct 437 ms 56912 KB Output is correct
63 Correct 772 ms 56988 KB Output is correct
64 Correct 625 ms 57224 KB Output is correct
65 Correct 738 ms 57996 KB Output is correct
66 Correct 759 ms 62036 KB Output is correct
67 Correct 763 ms 61940 KB Output is correct
68 Correct 778 ms 61956 KB Output is correct
69 Correct 768 ms 61820 KB Output is correct
70 Correct 661 ms 61632 KB Output is correct
71 Correct 855 ms 65220 KB Output is correct
72 Correct 819 ms 65156 KB Output is correct
73 Correct 833 ms 64996 KB Output is correct
74 Correct 839 ms 65040 KB Output is correct
75 Correct 850 ms 65108 KB Output is correct
76 Correct 778 ms 64148 KB Output is correct
77 Correct 943 ms 69828 KB Output is correct
78 Correct 886 ms 69712 KB Output is correct
79 Correct 898 ms 69748 KB Output is correct
80 Correct 879 ms 69644 KB Output is correct
81 Correct 876 ms 68940 KB Output is correct
82 Correct 781 ms 65524 KB Output is correct
83 Correct 998 ms 69704 KB Output is correct
84 Correct 996 ms 69624 KB Output is correct
85 Correct 1016 ms 69784 KB Output is correct
86 Correct 862 ms 69560 KB Output is correct
87 Correct 951 ms 68992 KB Output is correct
88 Correct 974 ms 65728 KB Output is correct
89 Correct 798 ms 60992 KB Output is correct
90 Correct 807 ms 61348 KB Output is correct
91 Correct 803 ms 63060 KB Output is correct
92 Correct 907 ms 63004 KB Output is correct
93 Correct 915 ms 65652 KB Output is correct
94 Correct 877 ms 64632 KB Output is correct
95 Correct 931 ms 66480 KB Output is correct
96 Correct 895 ms 65352 KB Output is correct
97 Correct 922 ms 66472 KB Output is correct
98 Correct 925 ms 69116 KB Output is correct
99 Correct 843 ms 66384 KB Output is correct
100 Correct 983 ms 66672 KB Output is correct