oj.uz

Submission #658562

# Submission time Handle Problem Language Result Execution time Memory
658562 2022-11-13T13:02:45 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 59120 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], dps[N][2];
vector<int> g[N];
vector<pair<int, ll>> edges(N);
multiset<ll> s, answers;


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][u % 2] = dp[u] + e.second;
    }
    if(case4)
        answers.insert(dps[v][0] + dps[v][1]);

    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};
    }
    for(int i = 0; i <= n; ++i) dps[i][0] = dps[i][1] = 0;

    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;    

            par[v].second = x;
            
            while(v > 1){
                int u = v;
                v = par[v].first;

                answers.erase(answers.find(dps[v][0] + dps[v][1]));

                dps[v][u % 2] = par[u].second + max(dps[u][0], dps[u][1]);

                answers.insert(dps[v][0] + dps[v][1]);
                
            }
            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:128:16: warning: unused variable 'aa' [-Wunused-variable]
  128 |     int T = 1, aa;
      |                ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39380 KB Output is correct
2 Correct 18 ms 39380 KB Output is correct
3 Correct 19 ms 39384 KB Output is correct
4 Correct 18 ms 39380 KB Output is correct
5 Correct 19 ms 39508 KB Output is correct
6 Correct 19 ms 39380 KB Output is correct
7 Correct 19 ms 39452 KB Output is correct
8 Correct 18 ms 39444 KB Output is correct
9 Correct 21 ms 39392 KB Output is correct
10 Correct 21 ms 39460 KB Output is correct
11 Correct 18 ms 39380 KB Output is correct
12 Correct 18 ms 39380 KB Output is correct
13 Correct 18 ms 39492 KB Output is correct
14 Correct 19 ms 39484 KB Output is correct
15 Correct 18 ms 39412 KB Output is correct
16 Correct 19 ms 39392 KB Output is correct
17 Correct 18 ms 39508 KB Output is correct
18 Correct 19 ms 39508 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39380 KB Output is correct
2 Correct 18 ms 39380 KB Output is correct
3 Correct 19 ms 39384 KB Output is correct
4 Correct 18 ms 39380 KB Output is correct
5 Correct 19 ms 39508 KB Output is correct
6 Correct 19 ms 39380 KB Output is correct
7 Correct 19 ms 39452 KB Output is correct
8 Correct 18 ms 39444 KB Output is correct
9 Correct 21 ms 39392 KB Output is correct
10 Correct 21 ms 39460 KB Output is correct
11 Correct 18 ms 39380 KB Output is correct
12 Correct 18 ms 39380 KB Output is correct
13 Correct 18 ms 39492 KB Output is correct
14 Correct 19 ms 39484 KB Output is correct
15 Correct 18 ms 39412 KB Output is correct
16 Correct 19 ms 39392 KB Output is correct
17 Correct 18 ms 39508 KB Output is correct
18 Correct 19 ms 39508 KB Output is correct
19 Correct 131 ms 39616 KB Output is correct
20 Correct 140 ms 39628 KB Output is correct
21 Correct 145 ms 39636 KB Output is correct
22 Correct 164 ms 39688 KB Output is correct
23 Correct 953 ms 40092 KB Output is correct
24 Correct 982 ms 40124 KB Output is correct
25 Correct 1073 ms 40416 KB Output is correct
26 Correct 1219 ms 40856 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 39436 KB Output is correct
2 Correct 22 ms 39380 KB Output is correct
3 Correct 21 ms 39508 KB Output is correct
4 Correct 26 ms 39572 KB Output is correct
5 Correct 51 ms 39816 KB Output is correct
6 Correct 24 ms 39404 KB Output is correct
7 Correct 18 ms 39508 KB Output is correct
8 Correct 21 ms 39448 KB Output is correct
9 Correct 19 ms 39460 KB Output is correct
10 Correct 26 ms 39636 KB Output is correct
11 Correct 58 ms 39896 KB Output is correct
12 Correct 20 ms 39892 KB Output is correct
13 Correct 21 ms 39892 KB Output is correct
14 Correct 23 ms 39880 KB Output is correct
15 Correct 29 ms 40020 KB Output is correct
16 Correct 68 ms 40488 KB Output is correct
17 Correct 80 ms 49220 KB Output is correct
18 Correct 85 ms 49248 KB Output is correct
19 Correct 77 ms 49268 KB Output is correct
20 Correct 100 ms 49388 KB Output is correct
21 Correct 187 ms 49824 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39636 KB Output is correct
2 Correct 28 ms 39780 KB Output is correct
3 Correct 63 ms 40260 KB Output is correct
4 Correct 106 ms 40704 KB Output is correct
5 Correct 30 ms 41200 KB Output is correct
6 Correct 43 ms 41424 KB Output is correct
7 Correct 103 ms 41984 KB Output is correct
8 Correct 166 ms 42832 KB Output is correct
9 Correct 64 ms 48372 KB Output is correct
10 Correct 86 ms 48588 KB Output is correct
11 Correct 170 ms 49264 KB Output is correct
12 Correct 270 ms 50044 KB Output is correct
13 Correct 143 ms 57404 KB Output is correct
14 Correct 165 ms 57644 KB Output is correct
15 Correct 261 ms 58324 KB Output is correct
16 Correct 365 ms 59120 KB Output is correct
17 Correct 698 ms 58904 KB Output is correct

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39380 KB Output is correct
2 Correct 18 ms 39380 KB Output is correct
3 Correct 19 ms 39384 KB Output is correct
4 Correct 18 ms 39380 KB Output is correct
5 Correct 19 ms 39508 KB Output is correct
6 Correct 19 ms 39380 KB Output is correct
7 Correct 19 ms 39452 KB Output is correct
8 Correct 18 ms 39444 KB Output is correct
9 Correct 21 ms 39392 KB Output is correct
10 Correct 21 ms 39460 KB Output is correct
11 Correct 18 ms 39380 KB Output is correct
12 Correct 18 ms 39380 KB Output is correct
13 Correct 18 ms 39492 KB Output is correct
14 Correct 19 ms 39484 KB Output is correct
15 Correct 18 ms 39412 KB Output is correct
16 Correct 19 ms 39392 KB Output is correct
17 Correct 18 ms 39508 KB Output is correct
18 Correct 19 ms 39508 KB Output is correct
19 Correct 131 ms 39616 KB Output is correct
20 Correct 140 ms 39628 KB Output is correct
21 Correct 145 ms 39636 KB Output is correct
22 Correct 164 ms 39688 KB Output is correct
23 Correct 953 ms 40092 KB Output is correct
24 Correct 982 ms 40124 KB Output is correct
25 Correct 1073 ms 40416 KB Output is correct
26 Correct 1219 ms 40856 KB Output is correct
27 Correct 16 ms 39436 KB Output is correct
28 Correct 22 ms 39380 KB Output is correct
29 Correct 21 ms 39508 KB Output is correct
30 Correct 26 ms 39572 KB Output is correct
31 Correct 51 ms 39816 KB Output is correct
32 Correct 24 ms 39404 KB Output is correct
33 Correct 18 ms 39508 KB Output is correct
34 Correct 21 ms 39448 KB Output is correct
35 Correct 19 ms 39460 KB Output is correct
36 Correct 26 ms 39636 KB Output is correct
37 Correct 58 ms 39896 KB Output is correct
38 Correct 20 ms 39892 KB Output is correct
39 Correct 21 ms 39892 KB Output is correct
40 Correct 23 ms 39880 KB Output is correct
41 Correct 29 ms 40020 KB Output is correct
42 Correct 68 ms 40488 KB Output is correct
43 Correct 80 ms 49220 KB Output is correct
44 Correct 85 ms 49248 KB Output is correct
45 Correct 77 ms 49268 KB Output is correct
46 Correct 100 ms 49388 KB Output is correct
47 Correct 187 ms 49824 KB Output is correct
48 Correct 20 ms 39636 KB Output is correct
49 Correct 28 ms 39780 KB Output is correct
50 Correct 63 ms 40260 KB Output is correct
51 Correct 106 ms 40704 KB Output is correct
52 Correct 30 ms 41200 KB Output is correct
53 Correct 43 ms 41424 KB Output is correct
54 Correct 103 ms 41984 KB Output is correct
55 Correct 166 ms 42832 KB Output is correct
56 Correct 64 ms 48372 KB Output is correct
57 Correct 86 ms 48588 KB Output is correct
58 Correct 170 ms 49264 KB Output is correct
59 Correct 270 ms 50044 KB Output is correct
60 Correct 143 ms 57404 KB Output is correct
61 Correct 165 ms 57644 KB Output is correct
62 Correct 261 ms 58324 KB Output is correct
63 Correct 365 ms 59120 KB Output is correct
64 Correct 698 ms 58904 KB Output is correct
65 Execution timed out 5053 ms 51384 KB Time limit exceeded
66 Halted 0 ms 0 KB -