Submission #50709

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
50709	2018-06-13T03:32:02 Z	gnoor	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	39812 KB

art

#include <cstdio>
#include <map>
#include <algorithm>
#include <vector>

using namespace std;

map<long long,long long> mp;

long long sz[500100];
long long val[500100];

int main () {
	int n;
	scanf("%d",&n);
	long long a,b;
	for (int i=0;i<n;i++) {
		scanf("%lld%lld",&a,&b);
		mp[a]+=b;
	}
	int nn=0;
	for (auto &i:mp) {
		//printf("%lld %lld\n",i.first,i.second);
		sz[nn]=i.first;
		val[nn]=i.second;
		if (nn) val[nn]+=val[nn-1];
		nn++;
	}
	long long mnn=-sz[0];
	long long ans=0;
	for (int i=0;i<nn;i++) {
		ans=max(ans,val[i]-sz[i]-mnn);
		mnn=min(mnn,val[i]-sz[i+1]);
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
art.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&a,&b);
   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	420 KB	Output is correct
2	Correct	2 ms	420 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	536 KB	Output is correct
10	Correct	2 ms	536 KB	Output is correct
11	Correct	2 ms	536 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	420 KB	Output is correct
2	Correct	2 ms	420 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	536 KB	Output is correct
10	Correct	2 ms	536 KB	Output is correct
11	Correct	2 ms	536 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	2 ms	616 KB	Output is correct
14	Correct	2 ms	616 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	3 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	2 ms	620 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	420 KB	Output is correct
2	Correct	2 ms	420 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	536 KB	Output is correct
10	Correct	2 ms	536 KB	Output is correct
11	Correct	2 ms	536 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	2 ms	616 KB	Output is correct
14	Correct	2 ms	616 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	3 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	2 ms	620 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct
27	Correct	6 ms	892 KB	Output is correct
28	Correct	6 ms	896 KB	Output is correct
29	Correct	7 ms	896 KB	Output is correct
30	Correct	6 ms	896 KB	Output is correct
31	Correct	6 ms	896 KB	Output is correct
32	Correct	7 ms	896 KB	Output is correct
33	Correct	6 ms	896 KB	Output is correct
34	Correct	6 ms	896 KB	Output is correct
35	Correct	5 ms	1020 KB	Output is correct
36	Correct	5 ms	1020 KB	Output is correct
37	Correct	5 ms	1020 KB	Output is correct
38	Correct	6 ms	1020 KB	Output is correct
39	Correct	5 ms	1020 KB	Output is correct
40	Correct	6 ms	1020 KB	Output is correct
41	Correct	5 ms	1020 KB	Output is correct
42	Correct	5 ms	1020 KB	Output is correct
43	Correct	5 ms	1020 KB	Output is correct
44	Correct	5 ms	1020 KB	Output is correct
45	Correct	5 ms	1020 KB	Output is correct
46	Correct	5 ms	1020 KB	Output is correct
47	Correct	5 ms	1020 KB	Output is correct
48	Correct	5 ms	1020 KB	Output is correct
49	Correct	5 ms	1020 KB	Output is correct
50	Correct	6 ms	1020 KB	Output is correct
51	Correct	5 ms	1020 KB	Output is correct

Subtask #4

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	420 KB	Output is correct
2	Correct	2 ms	420 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	536 KB	Output is correct
10	Correct	2 ms	536 KB	Output is correct
11	Correct	2 ms	536 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	2 ms	616 KB	Output is correct
14	Correct	2 ms	616 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	3 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	2 ms	620 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct
27	Correct	6 ms	892 KB	Output is correct
28	Correct	6 ms	896 KB	Output is correct
29	Correct	7 ms	896 KB	Output is correct
30	Correct	6 ms	896 KB	Output is correct
31	Correct	6 ms	896 KB	Output is correct
32	Correct	7 ms	896 KB	Output is correct
33	Correct	6 ms	896 KB	Output is correct
34	Correct	6 ms	896 KB	Output is correct
35	Correct	5 ms	1020 KB	Output is correct
36	Correct	5 ms	1020 KB	Output is correct
37	Correct	5 ms	1020 KB	Output is correct
38	Correct	6 ms	1020 KB	Output is correct
39	Correct	5 ms	1020 KB	Output is correct
40	Correct	6 ms	1020 KB	Output is correct
41	Correct	5 ms	1020 KB	Output is correct
42	Correct	5 ms	1020 KB	Output is correct
43	Correct	5 ms	1020 KB	Output is correct
44	Correct	5 ms	1020 KB	Output is correct
45	Correct	5 ms	1020 KB	Output is correct
46	Correct	5 ms	1020 KB	Output is correct
47	Correct	5 ms	1020 KB	Output is correct
48	Correct	5 ms	1020 KB	Output is correct
49	Correct	5 ms	1020 KB	Output is correct
50	Correct	6 ms	1020 KB	Output is correct
51	Correct	5 ms	1020 KB	Output is correct
52	Correct	898 ms	39664 KB	Output is correct
53	Correct	999 ms	39676 KB	Output is correct
54	Correct	895 ms	39740 KB	Output is correct
55	Correct	864 ms	39804 KB	Output is correct
56	Execution timed out	1008 ms	39812 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-