Submission #45128

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
45128	2018-04-11T11:55:40 Z	Pajaraja	Art Exhibition (JOI18_art)	C++17	100 / 100	421 ms	219856 KB

art

#include <bits/stdc++.h>
using namespace std;
pair<long long,long long> a[500007],b[500007];
int main()
{
	int n,cnt=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++) scanf("%lld%lld",&b[i].first,&b[i].second);
	sort(b,b+n);
	for(int i=0;i<n;i++)
	{
		a[cnt].first=b[i].first;
		a[cnt].second+=b[i].second;
		if(b[i].first!=b[i+1].first) cnt++;
	}
	long long sum=0,sol=-1000000000000000000LL,minn=1000000000000000000LL;
	for(int i=0;i<cnt;i++)
	{
		minn=fmin(minn,-a[i].first+sum);
		sum+=a[i].second;
		sol=fmax(sol,sum-a[i].first-minn);
	}
	printf("%lld",sol);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
art.cpp:8:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++) scanf("%lld%lld",&b[i].first,&b[i].second);
                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	480 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	620 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	480 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	620 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	620 KB	Output is correct
14	Correct	2 ms	620 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	2 ms	620 KB	Output is correct
17	Correct	2 ms	620 KB	Output is correct
18	Correct	2 ms	620 KB	Output is correct
19	Correct	2 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 KB	Output is correct
23	Correct	2 ms	636 KB	Output is correct
24	Correct	2 ms	636 KB	Output is correct
25	Correct	2 ms	636 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	480 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	620 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	620 KB	Output is correct
14	Correct	2 ms	620 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	2 ms	620 KB	Output is correct
17	Correct	2 ms	620 KB	Output is correct
18	Correct	2 ms	620 KB	Output is correct
19	Correct	2 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 KB	Output is correct
23	Correct	2 ms	636 KB	Output is correct
24	Correct	2 ms	636 KB	Output is correct
25	Correct	2 ms	636 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct
27	Correct	4 ms	764 KB	Output is correct
28	Correct	4 ms	768 KB	Output is correct
29	Correct	4 ms	768 KB	Output is correct
30	Correct	4 ms	768 KB	Output is correct
31	Correct	4 ms	768 KB	Output is correct
32	Correct	5 ms	768 KB	Output is correct
33	Correct	5 ms	768 KB	Output is correct
34	Correct	4 ms	768 KB	Output is correct
35	Correct	4 ms	768 KB	Output is correct
36	Correct	5 ms	768 KB	Output is correct
37	Correct	4 ms	768 KB	Output is correct
38	Correct	4 ms	768 KB	Output is correct
39	Correct	6 ms	768 KB	Output is correct
40	Correct	5 ms	768 KB	Output is correct
41	Correct	5 ms	768 KB	Output is correct
42	Correct	5 ms	768 KB	Output is correct
43	Correct	5 ms	768 KB	Output is correct
44	Correct	5 ms	768 KB	Output is correct
45	Correct	6 ms	768 KB	Output is correct
46	Correct	6 ms	768 KB	Output is correct
47	Correct	4 ms	768 KB	Output is correct
48	Correct	5 ms	768 KB	Output is correct
49	Correct	6 ms	768 KB	Output is correct
50	Correct	4 ms	768 KB	Output is correct
51	Correct	6 ms	768 KB	Output is correct

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	480 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	480 KB	Output is correct
6	Correct	2 ms	480 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	620 KB	Output is correct
12	Correct	2 ms	620 KB	Output is correct
13	Correct	2 ms	620 KB	Output is correct
14	Correct	2 ms	620 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	2 ms	620 KB	Output is correct
17	Correct	2 ms	620 KB	Output is correct
18	Correct	2 ms	620 KB	Output is correct
19	Correct	2 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 KB	Output is correct
23	Correct	2 ms	636 KB	Output is correct
24	Correct	2 ms	636 KB	Output is correct
25	Correct	2 ms	636 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct
27	Correct	4 ms	764 KB	Output is correct
28	Correct	4 ms	768 KB	Output is correct
29	Correct	4 ms	768 KB	Output is correct
30	Correct	4 ms	768 KB	Output is correct
31	Correct	4 ms	768 KB	Output is correct
32	Correct	5 ms	768 KB	Output is correct
33	Correct	5 ms	768 KB	Output is correct
34	Correct	4 ms	768 KB	Output is correct
35	Correct	4 ms	768 KB	Output is correct
36	Correct	5 ms	768 KB	Output is correct
37	Correct	4 ms	768 KB	Output is correct
38	Correct	4 ms	768 KB	Output is correct
39	Correct	6 ms	768 KB	Output is correct
40	Correct	5 ms	768 KB	Output is correct
41	Correct	5 ms	768 KB	Output is correct
42	Correct	5 ms	768 KB	Output is correct
43	Correct	5 ms	768 KB	Output is correct
44	Correct	5 ms	768 KB	Output is correct
45	Correct	6 ms	768 KB	Output is correct
46	Correct	6 ms	768 KB	Output is correct
47	Correct	4 ms	768 KB	Output is correct
48	Correct	5 ms	768 KB	Output is correct
49	Correct	6 ms	768 KB	Output is correct
50	Correct	4 ms	768 KB	Output is correct
51	Correct	6 ms	768 KB	Output is correct
52	Correct	312 ms	17068 KB	Output is correct
53	Correct	300 ms	29756 KB	Output is correct
54	Correct	314 ms	42464 KB	Output is correct
55	Correct	334 ms	55108 KB	Output is correct
56	Correct	304 ms	67812 KB	Output is correct
57	Correct	308 ms	80620 KB	Output is correct
58	Correct	292 ms	93276 KB	Output is correct
59	Correct	295 ms	105828 KB	Output is correct
60	Correct	304 ms	118512 KB	Output is correct
61	Correct	283 ms	131008 KB	Output is correct
62	Correct	281 ms	143836 KB	Output is correct
63	Correct	295 ms	156356 KB	Output is correct
64	Correct	284 ms	169060 KB	Output is correct
65	Correct	284 ms	181704 KB	Output is correct
66	Correct	311 ms	194548 KB	Output is correct
67	Correct	421 ms	207104 KB	Output is correct
68	Correct	276 ms	219856 KB	Output is correct