Submission #272077

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
272077	2020-08-18T08:38:35 Z	okaragul	Art Exhibition (JOI18_art)	C++17	100 / 100	329 ms	21112 KB

art

#include<bits/stdc++.h>
using namespace std;

#define lli long long
#define INF LONG_LONG_MAX
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define endl '\n'
#define max(aa, bb) (aa > bb ? aa:bb)
#define min(aa, bb) (aa < bb ? aa:bb)
#define all(aa) aa.begin(), aa.end()

int main(){
	lli n;
	scanf("%lld", &n);
	
	vector<pair<lli,lli>>v(n);
	for(auto &it:v){
		scanf("%lld %lld", &it.st, &it.nd);
	}

	sort(all(v));

	lli tmp=v[0].nd, cvp=0;

	for(lli i=1;i<n;i++){
		tmp=max(tmp-v[i].st+v[i-1].st+v[i].nd, v[i].nd);
		cvp=max(cvp, tmp);
	}
	printf("%lld ", cvp);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |  scanf("%lld", &n);
      |  ~~~~~^~~~~~~~~~~~
art.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |   scanf("%lld %lld", &it.st, &it.nd);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	1 ms	288 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	256 KB	Output is correct

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	1 ms	288 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	256 KB	Output is correct
27	Correct	4 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	4 ms	384 KB	Output is correct
34	Correct	4 ms	384 KB	Output is correct
35	Correct	3 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	4 ms	384 KB	Output is correct
39	Correct	3 ms	384 KB	Output is correct
40	Correct	3 ms	384 KB	Output is correct
41	Correct	3 ms	384 KB	Output is correct
42	Correct	3 ms	384 KB	Output is correct
43	Correct	3 ms	384 KB	Output is correct
44	Correct	3 ms	384 KB	Output is correct
45	Correct	3 ms	384 KB	Output is correct
46	Correct	3 ms	384 KB	Output is correct
47	Correct	3 ms	384 KB	Output is correct
48	Correct	4 ms	384 KB	Output is correct
49	Correct	3 ms	384 KB	Output is correct
50	Correct	3 ms	384 KB	Output is correct
51	Correct	4 ms	384 KB	Output is correct
52	Correct	270 ms	8312 KB	Output is correct
53	Correct	277 ms	20856 KB	Output is correct
54	Correct	316 ms	20984 KB	Output is correct
55	Correct	323 ms	20856 KB	Output is correct
56	Correct	270 ms	20856 KB	Output is correct
57	Correct	271 ms	20856 KB	Output is correct
58	Correct	327 ms	21112 KB	Output is correct
59	Correct	316 ms	20856 KB	Output is correct
60	Correct	269 ms	20856 KB	Output is correct
61	Correct	329 ms	20856 KB	Output is correct
62	Correct	313 ms	20872 KB	Output is correct
63	Correct	309 ms	20876 KB	Output is correct
64	Correct	281 ms	20860 KB	Output is correct
65	Correct	279 ms	21000 KB	Output is correct
66	Correct	288 ms	20856 KB	Output is correct
67	Correct	285 ms	20856 KB	Output is correct
68	Correct	273 ms	20856 KB	Output is correct