oj.uz

Submission #658558

# Submission time Handle Problem Language Result Execution time Memory
658558 2022-11-13T12:54:51 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 96772 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(f(dps[v]));

    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);

    par[1] = {0, 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){
                auto it = dps[v].end(); --it;
                cur = *it;
            }

            par[v].second = x;
            
            while(v > 0){
                cur += par[v].second;

                v = par[v].first;

                if(dps[v].find(cur - delta) != dps[v].end()){
                    answers.erase(answers.find(f(dps[v])));

                    dps[v].erase(dps[v].find(cur - delta));
                    dps[v].insert(cur);

                    answers.insert(f(dps[v]));
                }
                else break;
                
            }
            auto it = answers.end(); --it;
            last = *it;
        }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:147:16: warning: unused variable 'aa' [-Wunused-variable]
  147 |     int T = 1, aa;
      |                ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 86348 KB Output is correct
2 Correct 44 ms 86396 KB Output is correct
3 Correct 42 ms 86396 KB Output is correct
4 Correct 38 ms 86356 KB Output is correct
5 Correct 38 ms 86404 KB Output is correct
6 Correct 39 ms 86348 KB Output is correct
7 Correct 43 ms 86432 KB Output is correct
8 Correct 40 ms 86376 KB Output is correct
9 Correct 43 ms 86372 KB Output is correct
10 Correct 49 ms 86404 KB Output is correct
11 Correct 38 ms 86444 KB Output is correct
12 Correct 39 ms 86344 KB Output is correct
13 Correct 39 ms 86380 KB Output is correct
14 Correct 40 ms 86356 KB Output is correct
15 Correct 40 ms 86344 KB Output is correct
16 Correct 44 ms 86356 KB Output is correct
17 Correct 39 ms 86440 KB Output is correct
18 Correct 39 ms 86356 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 86348 KB Output is correct
2 Correct 44 ms 86396 KB Output is correct
3 Correct 42 ms 86396 KB Output is correct
4 Correct 38 ms 86356 KB Output is correct
5 Correct 38 ms 86404 KB Output is correct
6 Correct 39 ms 86348 KB Output is correct
7 Correct 43 ms 86432 KB Output is correct
8 Correct 40 ms 86376 KB Output is correct
9 Correct 43 ms 86372 KB Output is correct
10 Correct 49 ms 86404 KB Output is correct
11 Correct 38 ms 86444 KB Output is correct
12 Correct 39 ms 86344 KB Output is correct
13 Correct 39 ms 86380 KB Output is correct
14 Correct 40 ms 86356 KB Output is correct
15 Correct 40 ms 86344 KB Output is correct
16 Correct 44 ms 86356 KB Output is correct
17 Correct 39 ms 86440 KB Output is correct
18 Correct 39 ms 86356 KB Output is correct
19 Correct 158 ms 86628 KB Output is correct
20 Correct 156 ms 86544 KB Output is correct
21 Correct 160 ms 86696 KB Output is correct
22 Correct 194 ms 86624 KB Output is correct
23 Correct 1063 ms 87108 KB Output is correct
24 Correct 1093 ms 87100 KB Output is correct
25 Correct 1216 ms 87196 KB Output is correct
26 Correct 1299 ms 87740 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 86388 KB Output is correct
2 Correct 43 ms 86332 KB Output is correct
3 Correct 40 ms 86444 KB Output is correct
4 Correct 49 ms 86432 KB Output is correct
5 Correct 71 ms 86820 KB Output is correct
6 Correct 38 ms 86344 KB Output is correct
7 Correct 39 ms 86400 KB Output is correct
8 Correct 43 ms 86416 KB Output is correct
9 Correct 43 ms 86476 KB Output is correct
10 Correct 56 ms 86508 KB Output is correct
11 Correct 84 ms 86860 KB Output is correct
12 Correct 41 ms 86816 KB Output is correct
13 Correct 41 ms 86792 KB Output is correct
14 Correct 44 ms 86784 KB Output is correct
15 Correct 49 ms 86900 KB Output is correct
16 Correct 98 ms 87248 KB Output is correct
17 Correct 100 ms 94644 KB Output is correct
18 Correct 101 ms 94640 KB Output is correct
19 Correct 104 ms 94724 KB Output is correct
20 Correct 161 ms 94744 KB Output is correct
21 Correct 251 ms 95220 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 86544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 86348 KB Output is correct
2 Correct 44 ms 86396 KB Output is correct
3 Correct 42 ms 86396 KB Output is correct
4 Correct 38 ms 86356 KB Output is correct
5 Correct 38 ms 86404 KB Output is correct
6 Correct 39 ms 86348 KB Output is correct
7 Correct 43 ms 86432 KB Output is correct
8 Correct 40 ms 86376 KB Output is correct
9 Correct 43 ms 86372 KB Output is correct
10 Correct 49 ms 86404 KB Output is correct
11 Correct 38 ms 86444 KB Output is correct
12 Correct 39 ms 86344 KB Output is correct
13 Correct 39 ms 86380 KB Output is correct
14 Correct 40 ms 86356 KB Output is correct
15 Correct 40 ms 86344 KB Output is correct
16 Correct 44 ms 86356 KB Output is correct
17 Correct 39 ms 86440 KB Output is correct
18 Correct 39 ms 86356 KB Output is correct
19 Correct 158 ms 86628 KB Output is correct
20 Correct 156 ms 86544 KB Output is correct
21 Correct 160 ms 86696 KB Output is correct
22 Correct 194 ms 86624 KB Output is correct
23 Correct 1063 ms 87108 KB Output is correct
24 Correct 1093 ms 87100 KB Output is correct
25 Correct 1216 ms 87196 KB Output is correct
26 Correct 1299 ms 87740 KB Output is correct
27 Correct 41 ms 86388 KB Output is correct
28 Correct 43 ms 86332 KB Output is correct
29 Correct 40 ms 86444 KB Output is correct
30 Correct 49 ms 86432 KB Output is correct
31 Correct 71 ms 86820 KB Output is correct
32 Correct 38 ms 86344 KB Output is correct
33 Correct 39 ms 86400 KB Output is correct
34 Correct 43 ms 86416 KB Output is correct
35 Correct 43 ms 86476 KB Output is correct
36 Correct 56 ms 86508 KB Output is correct
37 Correct 84 ms 86860 KB Output is correct
38 Correct 41 ms 86816 KB Output is correct
39 Correct 41 ms 86792 KB Output is correct
40 Correct 44 ms 86784 KB Output is correct
41 Correct 49 ms 86900 KB Output is correct
42 Correct 98 ms 87248 KB Output is correct
43 Correct 100 ms 94644 KB Output is correct
44 Correct 101 ms 94640 KB Output is correct
45 Correct 104 ms 94724 KB Output is correct
46 Correct 161 ms 94744 KB Output is correct
47 Correct 251 ms 95220 KB Output is correct
48 Incorrect 45 ms 86544 KB Output isn't correct
49 Halted 0 ms 0 KB -