oj.uz

Submission #658534

# Submission time Handle Problem Language Result Execution time Memory
658534 2022-11-13T12:24:41 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 175416 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD1 (1000000000+7)
#define MOD (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;


int n, q;
bool case3 = 1, case4 = 1;
pair<int, ll> par[N];
ll w, dp[N];
vector<int> g[N];
vector<pair<int, ll>> edges(N);
multiset<ll> s, dps[N], answers;

ll f(multiset<ll> &a){
    if(a.empty()) return 0;
    if(a.size() == 1) return *(a.begin());
    auto it = a.end(); --it;
    ll x = *it; --it; x += *it;
    return x;
}

ll dfs(int v, int p){
    pair<ll, ll> best = {0, 0};    
    dp[v] = 0;
    ll d = 0;
    for(int E: g[v]){
        auto e = edges[E];
        int u = e.first;
        if(u == p) continue;

        d = max(d, dfs(u, v));

        par[u] = {v, e.second};

        dp[v] = max(dp[v], dp[u] + e.second);
        
        if(best.first < dp[u] + e.second){
            swap(best.first, best.second);
            best.first = dp[u] + e.second;
        }else if(best.second < dp[u] + e.second){
            best.second = dp[u] + e.second;
        }
        if(case4)
            dps[v].insert(dp[u] + e.second);
    }
    if(case4)
        answers.insert(best.first + best.second);

    return max(d, best.first + best.second);
}

void solve(){
    cin >> n >> q >> w;
    for(int i = 0; i < n - 1; ++i){
        int u, v; ll x; cin >> u >> v >> x;
        g[u].pb(2*i);
        g[v].pb(2*i+1);

        if(u != 1 && v != 1) case3 = 0;
        if(v/2 != u && u/2 != v) case4 = 0;
        s.insert(x);

        edges[i*2] = {v, x};
        edges[i*2+1] = {u, x};
    }
    
    if(case4) dfs(1, 0);

    ll last = 0;
    for(;q--;){
        ll d, x; cin >> d >> x;
        d = (d + last) % (n-1);
        x = (x + last) % w;
        ll old_x = edges[2*d].second;
        edges[2*d].second = edges[2*d+1].second = x;
        
        if(case3){
            s.erase(s.find(old_x));
            s.insert(x);
            auto it = s.end(); --it;
            if(s.size()==1) last = *it;
            else{
                last = *it;
                it--;
                last += *it;
            }
        }else if(case4){
            int v = edges[2*d].first;
            if(par[v].first != edges[2*d+1].first) v = edges[2*d].first;    

            ll cur = 0, delta = x - old_x;

            if(dps[v].size() > 0) cur = *(--dps[v].end());

            par[v].second = x;
            
            while(v != 1){
                cur += par[v].second;
                v = par[v].first;

                answers.erase(answers.find(f(dps[v])));

                dps[v].erase(dps[v].find(cur - delta));
                dps[v].insert(cur);
                
                answers.insert(f(dps[v]));
            }
            last = *(--answers.end());
        }else{
            // answers.clear();
            last = dfs(1, 0);
            // last = *(--answers.end());
        }
        cout << last << '\n';
    }
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:136:16: warning: unused variable 'aa' [-Wunused-variable]
  136 |     int T = 1, aa;
      |                ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 86340 KB Output is correct
2 Correct 39 ms 86356 KB Output is correct
3 Correct 38 ms 86456 KB Output is correct
4 Correct 39 ms 86356 KB Output is correct
5 Correct 39 ms 86380 KB Output is correct
6 Correct 39 ms 86356 KB Output is correct
7 Correct 38 ms 86356 KB Output is correct
8 Correct 42 ms 86336 KB Output is correct
9 Correct 39 ms 86420 KB Output is correct
10 Correct 44 ms 86412 KB Output is correct
11 Correct 38 ms 86356 KB Output is correct
12 Correct 39 ms 86432 KB Output is correct
13 Correct 38 ms 86320 KB Output is correct
14 Correct 40 ms 86380 KB Output is correct
15 Correct 45 ms 86436 KB Output is correct
16 Correct 39 ms 86408 KB Output is correct
17 Correct 39 ms 86404 KB Output is correct
18 Correct 37 ms 86352 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 86340 KB Output is correct
2 Correct 39 ms 86356 KB Output is correct
3 Correct 38 ms 86456 KB Output is correct
4 Correct 39 ms 86356 KB Output is correct
5 Correct 39 ms 86380 KB Output is correct
6 Correct 39 ms 86356 KB Output is correct
7 Correct 38 ms 86356 KB Output is correct
8 Correct 42 ms 86336 KB Output is correct
9 Correct 39 ms 86420 KB Output is correct
10 Correct 44 ms 86412 KB Output is correct
11 Correct 38 ms 86356 KB Output is correct
12 Correct 39 ms 86432 KB Output is correct
13 Correct 38 ms 86320 KB Output is correct
14 Correct 40 ms 86380 KB Output is correct
15 Correct 45 ms 86436 KB Output is correct
16 Correct 39 ms 86408 KB Output is correct
17 Correct 39 ms 86404 KB Output is correct
18 Correct 37 ms 86352 KB Output is correct
19 Correct 151 ms 86468 KB Output is correct
20 Correct 151 ms 86512 KB Output is correct
21 Correct 155 ms 86568 KB Output is correct
22 Correct 183 ms 86616 KB Output is correct
23 Correct 992 ms 86972 KB Output is correct
24 Correct 1062 ms 87008 KB Output is correct
25 Correct 1116 ms 87192 KB Output is correct
26 Correct 1302 ms 87832 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 86384 KB Output is correct
2 Correct 37 ms 86392 KB Output is correct
3 Correct 41 ms 86408 KB Output is correct
4 Correct 44 ms 86460 KB Output is correct
5 Correct 71 ms 86852 KB Output is correct
6 Correct 38 ms 86340 KB Output is correct
7 Correct 38 ms 86380 KB Output is correct
8 Correct 38 ms 86436 KB Output is correct
9 Correct 39 ms 86448 KB Output is correct
10 Correct 47 ms 86580 KB Output is correct
11 Correct 74 ms 86940 KB Output is correct
12 Correct 39 ms 86852 KB Output is correct
13 Correct 45 ms 86732 KB Output is correct
14 Correct 42 ms 86788 KB Output is correct
15 Correct 48 ms 86836 KB Output is correct
16 Correct 85 ms 87352 KB Output is correct
17 Correct 95 ms 94660 KB Output is correct
18 Correct 95 ms 94580 KB Output is correct
19 Correct 98 ms 94648 KB Output is correct
20 Correct 112 ms 94716 KB Output is correct
21 Correct 203 ms 95240 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 130 ms 175416 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5053 ms 96768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 86340 KB Output is correct
2 Correct 39 ms 86356 KB Output is correct
3 Correct 38 ms 86456 KB Output is correct
4 Correct 39 ms 86356 KB Output is correct
5 Correct 39 ms 86380 KB Output is correct
6 Correct 39 ms 86356 KB Output is correct
7 Correct 38 ms 86356 KB Output is correct
8 Correct 42 ms 86336 KB Output is correct
9 Correct 39 ms 86420 KB Output is correct
10 Correct 44 ms 86412 KB Output is correct
11 Correct 38 ms 86356 KB Output is correct
12 Correct 39 ms 86432 KB Output is correct
13 Correct 38 ms 86320 KB Output is correct
14 Correct 40 ms 86380 KB Output is correct
15 Correct 45 ms 86436 KB Output is correct
16 Correct 39 ms 86408 KB Output is correct
17 Correct 39 ms 86404 KB Output is correct
18 Correct 37 ms 86352 KB Output is correct
19 Correct 151 ms 86468 KB Output is correct
20 Correct 151 ms 86512 KB Output is correct
21 Correct 155 ms 86568 KB Output is correct
22 Correct 183 ms 86616 KB Output is correct
23 Correct 992 ms 86972 KB Output is correct
24 Correct 1062 ms 87008 KB Output is correct
25 Correct 1116 ms 87192 KB Output is correct
26 Correct 1302 ms 87832 KB Output is correct
27 Correct 41 ms 86384 KB Output is correct
28 Correct 37 ms 86392 KB Output is correct
29 Correct 41 ms 86408 KB Output is correct
30 Correct 44 ms 86460 KB Output is correct
31 Correct 71 ms 86852 KB Output is correct
32 Correct 38 ms 86340 KB Output is correct
33 Correct 38 ms 86380 KB Output is correct
34 Correct 38 ms 86436 KB Output is correct
35 Correct 39 ms 86448 KB Output is correct
36 Correct 47 ms 86580 KB Output is correct
37 Correct 74 ms 86940 KB Output is correct
38 Correct 39 ms 86852 KB Output is correct
39 Correct 45 ms 86732 KB Output is correct
40 Correct 42 ms 86788 KB Output is correct
41 Correct 48 ms 86836 KB Output is correct
42 Correct 85 ms 87352 KB Output is correct
43 Correct 95 ms 94660 KB Output is correct
44 Correct 95 ms 94580 KB Output is correct
45 Correct 98 ms 94648 KB Output is correct
46 Correct 112 ms 94716 KB Output is correct
47 Correct 203 ms 95240 KB Output is correct
48 Runtime error 130 ms 175416 KB Execution killed with signal 6
49 Halted 0 ms 0 KB -