# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
275881 | AKaan37 | Dynamic Diameter (CEOI19_diameter) | C++17 | 2121 ms | 25192 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,x[li],y[li],z[li],mx,ind;
int cev;
multiset<int> st;
string s;
vector<PII> v[li];
inline void dfs(int node,int ata,int der){
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i].fi;
int co=v[node][i].se;
if(go==ata)continue;
dfs(go,node,der+co);
}
if(der>mx)ind=node;
mx=max(mx,der);
}
int32_t main(void){
scanf("%lld %lld %lld",&n,&t,&k);
for(int i=1;i<n;i++){
scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
st.insert(z[i]);
}
if(n*t<=5000*5000){
while(t--){
int d,e;
scanf("%lld %lld",&d,&e);
z[(d+cev)%(n-1)+1]=(cev+e)%k;
FOR v[i].clear();
for(int i=1;i<n;i++){
v[x[i]].pb({y[i],z[i]});
v[y[i]].pb({x[i],z[i]});
}
mx=0;
dfs(1,0,0);
mx=0;
dfs(ind,0,0);
cev=mx;
printf("%lld\n",cev);
}
return 0;
}
while(t--){
int d,e;
scanf("%lld %lld",&d,&e);
st.erase(st.find(z[(d+cev)%(n-1)+1]));
z[(d+cev)%(n-1)+1]=(cev+e)%k;
st.insert(z[(d+cev)%(n-1)+1]);
auto it=st.end();
if(it==st.begin()){cev=0;printf("%lld\n",cev);continue;}
it--;
cev=*it;
if(it==st.begin()){printf("%lld\n",cev);continue;}
it--;
cev+=*it;
printf("%lld\n",cev);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |