oj.uz

Submission #940682

# Submission time Handle Problem Language Result Execution time Memory
940682 2024-03-07T13:12:20 Z Zero_OP Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 174 ms 164688 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 = 2e5 + 5;

int N, Q, W, timer_dfs, tin[MAX], tout[MAX], eu[MAX], ev[MAX]; int64 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

# Verdict Execution time Memory Grader output
1 Correct 20 ms 80464 KB Output is correct
2 Correct 20 ms 80476 KB Output is correct
3 Correct 19 ms 80476 KB Output is correct
4 Correct 21 ms 80308 KB Output is correct
5 Correct 21 ms 80472 KB Output is correct
6 Correct 20 ms 80476 KB Output is correct
7 Correct 21 ms 80468 KB Output is correct
8 Correct 19 ms 80472 KB Output is correct
9 Correct 20 ms 80476 KB Output is correct
10 Correct 20 ms 80380 KB Output is correct
11 Correct 20 ms 80476 KB Output is correct
12 Correct 19 ms 80272 KB Output is correct
13 Correct 20 ms 80476 KB Output is correct
14 Correct 20 ms 80376 KB Output is correct
15 Correct 19 ms 80472 KB Output is correct
16 Correct 19 ms 80476 KB Output is correct
17 Correct 20 ms 80476 KB Output is correct
18 Correct 20 ms 80356 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 80464 KB Output is correct
2 Correct 20 ms 80476 KB Output is correct
3 Correct 19 ms 80476 KB Output is correct
4 Correct 21 ms 80308 KB Output is correct
5 Correct 21 ms 80472 KB Output is correct
6 Correct 20 ms 80476 KB Output is correct
7 Correct 21 ms 80468 KB Output is correct
8 Correct 19 ms 80472 KB Output is correct
9 Correct 20 ms 80476 KB Output is correct
10 Correct 20 ms 80380 KB Output is correct
11 Correct 20 ms 80476 KB Output is correct
12 Correct 19 ms 80272 KB Output is correct
13 Correct 20 ms 80476 KB Output is correct
14 Correct 20 ms 80376 KB Output is correct
15 Correct 19 ms 80472 KB Output is correct
16 Correct 19 ms 80476 KB Output is correct
17 Correct 20 ms 80476 KB Output is correct
18 Correct 20 ms 80356 KB Output is correct
19 Correct 22 ms 80476 KB Output is correct
20 Correct 24 ms 80600 KB Output is correct
21 Correct 23 ms 80376 KB Output is correct
22 Correct 23 ms 80476 KB Output is correct
23 Correct 26 ms 80984 KB Output is correct
24 Correct 26 ms 80980 KB Output is correct
25 Correct 26 ms 80988 KB Output is correct
26 Correct 27 ms 81240 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 80476 KB Output is correct
2 Correct 20 ms 80476 KB Output is correct
3 Correct 19 ms 80316 KB Output is correct
4 Correct 26 ms 80476 KB Output is correct
5 Correct 47 ms 80692 KB Output is correct
6 Correct 20 ms 80476 KB Output is correct
7 Correct 21 ms 80476 KB Output is correct
8 Correct 23 ms 80476 KB Output is correct
9 Correct 20 ms 80472 KB Output is correct
10 Correct 27 ms 80524 KB Output is correct
11 Correct 54 ms 80840 KB Output is correct
12 Correct 22 ms 80860 KB Output is correct
13 Correct 23 ms 80828 KB Output is correct
14 Correct 22 ms 80732 KB Output is correct
15 Correct 30 ms 80988 KB Output is correct
16 Correct 64 ms 81320 KB Output is correct
17 Correct 66 ms 89288 KB Output is correct
18 Correct 65 ms 89240 KB Output is correct
19 Correct 66 ms 89292 KB Output is correct
20 Correct 79 ms 89288 KB Output is correct
21 Correct 148 ms 89804 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 80476 KB Output is correct
2 Correct 26 ms 80648 KB Output is correct
3 Correct 48 ms 80724 KB Output is correct
4 Correct 73 ms 81124 KB Output is correct
5 Correct 26 ms 81496 KB Output is correct
6 Correct 31 ms 81524 KB Output is correct
7 Correct 60 ms 81748 KB Output is correct
8 Correct 93 ms 82000 KB Output is correct
9 Correct 50 ms 84948 KB Output is correct
10 Correct 59 ms 85132 KB Output is correct
11 Correct 89 ms 85328 KB Output is correct
12 Correct 131 ms 85708 KB Output is correct
13 Correct 85 ms 89776 KB Output is correct
14 Correct 91 ms 89940 KB Output is correct
15 Correct 133 ms 90192 KB Output is correct
16 Correct 174 ms 90292 KB Output is correct
17 Correct 160 ms 90448 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 86 ms 164688 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 80464 KB Output is correct
2 Correct 20 ms 80476 KB Output is correct
3 Correct 19 ms 80476 KB Output is correct
4 Correct 21 ms 80308 KB Output is correct
5 Correct 21 ms 80472 KB Output is correct
6 Correct 20 ms 80476 KB Output is correct
7 Correct 21 ms 80468 KB Output is correct
8 Correct 19 ms 80472 KB Output is correct
9 Correct 20 ms 80476 KB Output is correct
10 Correct 20 ms 80380 KB Output is correct
11 Correct 20 ms 80476 KB Output is correct
12 Correct 19 ms 80272 KB Output is correct
13 Correct 20 ms 80476 KB Output is correct
14 Correct 20 ms 80376 KB Output is correct
15 Correct 19 ms 80472 KB Output is correct
16 Correct 19 ms 80476 KB Output is correct
17 Correct 20 ms 80476 KB Output is correct
18 Correct 20 ms 80356 KB Output is correct
19 Correct 22 ms 80476 KB Output is correct
20 Correct 24 ms 80600 KB Output is correct
21 Correct 23 ms 80376 KB Output is correct
22 Correct 23 ms 80476 KB Output is correct
23 Correct 26 ms 80984 KB Output is correct
24 Correct 26 ms 80980 KB Output is correct
25 Correct 26 ms 80988 KB Output is correct
26 Correct 27 ms 81240 KB Output is correct
27 Correct 19 ms 80476 KB Output is correct
28 Correct 20 ms 80476 KB Output is correct
29 Correct 19 ms 80316 KB Output is correct
30 Correct 26 ms 80476 KB Output is correct
31 Correct 47 ms 80692 KB Output is correct
32 Correct 20 ms 80476 KB Output is correct
33 Correct 21 ms 80476 KB Output is correct
34 Correct 23 ms 80476 KB Output is correct
35 Correct 20 ms 80472 KB Output is correct
36 Correct 27 ms 80524 KB Output is correct
37 Correct 54 ms 80840 KB Output is correct
38 Correct 22 ms 80860 KB Output is correct
39 Correct 23 ms 80828 KB Output is correct
40 Correct 22 ms 80732 KB Output is correct
41 Correct 30 ms 80988 KB Output is correct
42 Correct 64 ms 81320 KB Output is correct
43 Correct 66 ms 89288 KB Output is correct
44 Correct 65 ms 89240 KB Output is correct
45 Correct 66 ms 89292 KB Output is correct
46 Correct 79 ms 89288 KB Output is correct
47 Correct 148 ms 89804 KB Output is correct
48 Correct 21 ms 80476 KB Output is correct
49 Correct 26 ms 80648 KB Output is correct
50 Correct 48 ms 80724 KB Output is correct
51 Correct 73 ms 81124 KB Output is correct
52 Correct 26 ms 81496 KB Output is correct
53 Correct 31 ms 81524 KB Output is correct
54 Correct 60 ms 81748 KB Output is correct
55 Correct 93 ms 82000 KB Output is correct
56 Correct 50 ms 84948 KB Output is correct
57 Correct 59 ms 85132 KB Output is correct
58 Correct 89 ms 85328 KB Output is correct
59 Correct 131 ms 85708 KB Output is correct
60 Correct 85 ms 89776 KB Output is correct
61 Correct 91 ms 89940 KB Output is correct
62 Correct 133 ms 90192 KB Output is correct
63 Correct 174 ms 90292 KB Output is correct
64 Correct 160 ms 90448 KB Output is correct
65 Runtime error 86 ms 164688 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -