oj.uz

Submission #658514

# Submission time Handle Problem Language Result Execution time Memory
658514 2022-11-13T11:56:17 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 45792 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);

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;
    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);
        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;
        edges[2*d].second = edges[2*d+1].second = x;

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39380 KB Output is correct
2 Correct 17 ms 39380 KB Output is correct
3 Correct 18 ms 39384 KB Output is correct
4 Correct 19 ms 39528 KB Output is correct
5 Correct 18 ms 39380 KB Output is correct
6 Correct 19 ms 39392 KB Output is correct
7 Correct 22 ms 39464 KB Output is correct
8 Correct 20 ms 39380 KB Output is correct
9 Correct 19 ms 39380 KB Output is correct
10 Correct 18 ms 39452 KB Output is correct
11 Correct 18 ms 39380 KB Output is correct
12 Correct 19 ms 39416 KB Output is correct
13 Correct 18 ms 39384 KB Output is correct
14 Correct 18 ms 39488 KB Output is correct
15 Correct 18 ms 39408 KB Output is correct
16 Correct 18 ms 39368 KB Output is correct
17 Correct 19 ms 39484 KB Output is correct
18 Correct 21 ms 39404 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39380 KB Output is correct
2 Correct 17 ms 39380 KB Output is correct
3 Correct 18 ms 39384 KB Output is correct
4 Correct 19 ms 39528 KB Output is correct
5 Correct 18 ms 39380 KB Output is correct
6 Correct 19 ms 39392 KB Output is correct
7 Correct 22 ms 39464 KB Output is correct
8 Correct 20 ms 39380 KB Output is correct
9 Correct 19 ms 39380 KB Output is correct
10 Correct 18 ms 39452 KB Output is correct
11 Correct 18 ms 39380 KB Output is correct
12 Correct 19 ms 39416 KB Output is correct
13 Correct 18 ms 39384 KB Output is correct
14 Correct 18 ms 39488 KB Output is correct
15 Correct 18 ms 39408 KB Output is correct
16 Correct 18 ms 39368 KB Output is correct
17 Correct 19 ms 39484 KB Output is correct
18 Correct 21 ms 39404 KB Output is correct
19 Correct 114 ms 39584 KB Output is correct
20 Correct 117 ms 39580 KB Output is correct
21 Correct 124 ms 39592 KB Output is correct
22 Correct 146 ms 39764 KB Output is correct
23 Correct 755 ms 39800 KB Output is correct
24 Correct 815 ms 39956 KB Output is correct
25 Correct 865 ms 39900 KB Output is correct
26 Correct 1035 ms 40392 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39380 KB Output is correct
2 Correct 21 ms 39380 KB Output is correct
3 Correct 18 ms 39500 KB Output is correct
4 Correct 26 ms 39588 KB Output is correct
5 Correct 58 ms 40504 KB Output is correct
6 Correct 18 ms 39380 KB Output is correct
7 Correct 18 ms 39380 KB Output is correct
8 Correct 20 ms 39392 KB Output is correct
9 Correct 32 ms 39496 KB Output is correct
10 Correct 120 ms 39864 KB Output is correct
11 Correct 505 ms 40808 KB Output is correct
12 Correct 20 ms 39752 KB Output is correct
13 Correct 29 ms 39704 KB Output is correct
14 Correct 115 ms 39772 KB Output is correct
15 Correct 963 ms 40100 KB Output is correct
16 Correct 4729 ms 41396 KB Output is correct
17 Correct 65 ms 44868 KB Output is correct
18 Correct 241 ms 44956 KB Output is correct
19 Correct 1948 ms 45132 KB Output is correct
20 Execution timed out 5053 ms 45324 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 39480 KB Output is correct
2 Correct 156 ms 39588 KB Output is correct
3 Correct 717 ms 40324 KB Output is correct
4 Correct 1396 ms 41036 KB Output is correct
5 Correct 165 ms 40004 KB Output is correct
6 Correct 1423 ms 40344 KB Output is correct
7 Execution timed out 5048 ms 40960 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 5034 ms 45792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39380 KB Output is correct
2 Correct 17 ms 39380 KB Output is correct
3 Correct 18 ms 39384 KB Output is correct
4 Correct 19 ms 39528 KB Output is correct
5 Correct 18 ms 39380 KB Output is correct
6 Correct 19 ms 39392 KB Output is correct
7 Correct 22 ms 39464 KB Output is correct
8 Correct 20 ms 39380 KB Output is correct
9 Correct 19 ms 39380 KB Output is correct
10 Correct 18 ms 39452 KB Output is correct
11 Correct 18 ms 39380 KB Output is correct
12 Correct 19 ms 39416 KB Output is correct
13 Correct 18 ms 39384 KB Output is correct
14 Correct 18 ms 39488 KB Output is correct
15 Correct 18 ms 39408 KB Output is correct
16 Correct 18 ms 39368 KB Output is correct
17 Correct 19 ms 39484 KB Output is correct
18 Correct 21 ms 39404 KB Output is correct
19 Correct 114 ms 39584 KB Output is correct
20 Correct 117 ms 39580 KB Output is correct
21 Correct 124 ms 39592 KB Output is correct
22 Correct 146 ms 39764 KB Output is correct
23 Correct 755 ms 39800 KB Output is correct
24 Correct 815 ms 39956 KB Output is correct
25 Correct 865 ms 39900 KB Output is correct
26 Correct 1035 ms 40392 KB Output is correct
27 Correct 18 ms 39380 KB Output is correct
28 Correct 21 ms 39380 KB Output is correct
29 Correct 18 ms 39500 KB Output is correct
30 Correct 26 ms 39588 KB Output is correct
31 Correct 58 ms 40504 KB Output is correct
32 Correct 18 ms 39380 KB Output is correct
33 Correct 18 ms 39380 KB Output is correct
34 Correct 20 ms 39392 KB Output is correct
35 Correct 32 ms 39496 KB Output is correct
36 Correct 120 ms 39864 KB Output is correct
37 Correct 505 ms 40808 KB Output is correct
38 Correct 20 ms 39752 KB Output is correct
39 Correct 29 ms 39704 KB Output is correct
40 Correct 115 ms 39772 KB Output is correct
41 Correct 963 ms 40100 KB Output is correct
42 Correct 4729 ms 41396 KB Output is correct
43 Correct 65 ms 44868 KB Output is correct
44 Correct 241 ms 44956 KB Output is correct
45 Correct 1948 ms 45132 KB Output is correct
46 Execution timed out 5053 ms 45324 KB Time limit exceeded
47 Halted 0 ms 0 KB -