Submission #488775

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
488775	2021-11-20T12:15:40 Z	cfalas	Dynamic Diameter (CEOI19_diameter)	C++14	0 / 100	5000 ms	18080 KB

diameter

#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

int t, n;
vi a, b;

vector<vii> adj;

ii f;

void dfs(int s, int p=-1, ll d=0){
	if(d>f.F) f = max(f, {d, s});
	FOA(v, adj[s]){
		if(v.F!=p) dfs(v.F, s, d+v.S);
	}
}

int main(){
	int q;
	ll w;
	cin>>n>>q>>w;
	adj.assign(n+1, vii());

	vector<pair<ii,ii> > edg(n-1);
	set<ii> ws;
	vi wu(n);
	FOR(i,n-1){
		ll a, b, c;
		cin>>a>>b>>c;
		ws.insert({-c, i});
		wu[i] = c;
		edg[i] = {{a, adj[a].size()}, {b, adj[b].size()}};
		adj[a].push_back({b,c});
		adj[b].push_back({a,c});
	}
	ll last=0;
	while(q--){
		ll a, b;
		cin>>a>>b;
		a= (a + last) % (n-1);
		b = (b+last) % w;

		adj[edg[a].F.F][edg[a].F.S].S = b;
		adj[edg[a].S.F][edg[a].S.S].S = b;

		f = {0,1};
		dfs(1);
		dfs(f.S);

		ws.erase({-wu[a], a});
		ws.insert({-b, a});
		wu[a] = b;


		//last = f.F;
		if(n==2) last = -(*ws.begin()).F;
		else last = -(*ws.begin()).F - (*(++ws.begin())).F;
		cout<<last<<endl;

	}
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	4 ms	204 KB	Output is correct
4	Correct	41 ms	348 KB	Output is correct
5	Correct	199 ms	592 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	12 ms	388 KB	Output is correct
10	Correct	119 ms	408 KB	Output is correct
11	Correct	574 ms	772 KB	Output is correct
12	Correct	6 ms	1100 KB	Output is correct
13	Correct	14 ms	1180 KB	Output is correct
14	Correct	93 ms	1284 KB	Output is correct
15	Correct	802 ms	1300 KB	Output is correct
16	Correct	4207 ms	1880 KB	Output is correct
17	Correct	146 ms	17460 KB	Output is correct
18	Correct	436 ms	17560 KB	Output is correct
19	Correct	3198 ms	17664 KB	Output is correct
20	Execution timed out	5009 ms	17596 KB	Time limit exceeded
21	Halted	0 ms	0 KB	-