oj.uz

Submission #239999

# Submission time Handle Problem Language Result Execution time Memory
239999 2020-06-17T16:48:41 Z karma Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 251400 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 pair<ll, int> Max(const pair<ll, int>& x, const pair<ll, int>& 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));
    }
    ll diameter() {
        top = st[1]; val = st[1].fi;
        upd(1, range[top.se].fi, range[top.se].se, -top.fi);
        val += max(st[1].fi, 0ll);
        upd(1, 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().upd(1, 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 = ((ll)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].upd(1, (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:159:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < e[id].it.size(); ++i) {
                        ~~^~~~~~~~~~~~~~~~~
diameter.cpp:145: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:146: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(int)':
diameter.cpp:110: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 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 9 ms 8960 KB Output is correct
4 Correct 9 ms 8960 KB Output is correct
5 Correct 10 ms 8992 KB Output is correct
6 Correct 9 ms 8960 KB Output is correct
7 Correct 10 ms 8960 KB Output is correct
8 Correct 10 ms 9088 KB Output is correct
9 Correct 11 ms 8960 KB Output is correct
10 Correct 10 ms 8960 KB Output is correct
11 Correct 10 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 10 ms 9088 KB Output is correct
14 Correct 10 ms 9088 KB Output is correct
15 Correct 11 ms 9088 KB Output is correct
16 Correct 10 ms 9088 KB Output is correct
17 Correct 11 ms 9088 KB Output is correct
18 Correct 10 ms 9088 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 9 ms 8960 KB Output is correct
4 Correct 9 ms 8960 KB Output is correct
5 Correct 10 ms 8992 KB Output is correct
6 Correct 9 ms 8960 KB Output is correct
7 Correct 10 ms 8960 KB Output is correct
8 Correct 10 ms 9088 KB Output is correct
9 Correct 11 ms 8960 KB Output is correct
10 Correct 10 ms 8960 KB Output is correct
11 Correct 10 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 10 ms 9088 KB Output is correct
14 Correct 10 ms 9088 KB Output is correct
15 Correct 11 ms 9088 KB Output is correct
16 Correct 10 ms 9088 KB Output is correct
17 Correct 11 ms 9088 KB Output is correct
18 Correct 10 ms 9088 KB Output is correct
19 Correct 46 ms 10232 KB Output is correct
20 Correct 44 ms 10240 KB Output is correct
21 Correct 50 ms 10496 KB Output is correct
22 Correct 35 ms 10744 KB Output is correct
23 Correct 80 ms 15308 KB Output is correct
24 Correct 97 ms 17092 KB Output is correct
25 Correct 104 ms 17988 KB Output is correct
26 Correct 83 ms 19604 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8960 KB Output is correct
2 Correct 11 ms 9088 KB Output is correct
3 Correct 11 ms 8960 KB Output is correct
4 Correct 25 ms 9216 KB Output is correct
5 Correct 89 ms 9720 KB Output is correct
6 Correct 9 ms 8960 KB Output is correct
7 Correct 10 ms 9216 KB Output is correct
8 Correct 11 ms 9216 KB Output is correct
9 Correct 14 ms 9344 KB Output is correct
10 Correct 35 ms 9472 KB Output is correct
11 Correct 125 ms 9976 KB Output is correct
12 Correct 16 ms 11672 KB Output is correct
13 Correct 16 ms 11800 KB Output is correct
14 Correct 18 ms 11800 KB Output is correct
15 Correct 48 ms 11800 KB Output is correct
16 Correct 156 ms 12076 KB Output is correct
17 Correct 115 ms 55584 KB Output is correct
18 Correct 117 ms 55604 KB Output is correct
19 Correct 122 ms 55604 KB Output is correct
20 Correct 154 ms 55612 KB Output is correct
21 Correct 335 ms 55612 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 10368 KB Output is correct
2 Correct 55 ms 10624 KB Output is correct
3 Correct 205 ms 10872 KB Output is correct
4 Correct 389 ms 11256 KB Output is correct
5 Correct 61 ms 28544 KB Output is correct
6 Correct 143 ms 28672 KB Output is correct
7 Correct 453 ms 29056 KB Output is correct
8 Correct 810 ms 29528 KB Output is correct
9 Correct 304 ms 122364 KB Output is correct
10 Correct 411 ms 122368 KB Output is correct
11 Correct 1024 ms 122772 KB Output is correct
12 Correct 1753 ms 123132 KB Output is correct
13 Correct 638 ms 248852 KB Output is correct
14 Correct 751 ms 248596 KB Output is correct
15 Correct 1389 ms 248884 KB Output is correct
16 Correct 2360 ms 249240 KB Output is correct
17 Correct 3493 ms 249536 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4238 ms 196660 KB Output is correct
2 Correct 4275 ms 202724 KB Output is correct
3 Correct 4205 ms 200928 KB Output is correct
4 Correct 4549 ms 202516 KB Output is correct
5 Correct 4207 ms 190424 KB Output is correct
6 Correct 3419 ms 136684 KB Output is correct
7 Execution timed out 5082 ms 251400 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 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 9 ms 8960 KB Output is correct
4 Correct 9 ms 8960 KB Output is correct
5 Correct 10 ms 8992 KB Output is correct
6 Correct 9 ms 8960 KB Output is correct
7 Correct 10 ms 8960 KB Output is correct
8 Correct 10 ms 9088 KB Output is correct
9 Correct 11 ms 8960 KB Output is correct
10 Correct 10 ms 8960 KB Output is correct
11 Correct 10 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 10 ms 9088 KB Output is correct
14 Correct 10 ms 9088 KB Output is correct
15 Correct 11 ms 9088 KB Output is correct
16 Correct 10 ms 9088 KB Output is correct
17 Correct 11 ms 9088 KB Output is correct
18 Correct 10 ms 9088 KB Output is correct
19 Correct 46 ms 10232 KB Output is correct
20 Correct 44 ms 10240 KB Output is correct
21 Correct 50 ms 10496 KB Output is correct
22 Correct 35 ms 10744 KB Output is correct
23 Correct 80 ms 15308 KB Output is correct
24 Correct 97 ms 17092 KB Output is correct
25 Correct 104 ms 17988 KB Output is correct
26 Correct 83 ms 19604 KB Output is correct
27 Correct 10 ms 8960 KB Output is correct
28 Correct 11 ms 9088 KB Output is correct
29 Correct 11 ms 8960 KB Output is correct
30 Correct 25 ms 9216 KB Output is correct
31 Correct 89 ms 9720 KB Output is correct
32 Correct 9 ms 8960 KB Output is correct
33 Correct 10 ms 9216 KB Output is correct
34 Correct 11 ms 9216 KB Output is correct
35 Correct 14 ms 9344 KB Output is correct
36 Correct 35 ms 9472 KB Output is correct
37 Correct 125 ms 9976 KB Output is correct
38 Correct 16 ms 11672 KB Output is correct
39 Correct 16 ms 11800 KB Output is correct
40 Correct 18 ms 11800 KB Output is correct
41 Correct 48 ms 11800 KB Output is correct
42 Correct 156 ms 12076 KB Output is correct
43 Correct 115 ms 55584 KB Output is correct
44 Correct 117 ms 55604 KB Output is correct
45 Correct 122 ms 55604 KB Output is correct
46 Correct 154 ms 55612 KB Output is correct
47 Correct 335 ms 55612 KB Output is correct
48 Correct 18 ms 10368 KB Output is correct
49 Correct 55 ms 10624 KB Output is correct
50 Correct 205 ms 10872 KB Output is correct
51 Correct 389 ms 11256 KB Output is correct
52 Correct 61 ms 28544 KB Output is correct
53 Correct 143 ms 28672 KB Output is correct
54 Correct 453 ms 29056 KB Output is correct
55 Correct 810 ms 29528 KB Output is correct
56 Correct 304 ms 122364 KB Output is correct
57 Correct 411 ms 122368 KB Output is correct
58 Correct 1024 ms 122772 KB Output is correct
59 Correct 1753 ms 123132 KB Output is correct
60 Correct 638 ms 248852 KB Output is correct
61 Correct 751 ms 248596 KB Output is correct
62 Correct 1389 ms 248884 KB Output is correct
63 Correct 2360 ms 249240 KB Output is correct
64 Correct 3493 ms 249536 KB Output is correct
65 Correct 4238 ms 196660 KB Output is correct
66 Correct 4275 ms 202724 KB Output is correct
67 Correct 4205 ms 200928 KB Output is correct
68 Correct 4549 ms 202516 KB Output is correct
69 Correct 4207 ms 190424 KB Output is correct
70 Correct 3419 ms 136684 KB Output is correct
71 Execution timed out 5082 ms 251400 KB Time limit exceeded
72 Halted 0 ms 0 KB -