oj.uz

Submission #239990

# Submission time Handle Problem Language Result Execution time Memory
239990 2020-06-17T16:29:08 Z karma Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 334448 KB 
#include <bits/stdc++.h>
#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
#define int         int64_t

using namespace std;

const int N = (int)1e5 + 2;
const ll inf = 1ll << 60;
typedef pair<int, int> pii;

struct TTree { /// get max value in range, add x in a range
    vector<pair<ll, int>> st;
    vector<ll> lz;
    vector<int> l, h;
    vector<pii> range;
    int n; ll val;
    pair<ll, int> top;
    void init(int _n) {
        n = _n;
        l.resize(4 * n + 4);
        h.resize(l.size());
        st.resize(l.size());
        lz.resize(l.size());
        build(1, 0, n - 1);
    }
    void build(int x, int low, int high) {
        l[x] = low, h[x] = high;
        if(l[x] == h[x]) {
            st[x].se = l[x];
            return;
        }
        int mid = (low + high) >> 1;
        build(x << 1, low, mid);
        build(x << 1 | 1, mid + 1, high);
    }
    void down(int x) {
        if(lz[x] == 0 || l[x] == h[x]) return;
        st[x << 1].fi += lz[x], lz[x << 1] += lz[x];
        st[x << 1 | 1].fi += lz[x], lz[x << 1 | 1] += lz[x];
        lz[x] = 0;
    }
    inline pii Max(const pii& x, const pii& y) {
        if(x.fi > y.fi) return x;
        if(x.fi < y.fi) return y;
        return x;
    }
    void upd(int x, int low, int high, ll val) {
        down(x);
        if(l[x] > high || h[x] < low) return;
        if(low <= l[x] && h[x] <= high) {
            st[x].fi += val, lz[x] += val;
            return;
        }
        upd(x << 1, low, high, val);
        upd(x << 1 | 1, low, high, val);
        st[x] = Max(st[x << 1], st[x << 1 | 1]);
    }
    pair<ll, int> get(int x, int low, int high) {
        down(x);
        if(l[x] > high || h[x] < low) return mp(-inf, 0);
        if(l[x] >= low && h[x] <= high) return st[x];
        return Max(get(x << 1, low, high), get(x << 1 | 1, low, high));
    }
    void update(int l, int h, ll v) {upd(1, l, h, v);}
    pair<ll, int> query(int l, int h) {return get(1, l, h);}
    ll diameter() {
        top = query(0, n - 1);
        val = top.fi;
        update(range[top.se].fi, range[top.se].se, -top.fi);
        val += max((ll)query(0, n - 1).fi, 0ll);
        update(range[top.se].fi, range[top.se].se, top.fi);
        return val;
    }
};
vector<TTree> it;

struct TEdge {
    int u, v; ll w;
    vector<int> it;
    vector<pii> range;
} e[N];
vector<pii> adj[N];
ll W, dis[N];
int n, q, Time, head[N], in[N], out[N], sz[N], big[N];
bool del[N];

int find(int u) {
    function<void(int, int)> dfs = [&](int u, int p) {
        sz[u] = 1, big[u] = 0;
        for(auto v: adj[u]) {
            if(v.fi == p || del[v.fi]) continue;
            dfs(v.fi, u);
            sz[u] += sz[v.fi];
            if(sz[v.fi] > sz[big[u]]) big[u] = v.fi;
        }
    };
    dfs(u, -1);
    int cen = u;
    while(sz[big[cen]] * 2 >= sz[u] && big[cen]) cen = big[cen];
    return cen;
}

multiset<ll, greater<ll>> ans;
void centroid(int u) {
    int root = find(u);
    it.push_back({});
    function<void(int, int)> dfs = [&](int u, int p) {
        in[u] = ++Time;
        if(p == root) head[u] = u;
        else if(p != -1) head[u] = head[p];
        for(auto v: adj[u]) {
            if(del[v.fi] || v.fi == p) continue;
            dis[v.fi] = dis[u] + e[v.se].w;
            it.back().range.pb(v.se, v.fi);
            dfs(v.fi, u);
        }
        out[u] = Time;
    };
    Time = -2, dis[root] = 0;
    dfs(root, -1); del[root] = 1;
    if((int)it.back().range.size()) {
        it.back().init((int)it.back().range.size());
        for(auto& p: it.back().range) {
            e[p.fi].it.pb((int)it.size() - 1);
            e[p.fi].range.pb(in[p.se], out[p.se]);
            it.back().update(in[p.se], in[p.se], dis[p.se]);
            p.fi = in[head[p.se]], p.se = out[head[p.se]];
        }
        ans.insert(it.back().diameter());
    }
    for(auto v: adj[root]) {
        if(del[v.fi]) continue;
        centroid(v.fi);
    }
}

///40071305542068

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> q >> W;
    for(int i = 0; i < n - 1; ++i) {
        cin >> e[i].u >> e[i].v >> e[i].w;
        adj[e[i].u].pb(e[i].v, i);
        adj[e[i].v].pb(e[i].u, i);
    }
    centroid(1); ll w, lst = 0;
    for(int id, tree; q > 0; --q) {
        cin >> id >> w;
        id = (id + lst) % (n - 1);
        w = (w + lst) % W;
        for(int i = 0; i < e[id].it.size(); ++i) {
            tree = e[id].it[i];
            ans.erase(ans.find(it[tree].diameter()));
            it[tree].update((int)e[id].range[i].fi, (int)e[id].range[i].se, w - e[id].w);
            ans.insert(it[tree].diameter());
        }
        e[id].w = w;
        cout << (lst = *ans.begin()) << '\n';
    }
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:162:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < e[id].it.size(); ++i) {
                        ~~^~~~~~~~~~~~~~~~~
diameter.cpp:148:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:149:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp: In function 'void centroid(int64_t)':
diameter.cpp:113:29: warning: array subscript is below array bounds [-Warray-bounds]
         if(p == root) head[u] = u;
                       ~~~~~~^

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 12 ms 9728 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 9856 KB Output is correct
8 Correct 10 ms 9856 KB Output is correct
9 Correct 11 ms 9856 KB Output is correct
10 Correct 10 ms 9856 KB Output is correct
11 Correct 11 ms 9856 KB Output is correct
12 Correct 10 ms 9856 KB Output is correct
13 Correct 10 ms 9856 KB Output is correct
14 Correct 10 ms 9856 KB Output is correct
15 Correct 11 ms 9856 KB Output is correct
16 Correct 10 ms 9856 KB Output is correct
17 Correct 11 ms 9856 KB Output is correct
18 Correct 10 ms 9856 KB Output is correct
19 Correct 42 ms 11256 KB Output is correct
20 Correct 44 ms 11392 KB Output is correct
21 Correct 50 ms 11520 KB Output is correct
22 Correct 36 ms 11904 KB Output is correct
23 Correct 79 ms 17868 KB Output is correct
24 Correct 93 ms 20164 KB Output is correct
25 Correct 123 ms 21444 KB Output is correct
26 Correct 86 ms 23648 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 9 ms 9856 KB Output is correct
3 Correct 11 ms 9856 KB Output is correct
4 Correct 24 ms 9984 KB Output is correct
5 Correct 81 ms 10232 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 10112 KB Output is correct
8 Correct 11 ms 10112 KB Output is correct
9 Correct 13 ms 10112 KB Output is correct
10 Correct 32 ms 10112 KB Output is correct
11 Correct 117 ms 10616 KB Output is correct
12 Correct 16 ms 12824 KB Output is correct
13 Correct 15 ms 12824 KB Output is correct
14 Correct 19 ms 12824 KB Output is correct
15 Correct 42 ms 12824 KB Output is correct
16 Correct 150 ms 12972 KB Output is correct
17 Correct 113 ms 63512 KB Output is correct
18 Correct 120 ms 63512 KB Output is correct
19 Correct 128 ms 63380 KB Output is correct
20 Correct 156 ms 63380 KB Output is correct
21 Correct 312 ms 63384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 11648 KB Output is correct
2 Correct 54 ms 11648 KB Output is correct
3 Correct 196 ms 11900 KB Output is correct
4 Correct 388 ms 12280 KB Output is correct
5 Correct 65 ms 35584 KB Output is correct
6 Correct 137 ms 35760 KB Output is correct
7 Correct 448 ms 36096 KB Output is correct
8 Correct 827 ms 36480 KB Output is correct
9 Correct 338 ms 159916 KB Output is correct
10 Correct 435 ms 160048 KB Output is correct
11 Correct 961 ms 160552 KB Output is correct
12 Correct 1588 ms 160816 KB Output is correct
13 Correct 655 ms 327516 KB Output is correct
14 Correct 870 ms 328052 KB Output is correct
15 Correct 1547 ms 328196 KB Output is correct
16 Correct 2335 ms 328656 KB Output is correct
17 Correct 3618 ms 328660 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4137 ms 259344 KB Output is correct
2 Correct 4329 ms 271036 KB Output is correct
3 Correct 4312 ms 268808 KB Output is correct
4 Correct 4565 ms 270860 KB Output is correct
5 Correct 4503 ms 254732 KB Output is correct
6 Correct 3803 ms 181512 KB Output is correct
7 Execution timed out 5081 ms 334448 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 12 ms 9728 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 9856 KB Output is correct
8 Correct 10 ms 9856 KB Output is correct
9 Correct 11 ms 9856 KB Output is correct
10 Correct 10 ms 9856 KB Output is correct
11 Correct 11 ms 9856 KB Output is correct
12 Correct 10 ms 9856 KB Output is correct
13 Correct 10 ms 9856 KB Output is correct
14 Correct 10 ms 9856 KB Output is correct
15 Correct 11 ms 9856 KB Output is correct
16 Correct 10 ms 9856 KB Output is correct
17 Correct 11 ms 9856 KB Output is correct
18 Correct 10 ms 9856 KB Output is correct
19 Correct 42 ms 11256 KB Output is correct
20 Correct 44 ms 11392 KB Output is correct
21 Correct 50 ms 11520 KB Output is correct
22 Correct 36 ms 11904 KB Output is correct
23 Correct 79 ms 17868 KB Output is correct
24 Correct 93 ms 20164 KB Output is correct
25 Correct 123 ms 21444 KB Output is correct
26 Correct 86 ms 23648 KB Output is correct
27 Correct 10 ms 9728 KB Output is correct
28 Correct 9 ms 9856 KB Output is correct
29 Correct 11 ms 9856 KB Output is correct
30 Correct 24 ms 9984 KB Output is correct
31 Correct 81 ms 10232 KB Output is correct
32 Correct 10 ms 9728 KB Output is correct
33 Correct 10 ms 10112 KB Output is correct
34 Correct 11 ms 10112 KB Output is correct
35 Correct 13 ms 10112 KB Output is correct
36 Correct 32 ms 10112 KB Output is correct
37 Correct 117 ms 10616 KB Output is correct
38 Correct 16 ms 12824 KB Output is correct
39 Correct 15 ms 12824 KB Output is correct
40 Correct 19 ms 12824 KB Output is correct
41 Correct 42 ms 12824 KB Output is correct
42 Correct 150 ms 12972 KB Output is correct
43 Correct 113 ms 63512 KB Output is correct
44 Correct 120 ms 63512 KB Output is correct
45 Correct 128 ms 63380 KB Output is correct
46 Correct 156 ms 63380 KB Output is correct
47 Correct 312 ms 63384 KB Output is correct
48 Correct 17 ms 11648 KB Output is correct
49 Correct 54 ms 11648 KB Output is correct
50 Correct 196 ms 11900 KB Output is correct
51 Correct 388 ms 12280 KB Output is correct
52 Correct 65 ms 35584 KB Output is correct
53 Correct 137 ms 35760 KB Output is correct
54 Correct 448 ms 36096 KB Output is correct
55 Correct 827 ms 36480 KB Output is correct
56 Correct 338 ms 159916 KB Output is correct
57 Correct 435 ms 160048 KB Output is correct
58 Correct 961 ms 160552 KB Output is correct
59 Correct 1588 ms 160816 KB Output is correct
60 Correct 655 ms 327516 KB Output is correct
61 Correct 870 ms 328052 KB Output is correct
62 Correct 1547 ms 328196 KB Output is correct
63 Correct 2335 ms 328656 KB Output is correct
64 Correct 3618 ms 328660 KB Output is correct
65 Correct 4137 ms 259344 KB Output is correct
66 Correct 4329 ms 271036 KB Output is correct
67 Correct 4312 ms 268808 KB Output is correct
68 Correct 4565 ms 270860 KB Output is correct
69 Correct 4503 ms 254732 KB Output is correct
70 Correct 3803 ms 181512 KB Output is correct
71 Execution timed out 5081 ms 334448 KB Time limit exceeded
72 Halted 0 ms 0 KB -