Submission #524659

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
524659	2022-02-09T18:19:22 Z	ammar2000	Dynamic Diameter (CEOI19_diameter)	C++17	7 / 100	231 ms	21808 KB

diameter

#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;
}

Compilation message

diameter.cpp:56:8: warning: multi-line comment [-Wcomment]
   56 |        //for (int i=0;i<n-1;i++)\
      |        ^

Subtask #1
0 / 11.0

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

Subtask #2
0 / 13.0

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

Subtask #3
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	7372 KB	Output is correct
2	Correct	4 ms	7372 KB	Output is correct
3	Correct	4 ms	7372 KB	Output is correct
4	Correct	11 ms	7568 KB	Output is correct
5	Correct	36 ms	8232 KB	Output is correct
6	Correct	4 ms	7372 KB	Output is correct
7	Correct	4 ms	7372 KB	Output is correct
8	Correct	4 ms	7312 KB	Output is correct
9	Correct	5 ms	7376 KB	Output is correct
10	Correct	12 ms	7640 KB	Output is correct
11	Correct	38 ms	8640 KB	Output is correct
12	Correct	6 ms	7884 KB	Output is correct
13	Correct	7 ms	7888 KB	Output is correct
14	Correct	7 ms	7892 KB	Output is correct
15	Correct	15 ms	8140 KB	Output is correct
16	Correct	48 ms	9344 KB	Output is correct
17	Correct	77 ms	18716 KB	Output is correct
18	Correct	85 ms	18744 KB	Output is correct
19	Correct	82 ms	18744 KB	Output is correct
20	Correct	86 ms	19124 KB	Output is correct
21	Correct	178 ms	20396 KB	Output is correct