oj.uz

Submission #619064

# Submission time Handle Problem Language Result Execution time Memory
619064 2022-08-02T09:37:55 Z Je_O Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 8784 KB 
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

const int N = 1e5 + 5;
const int LOG = 18;
const int INF = 2e9 + 5;
vector<iii> vec;
vector<ii> lst[N];
int dist[N];

void solve_sub2(int n, int q, int w){
    int last = 0;
    while(q--){
        int d, e; cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w;
        vec[d].fi = e;
        for(int i = 1; i <= n; ++i)lst[i].clear();
        for(int i = 0; i < n - 1; ++i){
            lst[vec[i].se.fi].pb(mp(vec[i].se.se, vec[i].fi));
            lst[vec[i].se.se].pb(mp(vec[i].se.fi, vec[i].fi));
        }
        for(int i = 1; i <= n; ++i)dist[i] = INF;
        queue<int> q;
        q.push(1);
        dist[1] = 0;
        while(!q.empty()){
            int cur = q.front(); q.pop();
            for(int i = 0; i < lst[cur].size(); ++i){
                int nx = lst[cur][i].fi;
                int cs = dist[cur] + lst[cur][i].se;
                if(cs < dist[nx]){
                    dist[nx] = cs;
                    q.push(nx);
                }
            }
        }
        ii maxdist = mp(-1, -1);
        for(int i = 1; i <= n; ++i){
            maxdist = max(maxdist, mp(dist[i], i));
        }
        for(int i = 1; i <= n; ++i)dist[i] = INF;
        q.push(maxdist.se);
        dist[maxdist.se] = 0;
        while(!q.empty()){
            int cur = q.front(); q.pop();
            for(int i = 0; i < lst[cur].size(); ++i){
                int nx = lst[cur][i].fi;
                int cs = dist[cur] + lst[cur][i].se;
                if(cs < dist[nx]){
                    dist[nx] = cs;
                    q.push(nx);
                }
            }
        }
        int ans = -1;
        for(int i = 1; i <= n; ++i){
            ans = max(ans, dist[i]);
        }
        last = ans;
        cout << ans << '\n';
    }
    return;
}

map<int, int> mep;

void solve_sub3(int n, int q, int w){
    int last = 0;
    while(q--){
        int d, e; cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w;
        --mep[vec[d].fi];
        if(mep[vec[d].fi] == 0)mep.erase(vec[d].fi);
        ++mep[e];
        vec[d].fi = e;
        auto it = mep.end();
        --it;
        int ans = it->fi;
        if(it->se > 1)ans += it->fi;
        else{
            --it;
            ans += it->fi;
        }
        last = ans;
        cout << ans << '\n';
    }
    return;
}

int par[N];
int depth[N];
int cost[N];
int ar[LOG][N];
int lf[N], rg[N];

struct node{
    int mx1, mx2, lz;
};

node st[LOG][4 * N];

node merge(node a, node b){
    return {max(a.mx1, b.mx1), max(min(a.mx1, b.mx1), max(a.mx2, b.mx2)), 0};
}

void build(int idx, int l, int r, int lg){
    if(l == r){
        st[lg][l] = {ar[lg][l], -1, 0};
        return;
    }
    int m = (l + r)/2;
    build(idx * 2, l, m, lg);
    build(idx * 2 + 1, m + 1, r, lg);
    st[lg][idx] = merge(st[lg][idx * 2], st[lg][idx * 2 + 1]);
    return;
}

void apply(int idx, int l, int r, int v, int lg){
    st[lg][idx].mx1 += v;
    st[lg][idx].mx2 += v;
    st[lg][idx].lz += v;
    return;
}

void pushdown(int idx, int l, int r, int lg){
    if(st[lg][idx].lz == 0)return;
    int m = (l + r)/2;
    apply(idx * 2, l, m, st[lg][idx].lz, lg);
    apply(idx * 2 + 1, m + 1, r, st[lg][idx].lz, lg);
    st[lg][idx].lz = 0;
    return;
}

void upd(int idx, int l, int r, int x, int y, int v, int lg){
    if(l > y || r < x)return;
    if(l >= x && r <= y){
        apply(idx, l, r, v, lg);
        return;
    }
    pushdown(idx, l, r, lg);
    int m = (l + r)/2;
    upd(idx * 2, l, m, x, y, v, lg);
    upd(idx * 2 + 1, m + 1, r, x, y, v, lg);
    st[lg][idx] = merge(st[lg][idx * 2], st[lg][idx * 2 + 1]);
    return;
}

node get(int idx, int l, int r, int x, int y, int lg){
    if(l > y || r < x)return {-1, -1, 0};
    if(l >= x && r <= y)return st[idx][lg];
    pushdown(idx, l, r, lg);
    int m = (l + r)/2;
    return merge(get(idx * 2, l, m, x, y, lg), get(idx * 2 + 1, m + 1, r, x, y, lg));
}

ii dfs(int idx, int p){
    par[idx] = p;
    ii res = mp(INF, 0);
    for(int i = 0; i < lst[idx].size(); ++i){
        int nx = lst[idx][i].fi;
        if(nx == p)continue;
        cost[nx] = lst[idx][i].se;
        depth[nx] = depth[idx] + 1;
        ii cur = dfs(nx, idx);
        res.fi = min(res.fi, cur.fi);
        res.se = max(res.se, cur.se);
    }
    lf[idx] = res.fi; rg[idx] = res.se;
    return res;
}

void build_ar(int l, int r){
    for(int i = l; i <= r; ++i){
        int idx = i;
        int sum_cost = 0;
        while(par[idx] != -1){
            sum_cost += cost[idx];
            idx = par[idx];
            ar[depth[idx]][i] = sum_cost;
        }
    }
    return;
}

node rs[N];

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n, q, w; cin >> n >> q >> w;
    bool sub3 = true;
    for(int i = 0; i < n - 1; ++i){
        int a, b, c; cin >> a >> b >> c;
        lst[a].pb(mp(b, c));
        lst[b].pb(mp(a, c));
        vec.pb(mp(c, mp(a, b)));
        ++mep[c];
        if(a != 1 && b != 1)sub3 = false;
    }
    if(n <= 5000 && q <= 5000){
        solve_sub2(n, q, w);
        return 0;
    }
    if(sub3){
        solve_sub3(n, q, w);
        return 0;
    }
    mep.clear();
    dfs(1, -1);
    int id_l = 0;
    for(int i = 1; i <= n; ++i){
        if(lst[i].size() == 1){
            id_l = i;
            break;
        }
    }
    build_ar(id_l, n);
    for(int i = 0; i < LOG; ++i)build(1, 1, n, i);
    for(int i = 1; i < id_l; ++i){
        rs[i] = get(1, 1, n, lf[i], rg[i], depth[i]);
        mep[rs[i].mx1 + rs[i].mx2]++;
    }
    int last = 0;
    while(q--){
        int d, e; cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w;
        int x = vec[d].se.fi, y = vec[d].se.se;
        if(depth[x] < depth[y])swap(x, y);
        int idx = x;
        while(par[idx] != -1){
            idx = par[idx];
            int last_sum = rs[idx].mx1 + rs[idx].mx2;
            mep[last_sum]--;
            if(mep[last_sum] == 0)mep.erase(last_sum);
            upd(1, 1, n, lf[x], rg[x], e - cost[x], depth[idx]);
            rs[idx] = get(1, 1, n, lf[idx], rg[idx], depth[idx]);
            mep[rs[idx].mx1 + rs[idx].mx2]++;
        }
        cost[x] = e;
        vec[d].fi = e;
        auto it = mep.end();
        --it;
        int ans = it->fi;
        if(it->se > 1){
            ans += it->fi;
        }else{
            --it;
            ans += it->fi;
        }
        last = ans;
        cout << ans << '\n';
    }
    return 0;
}

Compilation message

diameter.cpp: In function 'void solve_sub2(int, int, int)':
diameter.cpp:39:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             for(int i = 0; i < lst[cur].size(); ++i){
      |                            ~~^~~~~~~~~~~~~~~~~
diameter.cpp:57:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             for(int i = 0; i < lst[cur].size(); ++i){
      |                            ~~^~~~~~~~~~~~~~~~~
diameter.cpp: In function 'ii dfs(int, int)':
diameter.cpp:171:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  171 |     for(int i = 0; i < lst[idx].size(); ++i){
      |                    ~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 296 ms 2900 KB Output is correct
20 Correct 297 ms 2896 KB Output is correct
21 Correct 301 ms 2784 KB Output is correct
22 Correct 306 ms 2776 KB Output is correct
23 Correct 1862 ms 3156 KB Output is correct
24 Correct 1987 ms 3144 KB Output is correct
25 Correct 1971 ms 3276 KB Output is correct
26 Correct 1867 ms 3232 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 4 ms 2656 KB Output is correct
4 Correct 9 ms 2772 KB Output is correct
5 Correct 37 ms 3064 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 6 ms 2644 KB Output is correct
9 Correct 42 ms 2736 KB Output is correct
10 Correct 10 ms 2772 KB Output is correct
11 Correct 38 ms 3080 KB Output is correct
12 Correct 3 ms 3036 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 5 ms 3072 KB Output is correct
15 Correct 11 ms 3156 KB Output is correct
16 Correct 42 ms 3540 KB Output is correct
17 Correct 40 ms 7792 KB Output is correct
18 Correct 36 ms 7792 KB Output is correct
19 Correct 40 ms 7868 KB Output is correct
20 Correct 52 ms 8024 KB Output is correct
21 Correct 96 ms 8784 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 2776 KB Output is correct
2 Execution timed out 5058 ms 3156 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 5188 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 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 296 ms 2900 KB Output is correct
20 Correct 297 ms 2896 KB Output is correct
21 Correct 301 ms 2784 KB Output is correct
22 Correct 306 ms 2776 KB Output is correct
23 Correct 1862 ms 3156 KB Output is correct
24 Correct 1987 ms 3144 KB Output is correct
25 Correct 1971 ms 3276 KB Output is correct
26 Correct 1867 ms 3232 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 4 ms 2656 KB Output is correct
30 Correct 9 ms 2772 KB Output is correct
31 Correct 37 ms 3064 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 6 ms 2644 KB Output is correct
35 Correct 42 ms 2736 KB Output is correct
36 Correct 10 ms 2772 KB Output is correct
37 Correct 38 ms 3080 KB Output is correct
38 Correct 3 ms 3036 KB Output is correct
39 Correct 4 ms 3028 KB Output is correct
40 Correct 5 ms 3072 KB Output is correct
41 Correct 11 ms 3156 KB Output is correct
42 Correct 42 ms 3540 KB Output is correct
43 Correct 40 ms 7792 KB Output is correct
44 Correct 36 ms 7792 KB Output is correct
45 Correct 40 ms 7868 KB Output is correct
46 Correct 52 ms 8024 KB Output is correct
47 Correct 96 ms 8784 KB Output is correct
48 Correct 44 ms 2776 KB Output is correct
49 Execution timed out 5058 ms 3156 KB Time limit exceeded
50 Halted 0 ms 0 KB -