oj.uz

답안 #658522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658522 2022-11-13T12:13:44 Z mychecksedad Dynamic Diameter (CEOI19_diameter) C++17
18 / 100
 5000 ms 321356 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;
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;
}

void dfs(int v, int p){
    pair<ll, ll> best = {0, 0};    
    dp[v] = 0;
    for(int E: g[v]){
        auto e = edges[E];
        int u = e.first;
        if(u == p) continue;

        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;
        }
        dps[v].insert(dp[u] + e.second);
    }
    answers.insert(best.first + best.second);
}

void solve(){
    cin >> n >> q >> w;
    bool case3 = 1, case4 = 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;
        if(v/2 != u && u/2 != v) case4 = 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 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();
            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:125:16: warning: unused variable 'aa' [-Wunused-variable]
  125 |     int T = 1, aa;
      |                ^~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 86484 KB Output is correct
2 Correct 40 ms 86468 KB Output is correct
3 Correct 37 ms 86400 KB Output is correct
4 Correct 41 ms 86464 KB Output is correct
5 Correct 38 ms 86432 KB Output is correct
6 Correct 38 ms 86476 KB Output is correct
7 Correct 39 ms 86632 KB Output is correct
8 Correct 45 ms 86568 KB Output is correct
9 Correct 48 ms 86552 KB Output is correct
10 Correct 46 ms 86664 KB Output is correct
11 Correct 40 ms 86652 KB Output is correct
12 Correct 38 ms 86560 KB Output is correct
13 Correct 44 ms 86844 KB Output is correct
14 Correct 40 ms 86868 KB Output is correct
15 Correct 43 ms 86792 KB Output is correct
16 Correct 41 ms 86904 KB Output is correct
17 Correct 40 ms 86860 KB Output is correct
18 Correct 44 ms 86916 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 86484 KB Output is correct
2 Correct 40 ms 86468 KB Output is correct
3 Correct 37 ms 86400 KB Output is correct
4 Correct 41 ms 86464 KB Output is correct
5 Correct 38 ms 86432 KB Output is correct
6 Correct 38 ms 86476 KB Output is correct
7 Correct 39 ms 86632 KB Output is correct
8 Correct 45 ms 86568 KB Output is correct
9 Correct 48 ms 86552 KB Output is correct
10 Correct 46 ms 86664 KB Output is correct
11 Correct 40 ms 86652 KB Output is correct
12 Correct 38 ms 86560 KB Output is correct
13 Correct 44 ms 86844 KB Output is correct
14 Correct 40 ms 86868 KB Output is correct
15 Correct 43 ms 86792 KB Output is correct
16 Correct 41 ms 86904 KB Output is correct
17 Correct 40 ms 86860 KB Output is correct
18 Correct 44 ms 86916 KB Output is correct
19 Correct 4397 ms 321172 KB Output is correct
20 Correct 4383 ms 321356 KB Output is correct
21 Correct 4627 ms 321216 KB Output is correct
22 Correct 3035 ms 321252 KB Output is correct
23 Execution timed out 5041 ms 268388 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 86448 KB Output is correct
2 Correct 48 ms 86376 KB Output is correct
3 Correct 45 ms 86412 KB Output is correct
4 Correct 48 ms 86524 KB Output is correct
5 Correct 80 ms 86780 KB Output is correct
6 Correct 54 ms 86400 KB Output is correct
7 Correct 49 ms 86480 KB Output is correct
8 Correct 44 ms 86460 KB Output is correct
9 Correct 51 ms 86476 KB Output is correct
10 Correct 63 ms 86552 KB Output is correct
11 Correct 102 ms 86912 KB Output is correct
12 Correct 52 ms 86844 KB Output is correct
13 Correct 54 ms 86844 KB Output is correct
14 Correct 51 ms 86868 KB Output is correct
15 Correct 54 ms 86880 KB Output is correct
16 Correct 100 ms 87288 KB Output is correct
17 Correct 157 ms 94556 KB Output is correct
18 Correct 119 ms 94584 KB Output is correct
19 Correct 151 ms 94580 KB Output is correct
20 Correct 173 ms 94676 KB Output is correct
21 Correct 334 ms 95256 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 112 ms 175240 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5106 ms 247004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 86484 KB Output is correct
2 Correct 40 ms 86468 KB Output is correct
3 Correct 37 ms 86400 KB Output is correct
4 Correct 41 ms 86464 KB Output is correct
5 Correct 38 ms 86432 KB Output is correct
6 Correct 38 ms 86476 KB Output is correct
7 Correct 39 ms 86632 KB Output is correct
8 Correct 45 ms 86568 KB Output is correct
9 Correct 48 ms 86552 KB Output is correct
10 Correct 46 ms 86664 KB Output is correct
11 Correct 40 ms 86652 KB Output is correct
12 Correct 38 ms 86560 KB Output is correct
13 Correct 44 ms 86844 KB Output is correct
14 Correct 40 ms 86868 KB Output is correct
15 Correct 43 ms 86792 KB Output is correct
16 Correct 41 ms 86904 KB Output is correct
17 Correct 40 ms 86860 KB Output is correct
18 Correct 44 ms 86916 KB Output is correct
19 Correct 4397 ms 321172 KB Output is correct
20 Correct 4383 ms 321356 KB Output is correct
21 Correct 4627 ms 321216 KB Output is correct
22 Correct 3035 ms 321252 KB Output is correct
23 Execution timed out 5041 ms 268388 KB Time limit exceeded
24 Halted 0 ms 0 KB -