oj.uz

Submission #658515

# Submission time Handle Problem Language Result Execution time Memory
658515 2022-11-13T11:59:49 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 50628 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;
ll w, dp[N];
vector<int> g[N];
vector<pair<int, ll>> edges(N);
multiset<ll> s;
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));
        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;
        }

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

void solve(){
    cin >> n >> q >> w;
    bool case3 = 1;
    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;
        s.insert(x);

        edges[i*2] = {v, x};
        edges[i*2+1] = {u, x};
    }
    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{
            last = dfs(1, 0);
        }
        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:89:16: warning: unused variable 'aa' [-Wunused-variable]
   89 |     int T = 1, aa;
      |                ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 18 ms 39380 KB Output is correct
3 Correct 18 ms 39460 KB Output is correct
4 Correct 19 ms 39380 KB Output is correct
5 Correct 18 ms 39380 KB Output is correct
6 Correct 17 ms 39380 KB Output is correct
7 Correct 19 ms 39380 KB Output is correct
8 Correct 21 ms 39464 KB Output is correct
9 Correct 18 ms 39420 KB Output is correct
10 Correct 17 ms 39376 KB Output is correct
11 Correct 19 ms 39372 KB Output is correct
12 Correct 19 ms 39480 KB Output is correct
13 Correct 19 ms 39380 KB Output is correct
14 Correct 18 ms 39380 KB Output is correct
15 Correct 18 ms 39400 KB Output is correct
16 Correct 18 ms 39448 KB Output is correct
17 Correct 20 ms 39356 KB Output is correct
18 Correct 18 ms 39380 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 18 ms 39380 KB Output is correct
3 Correct 18 ms 39460 KB Output is correct
4 Correct 19 ms 39380 KB Output is correct
5 Correct 18 ms 39380 KB Output is correct
6 Correct 17 ms 39380 KB Output is correct
7 Correct 19 ms 39380 KB Output is correct
8 Correct 21 ms 39464 KB Output is correct
9 Correct 18 ms 39420 KB Output is correct
10 Correct 17 ms 39376 KB Output is correct
11 Correct 19 ms 39372 KB Output is correct
12 Correct 19 ms 39480 KB Output is correct
13 Correct 19 ms 39380 KB Output is correct
14 Correct 18 ms 39380 KB Output is correct
15 Correct 18 ms 39400 KB Output is correct
16 Correct 18 ms 39448 KB Output is correct
17 Correct 20 ms 39356 KB Output is correct
18 Correct 18 ms 39380 KB Output is correct
19 Correct 115 ms 39580 KB Output is correct
20 Correct 122 ms 39572 KB Output is correct
21 Correct 124 ms 39592 KB Output is correct
22 Correct 143 ms 39628 KB Output is correct
23 Correct 859 ms 40160 KB Output is correct
24 Correct 893 ms 40056 KB Output is correct
25 Correct 976 ms 39992 KB Output is correct
26 Correct 1134 ms 40524 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39432 KB Output is correct
2 Correct 18 ms 39480 KB Output is correct
3 Correct 19 ms 39380 KB Output is correct
4 Correct 25 ms 39572 KB Output is correct
5 Correct 53 ms 39976 KB Output is correct
6 Correct 18 ms 39380 KB Output is correct
7 Correct 18 ms 39484 KB Output is correct
8 Correct 18 ms 39432 KB Output is correct
9 Correct 20 ms 39500 KB Output is correct
10 Correct 25 ms 39504 KB Output is correct
11 Correct 54 ms 39860 KB Output is correct
12 Correct 22 ms 39844 KB Output is correct
13 Correct 21 ms 39788 KB Output is correct
14 Correct 23 ms 39792 KB Output is correct
15 Correct 30 ms 39960 KB Output is correct
16 Correct 66 ms 40344 KB Output is correct
17 Correct 74 ms 47596 KB Output is correct
18 Correct 96 ms 47676 KB Output is correct
19 Correct 84 ms 47684 KB Output is correct
20 Correct 114 ms 47808 KB Output is correct
21 Correct 286 ms 50628 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 39508 KB Output is correct
2 Correct 170 ms 39592 KB Output is correct
3 Correct 773 ms 39920 KB Output is correct
4 Correct 1664 ms 40072 KB Output is correct
5 Correct 185 ms 40276 KB Output is correct
6 Correct 1671 ms 40460 KB Output is correct
7 Execution timed out 5072 ms 40660 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 18 ms 39380 KB Output is correct
3 Correct 18 ms 39460 KB Output is correct
4 Correct 19 ms 39380 KB Output is correct
5 Correct 18 ms 39380 KB Output is correct
6 Correct 17 ms 39380 KB Output is correct
7 Correct 19 ms 39380 KB Output is correct
8 Correct 21 ms 39464 KB Output is correct
9 Correct 18 ms 39420 KB Output is correct
10 Correct 17 ms 39376 KB Output is correct
11 Correct 19 ms 39372 KB Output is correct
12 Correct 19 ms 39480 KB Output is correct
13 Correct 19 ms 39380 KB Output is correct
14 Correct 18 ms 39380 KB Output is correct
15 Correct 18 ms 39400 KB Output is correct
16 Correct 18 ms 39448 KB Output is correct
17 Correct 20 ms 39356 KB Output is correct
18 Correct 18 ms 39380 KB Output is correct
19 Correct 115 ms 39580 KB Output is correct
20 Correct 122 ms 39572 KB Output is correct
21 Correct 124 ms 39592 KB Output is correct
22 Correct 143 ms 39628 KB Output is correct
23 Correct 859 ms 40160 KB Output is correct
24 Correct 893 ms 40056 KB Output is correct
25 Correct 976 ms 39992 KB Output is correct
26 Correct 1134 ms 40524 KB Output is correct
27 Correct 17 ms 39432 KB Output is correct
28 Correct 18 ms 39480 KB Output is correct
29 Correct 19 ms 39380 KB Output is correct
30 Correct 25 ms 39572 KB Output is correct
31 Correct 53 ms 39976 KB Output is correct
32 Correct 18 ms 39380 KB Output is correct
33 Correct 18 ms 39484 KB Output is correct
34 Correct 18 ms 39432 KB Output is correct
35 Correct 20 ms 39500 KB Output is correct
36 Correct 25 ms 39504 KB Output is correct
37 Correct 54 ms 39860 KB Output is correct
38 Correct 22 ms 39844 KB Output is correct
39 Correct 21 ms 39788 KB Output is correct
40 Correct 23 ms 39792 KB Output is correct
41 Correct 30 ms 39960 KB Output is correct
42 Correct 66 ms 40344 KB Output is correct
43 Correct 74 ms 47596 KB Output is correct
44 Correct 96 ms 47676 KB Output is correct
45 Correct 84 ms 47684 KB Output is correct
46 Correct 114 ms 47808 KB Output is correct
47 Correct 286 ms 50628 KB Output is correct
48 Correct 34 ms 39508 KB Output is correct
49 Correct 170 ms 39592 KB Output is correct
50 Correct 773 ms 39920 KB Output is correct
51 Correct 1664 ms 40072 KB Output is correct
52 Correct 185 ms 40276 KB Output is correct
53 Correct 1671 ms 40460 KB Output is correct
54 Execution timed out 5072 ms 40660 KB Time limit exceeded
55 Halted 0 ms 0 KB -