oj.uz

Submission #275865

# Submission time Handle Problem Language Result Execution time Memory
275865 2020-08-20T08:06:15 Z AKaan37 Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 20332 KB 
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,x[li],y[li],z[li],mx,ind;
int cev;
string s;
vector<PII> v[li];

inline void dfs(int node,int ata,int der){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		int co=v[node][i].se;
		if(go==ata)continue;
		dfs(go,node,der+co);
	}
	if(der>mx)ind=node;
	mx=max(mx,der);
}

int32_t main(void){
	scanf("%lld %lld %lld",&n,&t,&k);
	for(int i=1;i<n;i++){
		scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
	}
	while(t--){
		int d,e;
		scanf("%lld %lld",&d,&e);
		z[(d+cev)%(n-1)+1]=(cev+e)%k;
		FOR v[i].clear();
		for(int i=1;i<n;i++){
			v[x[i]].pb({y[i],z[i]});
			v[y[i]].pb({x[i],z[i]});
		}
		mx=0;
		dfs(1,0,0);
		mx=0;
		dfs(ind,0,0);
		cev=mx;
		printf("%lld\n",cev);
	}
	return 0;
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   47 |  scanf("%lld %lld %lld",&n,&t,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   49 |   scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:53:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |   scanf("%lld %lld",&d,&e);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 9 ms 12160 KB Output is correct
3 Correct 9 ms 12160 KB Output is correct
4 Correct 9 ms 12032 KB Output is correct
5 Correct 9 ms 12064 KB Output is correct
6 Correct 8 ms 12032 KB Output is correct
7 Correct 10 ms 12032 KB Output is correct
8 Correct 9 ms 12032 KB Output is correct
9 Correct 9 ms 12032 KB Output is correct
10 Correct 9 ms 12032 KB Output is correct
11 Correct 9 ms 12032 KB Output is correct
12 Correct 8 ms 12032 KB Output is correct
13 Correct 9 ms 12032 KB Output is correct
14 Correct 9 ms 12032 KB Output is correct
15 Correct 9 ms 12032 KB Output is correct
16 Correct 9 ms 12032 KB Output is correct
17 Correct 11 ms 12032 KB Output is correct
18 Correct 9 ms 12160 KB Output is correct
19 Correct 281 ms 12292 KB Output is correct
20 Correct 271 ms 12292 KB Output is correct
21 Correct 315 ms 12444 KB Output is correct
22 Correct 327 ms 12312 KB Output is correct
23 Correct 1851 ms 12888 KB Output is correct
24 Correct 1990 ms 12900 KB Output is correct
25 Correct 2031 ms 12960 KB Output is correct
26 Correct 2173 ms 13428 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 10 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 30 ms 12288 KB Output is correct
5 Correct 109 ms 13176 KB Output is correct
6 Correct 8 ms 12032 KB Output is correct
7 Correct 10 ms 12160 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 43 ms 12288 KB Output is correct
10 Correct 316 ms 12408 KB Output is correct
11 Correct 1589 ms 13436 KB Output is correct
12 Correct 14 ms 12544 KB Output is correct
13 Correct 43 ms 12544 KB Output is correct
14 Correct 310 ms 12612 KB Output is correct
15 Correct 3063 ms 13096 KB Output is correct
16 Execution timed out 5011 ms 13252 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 12232 KB Output is correct
2 Correct 410 ms 12364 KB Output is correct
3 Correct 1877 ms 13020 KB Output is correct
4 Correct 3622 ms 13352 KB Output is correct
5 Correct 371 ms 13180 KB Output is correct
6 Correct 3728 ms 13552 KB Output is correct
7 Execution timed out 5083 ms 13460 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 5058 ms 20332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 9 ms 12160 KB Output is correct
3 Correct 9 ms 12160 KB Output is correct
4 Correct 9 ms 12032 KB Output is correct
5 Correct 9 ms 12064 KB Output is correct
6 Correct 8 ms 12032 KB Output is correct
7 Correct 10 ms 12032 KB Output is correct
8 Correct 9 ms 12032 KB Output is correct
9 Correct 9 ms 12032 KB Output is correct
10 Correct 9 ms 12032 KB Output is correct
11 Correct 9 ms 12032 KB Output is correct
12 Correct 8 ms 12032 KB Output is correct
13 Correct 9 ms 12032 KB Output is correct
14 Correct 9 ms 12032 KB Output is correct
15 Correct 9 ms 12032 KB Output is correct
16 Correct 9 ms 12032 KB Output is correct
17 Correct 11 ms 12032 KB Output is correct
18 Correct 9 ms 12160 KB Output is correct
19 Correct 281 ms 12292 KB Output is correct
20 Correct 271 ms 12292 KB Output is correct
21 Correct 315 ms 12444 KB Output is correct
22 Correct 327 ms 12312 KB Output is correct
23 Correct 1851 ms 12888 KB Output is correct
24 Correct 1990 ms 12900 KB Output is correct
25 Correct 2031 ms 12960 KB Output is correct
26 Correct 2173 ms 13428 KB Output is correct
27 Correct 9 ms 12032 KB Output is correct
28 Correct 10 ms 12032 KB Output is correct
29 Correct 11 ms 12160 KB Output is correct
30 Correct 30 ms 12288 KB Output is correct
31 Correct 109 ms 13176 KB Output is correct
32 Correct 8 ms 12032 KB Output is correct
33 Correct 10 ms 12160 KB Output is correct
34 Correct 12 ms 12160 KB Output is correct
35 Correct 43 ms 12288 KB Output is correct
36 Correct 316 ms 12408 KB Output is correct
37 Correct 1589 ms 13436 KB Output is correct
38 Correct 14 ms 12544 KB Output is correct
39 Correct 43 ms 12544 KB Output is correct
40 Correct 310 ms 12612 KB Output is correct
41 Correct 3063 ms 13096 KB Output is correct
42 Execution timed out 5011 ms 13252 KB Time limit exceeded
43 Halted 0 ms 0 KB -