# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210851 | Lawliet | Dynamic Diameter (CEOI19_diameter) | C++17 | 408 ms | 10828 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.
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
const int MAXN = 100010;
int n, q;
int weight[MAXN];
lli maxW;
lli lastAns;
multiset< lli > w;
lli diameter()
{
lli sum = 0;
auto it = w.end();
it--;
sum += *it;
it--;
sum += *it;
return sum;
}
int main()
{
scanf("%d %d %lld",&n,&q,&maxW);
w.insert( 0 );
for(int i = 1 ; i < n ; i++)
{
int U, V, W;
scanf("%d %d %d",&U,&V,&W);
w.insert( W );
weight[i] = W;
}
diameter();
for(int i = 1 ; i <= q ; i++)
{
lli d, e;
scanf("%lld %lld",&d,&e);
d = ( d + lastAns )%( n - 1 ) + 1;
e = ( e + lastAns )%maxW;
w.erase( w.find( weight[d] ) );
weight[d] = e;
w.insert( weight[d] );
lastAns = diameter();
printf("%lld\n",lastAns);
}
}
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... |