oj.uz

Submission #944030

# Submission time Handle Problem Language Result Execution time Memory
944030 2024-03-12T07:16:52 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 16092 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
vector <pair <int,int> > g[N];
int a[N],b[N],c[N],d[N];
void dfs(int v,int p){
    for(auto to : g[v]){
        if(to.ff!=p){
            d[to.ff]=d[v]+c[to.ss];
            dfs(to.ff,v);
        }
    }
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,q,w;
    cin>>n>>q>>w;
    int cnt=0;
    multiset <int> ms;
    for(int i=0;i<n-1;i++){
        cin>>a[i]>>b[i]>>c[i];
        g[a[i]].pb({b[i],i});
        g[b[i]].pb({a[i],i});
        if(1==a[i])cnt++;
        ms.insert(c[i]);
    }
    bool sbtsk3=0;
    if(cnt==n-1)sbtsk3=1;
    int last=0;
    for(int i=0;i<q;i++){
        int ind,val;
        cin>>ind>>val;
        ind=(ind+last)%(n-1);
        val=(val+last)%w;
        ms.erase(ms.find(c[ind]));
        ms.insert(val);
        c[ind]=val;
        if(sbtsk3){
            int ans=*ms.rbegin();
            if(ms.size()>=2){
                auto it=ms.end();
                it--;it--;
                ans+=*it;
            }
            cout<<ans<<"\n";
            continue;
        }
        
        for(int i=1;i<=n;i++)d[i]=0;
        dfs(1,0);
        int root=1,mx=0;
        for(int i=1;i<=n;i++){
            if(mx<d[i]){
                mx=d[i];root=i;
            }
        }
        for(int i=1;i<=n;i++)d[i]=0;
        dfs(root,0);
        mx=0;
        for(int i=1;i<=n;i++)mx=max(mx,d[i]);
        last=mx;
        cout<<mx<<"\n";
    }
}
/*
 
 */

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5724 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 1 ms 5976 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 1 ms 5724 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 1 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 2 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 2 ms 5724 KB Output is correct
18 Correct 2 ms 5720 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5724 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 1 ms 5976 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 1 ms 5724 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 1 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 2 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 2 ms 5724 KB Output is correct
18 Correct 2 ms 5720 KB Output is correct
19 Correct 73 ms 5848 KB Output is correct
20 Correct 79 ms 5720 KB Output is correct
21 Correct 85 ms 5852 KB Output is correct
22 Correct 113 ms 5724 KB Output is correct
23 Correct 878 ms 6520 KB Output is correct
24 Correct 1000 ms 6484 KB Output is correct
25 Correct 1203 ms 6584 KB Output is correct
26 Correct 1379 ms 6636 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 5724 KB Output is correct
2 Correct 122 ms 6100 KB Output is correct
3 Correct 595 ms 5972 KB Output is correct
4 Correct 1197 ms 6452 KB Output is correct
5 Correct 128 ms 6744 KB Output is correct
6 Correct 1281 ms 7120 KB Output is correct
7 Execution timed out 5024 ms 7104 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 5032 ms 16092 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5724 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 1 ms 5976 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 1 ms 5724 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 1 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 2 ms 5724 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 2 ms 5724 KB Output is correct
18 Correct 2 ms 5720 KB Output is correct
19 Correct 73 ms 5848 KB Output is correct
20 Correct 79 ms 5720 KB Output is correct
21 Correct 85 ms 5852 KB Output is correct
22 Correct 113 ms 5724 KB Output is correct
23 Correct 878 ms 6520 KB Output is correct
24 Correct 1000 ms 6484 KB Output is correct
25 Correct 1203 ms 6584 KB Output is correct
26 Correct 1379 ms 6636 KB Output is correct
27 Incorrect 1 ms 5724 KB Output isn't correct
28 Halted 0 ms 0 KB -