이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,q,w,last,len[SI];
ll vis[SI],c,ans;
vector < pair < ll,ll> > v[SI];
multiset<ll> ms;
int main()
{
fast
cin>>n>>q>>w;
for (int i=0;i<n-1;i++)
{
ll a,b,c;
cin>>a>>b>>c;
c*=-1;
len[i]=c;
v[a].pb({b,i});
v[b].pb({a,i});
ms.insert(c);
}
while (q--)
{
ll d,e;
cin>>d>>e;
d=(d+last)%(n-1);
e=(e+last)%w;
ms.erase(ms.find(len[d]));
len[d]=-e;
ms.insert(-e);
ans=-1;
c++;
ll ans=0,cc=0;
for (auto y:ms)
{
if (cc==2)
break;
ans+=y;
cc++;
}
cout <<-ans<<"\n";
//for (int i=0;i<n-1;i++)\
cout<< len[i]<<" ";\
cout <<"\n";
// DFS();
last=-ans;
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
diameter.cpp:56:8: warning: multi-line comment [-Wcomment]
56 | //for (int i=0;i<n-1;i++)\
| ^
# | 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... |