oj.uz

Submission #309699

# Submission time Handle Problem Language Result Execution time Memory
309699 2020-10-04T10:23:16 Z AmineWeslati Dynamic Diameter (CEOI19_diameter) C++14
24 / 100
 5000 ms 26340 KB 
//Never stop trying
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}


int N,Q,W;

vi adj[MX];
unordered_map<int,int> ed[MX];

int dist[MX];

void dfs(int u, int p){
	for(auto v: adj[u]) if(v!=p){
		dist[v]=dist[u]+ed[u][v];
		dfs(v,u);
	}
}

int solve(){
	FOR(i,1,N+1) dist[i]=-INF; 
	dist[1]=0;
	dfs(1,1);
	int d=0,u=1;
	FOR(i,2,N+1)
		if(dist[i]>d){
			d=dist[i];
			u=i;
		}

	FOR(i,1,N+1) dist[i]=-INF; 
	dist[u]=0;
	dfs(u,u);
	d=0;
	FOR(i,1,N+1)
		if(dist[i]>d) d=dist[i];
		
	return d;
}

int32_t main() {
	boost; 

	cin>>N>>Q>>W;
	vpi edges;
	FOR(i,0,N-1){
		int u,v,w; cin>>u>>v>>w;
		edges.pb({u,v});
		adj[u].pb(v); adj[v].pb(u);
		ed[u][v]=w; ed[v][u]=w;
	}

	int last=0;
	while(Q--){
		int i,w; cin>>i>>w;
		i=(i+last)%(N-1);
		w=(w+last)%W;
		int u=edges[i].fi,v=edges[i].se;
		ed[u][v]=ed[v][u]=w;

		int res=solve();
		cout << res << endl;
		last=res;	
	}




	return 0;
}

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

diameter.cpp: In function 'void IO()':
diameter.cpp:47:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   47 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 6 ms 8192 KB Output is correct
3 Correct 6 ms 8192 KB Output is correct
4 Correct 6 ms 8192 KB Output is correct
5 Correct 6 ms 8192 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8192 KB Output is correct
9 Correct 6 ms 8192 KB Output is correct
10 Correct 6 ms 8192 KB Output is correct
11 Correct 6 ms 8192 KB Output is correct
12 Correct 6 ms 8192 KB Output is correct
13 Correct 6 ms 8192 KB Output is correct
14 Correct 6 ms 8192 KB Output is correct
15 Correct 7 ms 8192 KB Output is correct
16 Correct 7 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 6 ms 8192 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 6 ms 8192 KB Output is correct
3 Correct 6 ms 8192 KB Output is correct
4 Correct 6 ms 8192 KB Output is correct
5 Correct 6 ms 8192 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8192 KB Output is correct
9 Correct 6 ms 8192 KB Output is correct
10 Correct 6 ms 8192 KB Output is correct
11 Correct 6 ms 8192 KB Output is correct
12 Correct 6 ms 8192 KB Output is correct
13 Correct 6 ms 8192 KB Output is correct
14 Correct 6 ms 8192 KB Output is correct
15 Correct 7 ms 8192 KB Output is correct
16 Correct 7 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 6 ms 8192 KB Output is correct
19 Correct 287 ms 8552 KB Output is correct
20 Correct 296 ms 8568 KB Output is correct
21 Correct 303 ms 8440 KB Output is correct
22 Correct 332 ms 8568 KB Output is correct
23 Correct 2220 ms 9128 KB Output is correct
24 Correct 2301 ms 9332 KB Output is correct
25 Correct 2387 ms 9464 KB Output is correct
26 Correct 2345 ms 9720 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 7 ms 8192 KB Output is correct
3 Correct 8 ms 8192 KB Output is correct
4 Correct 26 ms 8440 KB Output is correct
5 Correct 106 ms 9368 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8320 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 41 ms 8320 KB Output is correct
10 Correct 352 ms 8568 KB Output is correct
11 Correct 1752 ms 9720 KB Output is correct
12 Correct 12 ms 9088 KB Output is correct
13 Correct 43 ms 9088 KB Output is correct
14 Correct 349 ms 9088 KB Output is correct
15 Correct 3406 ms 9592 KB Output is correct
16 Execution timed out 5068 ms 9920 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 8320 KB Output is correct
2 Correct 443 ms 8440 KB Output is correct
3 Correct 2179 ms 9208 KB Output is correct
4 Correct 4381 ms 10004 KB Output is correct
5 Correct 480 ms 9980 KB Output is correct
6 Correct 4637 ms 10356 KB Output is correct
7 Execution timed out 5065 ms 10612 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5055 ms 26340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 6 ms 8192 KB Output is correct
3 Correct 6 ms 8192 KB Output is correct
4 Correct 6 ms 8192 KB Output is correct
5 Correct 6 ms 8192 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8192 KB Output is correct
9 Correct 6 ms 8192 KB Output is correct
10 Correct 6 ms 8192 KB Output is correct
11 Correct 6 ms 8192 KB Output is correct
12 Correct 6 ms 8192 KB Output is correct
13 Correct 6 ms 8192 KB Output is correct
14 Correct 6 ms 8192 KB Output is correct
15 Correct 7 ms 8192 KB Output is correct
16 Correct 7 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 6 ms 8192 KB Output is correct
19 Correct 287 ms 8552 KB Output is correct
20 Correct 296 ms 8568 KB Output is correct
21 Correct 303 ms 8440 KB Output is correct
22 Correct 332 ms 8568 KB Output is correct
23 Correct 2220 ms 9128 KB Output is correct
24 Correct 2301 ms 9332 KB Output is correct
25 Correct 2387 ms 9464 KB Output is correct
26 Correct 2345 ms 9720 KB Output is correct
27 Correct 6 ms 8192 KB Output is correct
28 Correct 7 ms 8192 KB Output is correct
29 Correct 8 ms 8192 KB Output is correct
30 Correct 26 ms 8440 KB Output is correct
31 Correct 106 ms 9368 KB Output is correct
32 Correct 6 ms 8192 KB Output is correct
33 Correct 6 ms 8320 KB Output is correct
34 Correct 10 ms 8192 KB Output is correct
35 Correct 41 ms 8320 KB Output is correct
36 Correct 352 ms 8568 KB Output is correct
37 Correct 1752 ms 9720 KB Output is correct
38 Correct 12 ms 9088 KB Output is correct
39 Correct 43 ms 9088 KB Output is correct
40 Correct 349 ms 9088 KB Output is correct
41 Correct 3406 ms 9592 KB Output is correct
42 Execution timed out 5068 ms 9920 KB Time limit exceeded
43 Halted 0 ms 0 KB -