oj.uz

Submission #658526

# Submission time Handle Problem Language Result Execution time Memory
658526 2022-11-13T12:18:15 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 175384 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.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 = dp[v], delta = x - old_x;

            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:132:16: warning: unused variable 'aa' [-Wunused-variable]
  132 |     int T = 1, aa;
      |                ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 86356 KB Output is correct
2 Correct 37 ms 86356 KB Output is correct
3 Correct 37 ms 86368 KB Output is correct
4 Correct 38 ms 86388 KB Output is correct
5 Correct 38 ms 86420 KB Output is correct
6 Correct 38 ms 86384 KB Output is correct
7 Correct 39 ms 86360 KB Output is correct
8 Correct 39 ms 86432 KB Output is correct
9 Correct 38 ms 86376 KB Output is correct
10 Correct 38 ms 86404 KB Output is correct
11 Correct 38 ms 86348 KB Output is correct
12 Correct 38 ms 86412 KB Output is correct
13 Correct 44 ms 86356 KB Output is correct
14 Correct 46 ms 86436 KB Output is correct
15 Correct 38 ms 86328 KB Output is correct
16 Correct 38 ms 86384 KB Output is correct
17 Correct 38 ms 86424 KB Output is correct
18 Correct 39 ms 86384 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 86356 KB Output is correct
2 Correct 37 ms 86356 KB Output is correct
3 Correct 37 ms 86368 KB Output is correct
4 Correct 38 ms 86388 KB Output is correct
5 Correct 38 ms 86420 KB Output is correct
6 Correct 38 ms 86384 KB Output is correct
7 Correct 39 ms 86360 KB Output is correct
8 Correct 39 ms 86432 KB Output is correct
9 Correct 38 ms 86376 KB Output is correct
10 Correct 38 ms 86404 KB Output is correct
11 Correct 38 ms 86348 KB Output is correct
12 Correct 38 ms 86412 KB Output is correct
13 Correct 44 ms 86356 KB Output is correct
14 Correct 46 ms 86436 KB Output is correct
15 Correct 38 ms 86328 KB Output is correct
16 Correct 38 ms 86384 KB Output is correct
17 Correct 38 ms 86424 KB Output is correct
18 Correct 39 ms 86384 KB Output is correct
19 Correct 152 ms 86568 KB Output is correct
20 Correct 156 ms 86488 KB Output is correct
21 Correct 162 ms 86588 KB Output is correct
22 Correct 190 ms 86760 KB Output is correct
23 Correct 1029 ms 87104 KB Output is correct
24 Correct 1053 ms 87140 KB Output is correct
25 Correct 1142 ms 87200 KB Output is correct
26 Correct 1300 ms 87652 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 86356 KB Output is correct
2 Correct 38 ms 86348 KB Output is correct
3 Correct 39 ms 86340 KB Output is correct
4 Correct 43 ms 86484 KB Output is correct
5 Correct 68 ms 86860 KB Output is correct
6 Correct 38 ms 86372 KB Output is correct
7 Correct 41 ms 86520 KB Output is correct
8 Correct 40 ms 86460 KB Output is correct
9 Correct 44 ms 86488 KB Output is correct
10 Correct 50 ms 86504 KB Output is correct
11 Correct 74 ms 86944 KB Output is correct
12 Correct 45 ms 86816 KB Output is correct
13 Correct 40 ms 86780 KB Output is correct
14 Correct 46 ms 86820 KB Output is correct
15 Correct 48 ms 86892 KB Output is correct
16 Correct 84 ms 87312 KB Output is correct
17 Correct 94 ms 94544 KB Output is correct
18 Correct 94 ms 94588 KB Output is correct
19 Correct 106 ms 94608 KB Output is correct
20 Correct 113 ms 94776 KB Output is correct
21 Correct 196 ms 95232 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 105 ms 175384 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 5058 ms 96876 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 86356 KB Output is correct
2 Correct 37 ms 86356 KB Output is correct
3 Correct 37 ms 86368 KB Output is correct
4 Correct 38 ms 86388 KB Output is correct
5 Correct 38 ms 86420 KB Output is correct
6 Correct 38 ms 86384 KB Output is correct
7 Correct 39 ms 86360 KB Output is correct
8 Correct 39 ms 86432 KB Output is correct
9 Correct 38 ms 86376 KB Output is correct
10 Correct 38 ms 86404 KB Output is correct
11 Correct 38 ms 86348 KB Output is correct
12 Correct 38 ms 86412 KB Output is correct
13 Correct 44 ms 86356 KB Output is correct
14 Correct 46 ms 86436 KB Output is correct
15 Correct 38 ms 86328 KB Output is correct
16 Correct 38 ms 86384 KB Output is correct
17 Correct 38 ms 86424 KB Output is correct
18 Correct 39 ms 86384 KB Output is correct
19 Correct 152 ms 86568 KB Output is correct
20 Correct 156 ms 86488 KB Output is correct
21 Correct 162 ms 86588 KB Output is correct
22 Correct 190 ms 86760 KB Output is correct
23 Correct 1029 ms 87104 KB Output is correct
24 Correct 1053 ms 87140 KB Output is correct
25 Correct 1142 ms 87200 KB Output is correct
26 Correct 1300 ms 87652 KB Output is correct
27 Correct 40 ms 86356 KB Output is correct
28 Correct 38 ms 86348 KB Output is correct
29 Correct 39 ms 86340 KB Output is correct
30 Correct 43 ms 86484 KB Output is correct
31 Correct 68 ms 86860 KB Output is correct
32 Correct 38 ms 86372 KB Output is correct
33 Correct 41 ms 86520 KB Output is correct
34 Correct 40 ms 86460 KB Output is correct
35 Correct 44 ms 86488 KB Output is correct
36 Correct 50 ms 86504 KB Output is correct
37 Correct 74 ms 86944 KB Output is correct
38 Correct 45 ms 86816 KB Output is correct
39 Correct 40 ms 86780 KB Output is correct
40 Correct 46 ms 86820 KB Output is correct
41 Correct 48 ms 86892 KB Output is correct
42 Correct 84 ms 87312 KB Output is correct
43 Correct 94 ms 94544 KB Output is correct
44 Correct 94 ms 94588 KB Output is correct
45 Correct 106 ms 94608 KB Output is correct
46 Correct 113 ms 94776 KB Output is correct
47 Correct 196 ms 95232 KB Output is correct
48 Runtime error 105 ms 175384 KB Execution killed with signal 6
49 Halted 0 ms 0 KB -