oj.uz

답안 #940683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940683 2024-03-07T13:13:31 Z Zero_OP Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 324 ms 63924 KB 
#include<bits/stdc++.h>

using namespace std;
using int64 = int64_t;

#define     REP(i, n) for(int i = 0, _n = n; i < _n; ++i)
#define    REPD(i, n) for(int i = n - 1; i >= 0; --i)
#define  FOR(i, l, r) for(int i = l, _r = r; i <= _r; ++i)
#define FORD(i, r, l) for(int i = r, _l = l; i >= _l; --i)
#define          left __left
#define         right __right
#define          prev __prev
#define          next __next
#define           div __div
#define            pb push_back
#define            pf push_front
#define         sz(v) (int)v.size()
#define      range(v) begin(v), end(v)
#define    compact(v) v.erase(unique(range(v)), end(v))
#define      debug(v) "[" #v " = " << (v) << "]"

template<typename T>
    bool minimize(T& a, const T& b){
        if(a > b){
            a = b;
            return true;
        }
        return false;
    }

template<typename T>
    bool maximize(T& a, const T& b){
        if(a < b){
            a = b;
            return true;
        }
        return false;
    }

template<int dimension, class T>
struct vec : public vector<vec<dimension - 1, T>> {
    static_assert(dimension > 0, "Dimension must be positive !\n");
    template<typename... Args>
    vec(int n = 0, Args... args) : vector<vec<dimension - 1, T>>(n, vec<dimension - 1, T>(args...)) {}
};

template<class T>
struct vec<1, T> : public vector<T> {
    vec(int n = 0, T val = T()) : vector<T>(n, val) {}
};

void init(void);
void process(void);

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

    #define task "antuvu"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }

    int T = 1; //cin >> T;
    while(T--) {
        init();
        process();
    }

    return 0;
}

const int MAX = 1e5 + 5;

int N, Q, timer_dfs, tin[MAX], tout[MAX], eu[MAX], ev[MAX]; int64 W, ew[MAX];
vector<int> adj[MAX];

struct node{
    int64 a, b, c, ab, bc, abc;
    node(){
        a = 0;
        b = 0;
        c = 0;
        ab = 0;
        bc = 0;
        abc = 0;
    }
    friend node combine(const node& L, const node& R){
        node z;
        z.a = max(L.a, R.a);
        z.b = max(L.b, R.b);
        z.c = max(L.c, R.c);
        z.ab = max({L.ab, R.ab, L.a + R.b});
        z.bc = max({L.bc, R.bc, L.b + R.c});
        z.abc = max({L.abc, R.abc, L.a + R.bc, L.ab + R.c});
        return z;
    }
};

node st[MAX * 2 * 4];
int64 lzy[MAX * 2 * 4];

void build(int id, int l, int r){
    st[id].a = 0;
    st[id].b = 0;
    st[id].c = 0;
    st[id].ab = 0;
    st[id].bc = 0;
    st[id].abc = 0;
    if(l < r){
        int mid = l + r >> 1;
        build(id << 1, l, mid);
        build(id << 1 | 1, mid + 1, r);
    }
}

void apply(int id, int64 delta){
    st[id].a += delta;
    st[id].b -= 2 * delta;
    st[id].c += delta;
    st[id].ab -= delta;
    st[id].bc -= delta;
    lzy[id] += delta;
}

void pushDown(int id){
    if(lzy[id] != 0){
        apply(id << 1, lzy[id]);
        apply(id << 1 | 1, lzy[id]);
        lzy[id] = 0;
    }
}

void update(int id, int l, int r, int u, int v, int64 delta){
    if(u <= l and r <= v){
        apply(id, delta);
    }
    else{
        int mid = l + r >> 1;
        pushDown(id);
        if(u <= mid) update(id << 1, l, mid, u, v, delta);
        if(mid < v) update(id << 1 | 1, mid + 1, r, u, v, delta);
        st[id] = combine(st[id << 1], st[id << 1 | 1]);
    }
}

void preDFS(int u, int pre){
    tin[u] = tout[u] = ++timer_dfs;
    for(int id : adj[u]) if(id != pre){
        int v = eu[id] ^ ev[id] ^ u;
        preDFS(v, id);
        tout[u] = ++timer_dfs;
    }
}

void init(){
    cin >> N >> Q >> W;
    REP(i, N - 1){
        cin >> eu[i] >> ev[i] >> ew[i];
        adj[eu[i]].pb(i);
        adj[ev[i]].pb(i);
    }
}

void process(){
    preDFS(1, -1);
    build(1, 1, timer_dfs);
    REP(i, N - 1){
        if(tin[eu[i]] > tin[ev[i]]){
            swap(eu[i], ev[i]);
        }
        update(1, 1, timer_dfs, tin[ev[i]], tout[ev[i]], ew[i]);
    }

    int64 last = 0;
    while(Q--){
        int i; int64 w;
        cin >> i >> w;
        i = (last + i) % (N - 1);
        w = (last + w) % W;
        update(1, 1, timer_dfs, tin[ev[i]], tout[ev[i]], w - ew[i]);
        ew[i] = w;
        last = st[1].abc;
        cout << last << '\n';
    }
}

Compilation message

diameter.cpp: In function 'void build(int, int, int)':
diameter.cpp:111:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  111 |         int mid = l + r >> 1;
      |                   ~~^~~
diameter.cpp: In function 'void update(int, int, int, int, int, int64)':
diameter.cpp:139:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  139 |         int mid = l + r >> 1;
      |                   ~~^~~
diameter.cpp: In function 'int main()':
diameter.cpp:60:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:61:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 43356 KB Output is correct
2 Correct 7 ms 43508 KB Output is correct
3 Correct 8 ms 43356 KB Output is correct
4 Correct 7 ms 43356 KB Output is correct
5 Correct 7 ms 43472 KB Output is correct
6 Correct 7 ms 43352 KB Output is correct
7 Correct 7 ms 43356 KB Output is correct
8 Correct 7 ms 43356 KB Output is correct
9 Correct 7 ms 43352 KB Output is correct
10 Correct 7 ms 43356 KB Output is correct
11 Correct 7 ms 43356 KB Output is correct
12 Correct 7 ms 43452 KB Output is correct
13 Correct 7 ms 43356 KB Output is correct
14 Correct 8 ms 43476 KB Output is correct
15 Correct 8 ms 43352 KB Output is correct
16 Correct 7 ms 43356 KB Output is correct
17 Correct 7 ms 43356 KB Output is correct
18 Correct 7 ms 43356 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 43356 KB Output is correct
2 Correct 7 ms 43508 KB Output is correct
3 Correct 8 ms 43356 KB Output is correct
4 Correct 7 ms 43356 KB Output is correct
5 Correct 7 ms 43472 KB Output is correct
6 Correct 7 ms 43352 KB Output is correct
7 Correct 7 ms 43356 KB Output is correct
8 Correct 7 ms 43356 KB Output is correct
9 Correct 7 ms 43352 KB Output is correct
10 Correct 7 ms 43356 KB Output is correct
11 Correct 7 ms 43356 KB Output is correct
12 Correct 7 ms 43452 KB Output is correct
13 Correct 7 ms 43356 KB Output is correct
14 Correct 8 ms 43476 KB Output is correct
15 Correct 8 ms 43352 KB Output is correct
16 Correct 7 ms 43356 KB Output is correct
17 Correct 7 ms 43356 KB Output is correct
18 Correct 7 ms 43356 KB Output is correct
19 Correct 12 ms 43608 KB Output is correct
20 Correct 11 ms 43464 KB Output is correct
21 Correct 10 ms 43612 KB Output is correct
22 Correct 12 ms 43868 KB Output is correct
23 Correct 13 ms 45792 KB Output is correct
24 Correct 14 ms 45916 KB Output is correct
25 Correct 15 ms 45916 KB Output is correct
26 Correct 17 ms 46336 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 43356 KB Output is correct
2 Correct 7 ms 43564 KB Output is correct
3 Correct 8 ms 43508 KB Output is correct
4 Correct 12 ms 43604 KB Output is correct
5 Correct 41 ms 43760 KB Output is correct
6 Correct 7 ms 43356 KB Output is correct
7 Correct 8 ms 43356 KB Output is correct
8 Correct 7 ms 43508 KB Output is correct
9 Correct 7 ms 43612 KB Output is correct
10 Correct 14 ms 43612 KB Output is correct
11 Correct 42 ms 43868 KB Output is correct
12 Correct 9 ms 45916 KB Output is correct
13 Correct 9 ms 45916 KB Output is correct
14 Correct 11 ms 45916 KB Output is correct
15 Correct 18 ms 46036 KB Output is correct
16 Correct 53 ms 46420 KB Output is correct
17 Correct 51 ms 51236 KB Output is correct
18 Correct 51 ms 51376 KB Output is correct
19 Correct 53 ms 51400 KB Output is correct
20 Correct 67 ms 51404 KB Output is correct
21 Correct 164 ms 51948 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 43612 KB Output is correct
2 Correct 14 ms 43612 KB Output is correct
3 Correct 34 ms 43796 KB Output is correct
4 Correct 59 ms 44112 KB Output is correct
5 Correct 14 ms 46172 KB Output is correct
6 Correct 20 ms 46128 KB Output is correct
7 Correct 50 ms 46376 KB Output is correct
8 Correct 79 ms 46680 KB Output is correct
9 Correct 50 ms 47488 KB Output is correct
10 Correct 46 ms 47732 KB Output is correct
11 Correct 77 ms 47988 KB Output is correct
12 Correct 116 ms 48272 KB Output is correct
13 Correct 73 ms 51960 KB Output is correct
14 Correct 77 ms 52052 KB Output is correct
15 Correct 118 ms 52196 KB Output is correct
16 Correct 159 ms 52564 KB Output is correct
17 Correct 177 ms 52684 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 57800 KB Output is correct
2 Correct 231 ms 58052 KB Output is correct
3 Correct 209 ms 57824 KB Output is correct
4 Correct 226 ms 57680 KB Output is correct
5 Correct 213 ms 57600 KB Output is correct
6 Correct 225 ms 57552 KB Output is correct
7 Correct 231 ms 59924 KB Output is correct
8 Correct 273 ms 60044 KB Output is correct
9 Correct 236 ms 60116 KB Output is correct
10 Correct 221 ms 60140 KB Output is correct
11 Correct 221 ms 59884 KB Output is correct
12 Correct 208 ms 59060 KB Output is correct
13 Correct 324 ms 63712 KB Output is correct
14 Correct 301 ms 63764 KB Output is correct
15 Correct 262 ms 63812 KB Output is correct
16 Correct 282 ms 63924 KB Output is correct
17 Correct 255 ms 63316 KB Output is correct
18 Correct 207 ms 60620 KB Output is correct
19 Correct 259 ms 63880 KB Output is correct
20 Correct 282 ms 63884 KB Output is correct
21 Correct 266 ms 63788 KB Output is correct
22 Correct 303 ms 63916 KB Output is correct
23 Correct 253 ms 63312 KB Output is correct
24 Correct 232 ms 60612 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 43356 KB Output is correct
2 Correct 7 ms 43508 KB Output is correct
3 Correct 8 ms 43356 KB Output is correct
4 Correct 7 ms 43356 KB Output is correct
5 Correct 7 ms 43472 KB Output is correct
6 Correct 7 ms 43352 KB Output is correct
7 Correct 7 ms 43356 KB Output is correct
8 Correct 7 ms 43356 KB Output is correct
9 Correct 7 ms 43352 KB Output is correct
10 Correct 7 ms 43356 KB Output is correct
11 Correct 7 ms 43356 KB Output is correct
12 Correct 7 ms 43452 KB Output is correct
13 Correct 7 ms 43356 KB Output is correct
14 Correct 8 ms 43476 KB Output is correct
15 Correct 8 ms 43352 KB Output is correct
16 Correct 7 ms 43356 KB Output is correct
17 Correct 7 ms 43356 KB Output is correct
18 Correct 7 ms 43356 KB Output is correct
19 Correct 12 ms 43608 KB Output is correct
20 Correct 11 ms 43464 KB Output is correct
21 Correct 10 ms 43612 KB Output is correct
22 Correct 12 ms 43868 KB Output is correct
23 Correct 13 ms 45792 KB Output is correct
24 Correct 14 ms 45916 KB Output is correct
25 Correct 15 ms 45916 KB Output is correct
26 Correct 17 ms 46336 KB Output is correct
27 Correct 7 ms 43356 KB Output is correct
28 Correct 7 ms 43564 KB Output is correct
29 Correct 8 ms 43508 KB Output is correct
30 Correct 12 ms 43604 KB Output is correct
31 Correct 41 ms 43760 KB Output is correct
32 Correct 7 ms 43356 KB Output is correct
33 Correct 8 ms 43356 KB Output is correct
34 Correct 7 ms 43508 KB Output is correct
35 Correct 7 ms 43612 KB Output is correct
36 Correct 14 ms 43612 KB Output is correct
37 Correct 42 ms 43868 KB Output is correct
38 Correct 9 ms 45916 KB Output is correct
39 Correct 9 ms 45916 KB Output is correct
40 Correct 11 ms 45916 KB Output is correct
41 Correct 18 ms 46036 KB Output is correct
42 Correct 53 ms 46420 KB Output is correct
43 Correct 51 ms 51236 KB Output is correct
44 Correct 51 ms 51376 KB Output is correct
45 Correct 53 ms 51400 KB Output is correct
46 Correct 67 ms 51404 KB Output is correct
47 Correct 164 ms 51948 KB Output is correct
48 Correct 8 ms 43612 KB Output is correct
49 Correct 14 ms 43612 KB Output is correct
50 Correct 34 ms 43796 KB Output is correct
51 Correct 59 ms 44112 KB Output is correct
52 Correct 14 ms 46172 KB Output is correct
53 Correct 20 ms 46128 KB Output is correct
54 Correct 50 ms 46376 KB Output is correct
55 Correct 79 ms 46680 KB Output is correct
56 Correct 50 ms 47488 KB Output is correct
57 Correct 46 ms 47732 KB Output is correct
58 Correct 77 ms 47988 KB Output is correct
59 Correct 116 ms 48272 KB Output is correct
60 Correct 73 ms 51960 KB Output is correct
61 Correct 77 ms 52052 KB Output is correct
62 Correct 118 ms 52196 KB Output is correct
63 Correct 159 ms 52564 KB Output is correct
64 Correct 177 ms 52684 KB Output is correct
65 Correct 205 ms 57800 KB Output is correct
66 Correct 231 ms 58052 KB Output is correct
67 Correct 209 ms 57824 KB Output is correct
68 Correct 226 ms 57680 KB Output is correct
69 Correct 213 ms 57600 KB Output is correct
70 Correct 225 ms 57552 KB Output is correct
71 Correct 231 ms 59924 KB Output is correct
72 Correct 273 ms 60044 KB Output is correct
73 Correct 236 ms 60116 KB Output is correct
74 Correct 221 ms 60140 KB Output is correct
75 Correct 221 ms 59884 KB Output is correct
76 Correct 208 ms 59060 KB Output is correct
77 Correct 324 ms 63712 KB Output is correct
78 Correct 301 ms 63764 KB Output is correct
79 Correct 262 ms 63812 KB Output is correct
80 Correct 282 ms 63924 KB Output is correct
81 Correct 255 ms 63316 KB Output is correct
82 Correct 207 ms 60620 KB Output is correct
83 Correct 259 ms 63880 KB Output is correct
84 Correct 282 ms 63884 KB Output is correct
85 Correct 266 ms 63788 KB Output is correct
86 Correct 303 ms 63916 KB Output is correct
87 Correct 253 ms 63312 KB Output is correct
88 Correct 232 ms 60612 KB Output is correct
89 Correct 263 ms 56660 KB Output is correct
90 Correct 213 ms 57368 KB Output is correct
91 Correct 217 ms 58252 KB Output is correct
92 Correct 220 ms 58208 KB Output is correct
93 Correct 236 ms 60324 KB Output is correct
94 Correct 265 ms 59756 KB Output is correct
95 Correct 286 ms 61264 KB Output is correct
96 Correct 263 ms 60192 KB Output is correct
97 Correct 269 ms 61184 KB Output is correct
98 Correct 254 ms 63092 KB Output is correct
99 Correct 247 ms 61012 KB Output is correct
100 Correct 265 ms 60804 KB Output is correct