Submission #210851

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
210851	2020-03-18T21:37:21 Z	Lawliet	Dynamic Diameter (CEOI19_diameter)	C++17	7 / 100	408 ms	10828 KB

diameter

#include <bits/stdc++.h>
 
using namespace std;
typedef long long int lli;
 
const int MAXN = 100010;
 
int n, q;
 
int weight[MAXN];
 
lli maxW;
lli lastAns;
 
multiset< lli > w;
 
lli diameter()
{
	lli sum = 0;
	auto it = w.end();
 
	it--;
	sum += *it;
 
	it--;
	sum += *it;
 
	return sum;
}
 
int main()
{
	scanf("%d %d %lld",&n,&q,&maxW);
 
	w.insert( 0 );
 
	for(int i = 1 ; i < n ; i++)
	{
		int U, V, W;
		scanf("%d %d %d",&U,&V,&W);
 
		w.insert( W );
		weight[i] = W;
	}
 
	diameter();
 
	for(int i = 1 ; i <= q ; i++)
	{
		lli d, e;
		scanf("%lld %lld",&d,&e);
 
		d = ( d + lastAns )%( n - 1 ) + 1;
		e = ( e + lastAns )%maxW;
 
		w.erase( w.find( weight[d] ) );
		weight[d] = e;
		w.insert( weight[d] );
 
		lastAns = diameter();
		printf("%lld\n",lastAns);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %lld",&n,&q,&maxW);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&U,&V,&W);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~
diameter.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&d,&e);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	7 ms	256 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	8 ms	292 KB	Output is correct
2	Correct	8 ms	316 KB	Output is correct
3	Correct	9 ms	384 KB	Output is correct
4	Correct	27 ms	532 KB	Output is correct
5	Correct	93 ms	1504 KB	Output is correct
6	Correct	7 ms	256 KB	Output is correct
7	Correct	7 ms	276 KB	Output is correct
8	Correct	8 ms	376 KB	Output is correct
9	Correct	8 ms	376 KB	Output is correct
10	Correct	28 ms	604 KB	Output is correct
11	Correct	94 ms	888 KB	Output is correct
12	Correct	11 ms	636 KB	Output is correct
13	Correct	12 ms	632 KB	Output is correct
14	Correct	15 ms	632 KB	Output is correct
15	Correct	38 ms	932 KB	Output is correct
16	Correct	113 ms	2140 KB	Output is correct
17	Correct	128 ms	6740 KB	Output is correct
18	Correct	123 ms	6580 KB	Output is correct
19	Correct	129 ms	6812 KB	Output is correct
20	Correct	128 ms	6980 KB	Output is correct
21	Correct	368 ms	8400 KB	Output is correct