Submission #354363

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
354363	2021-01-21T19:35:11 Z	David_M	Art Exhibition (JOI18_art)	C++14	100 / 100	556 ms	8316 KB

art

#include<bits/stdc++.h>
#define F first
#define S second
#define ll long long
using namespace std;
ll i,n,a,A;
pair<ll,ll>p[500005];
int main(){
	cin>>n;
	for(i=1;i<=n;i++)cin>>p[i].F>>p[i].S;
	sort(p+1,p+n+1);
    for(i=1;i<=n;i++)
        A=max(A,a+p[i].S),
        a+=p[i].F+p[i].S-p[i+1].F,a*=(a>0);
	cout<<A;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:12:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   12 |     for(i=1;i<=n;i++)
      |     ^~~
art.cpp:15:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   15 |  cout<<A;
      |  ^~~~

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	376 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	6 ms	364 KB	Output is correct
28	Correct	6 ms	364 KB	Output is correct
29	Correct	6 ms	364 KB	Output is correct
30	Correct	6 ms	364 KB	Output is correct
31	Correct	6 ms	364 KB	Output is correct
32	Correct	6 ms	364 KB	Output is correct
33	Correct	7 ms	364 KB	Output is correct
34	Correct	6 ms	364 KB	Output is correct
35	Correct	7 ms	364 KB	Output is correct
36	Correct	7 ms	364 KB	Output is correct
37	Correct	6 ms	364 KB	Output is correct
38	Correct	6 ms	364 KB	Output is correct
39	Correct	6 ms	364 KB	Output is correct
40	Correct	6 ms	364 KB	Output is correct
41	Correct	6 ms	364 KB	Output is correct
42	Correct	6 ms	384 KB	Output is correct
43	Correct	6 ms	364 KB	Output is correct
44	Correct	6 ms	364 KB	Output is correct
45	Correct	6 ms	364 KB	Output is correct
46	Correct	6 ms	364 KB	Output is correct
47	Correct	6 ms	364 KB	Output is correct
48	Correct	6 ms	364 KB	Output is correct
49	Correct	6 ms	364 KB	Output is correct
50	Correct	6 ms	364 KB	Output is correct
51	Correct	6 ms	364 KB	Output is correct
52	Correct	541 ms	8084 KB	Output is correct
53	Correct	544 ms	8172 KB	Output is correct
54	Correct	553 ms	8080 KB	Output is correct
55	Correct	552 ms	8172 KB	Output is correct
56	Correct	543 ms	8172 KB	Output is correct
57	Correct	548 ms	8300 KB	Output is correct
58	Correct	540 ms	8172 KB	Output is correct
59	Correct	553 ms	8168 KB	Output is correct
60	Correct	545 ms	8216 KB	Output is correct
61	Correct	543 ms	8172 KB	Output is correct
62	Correct	540 ms	8172 KB	Output is correct
63	Correct	546 ms	8172 KB	Output is correct
64	Correct	556 ms	8300 KB	Output is correct
65	Correct	543 ms	8172 KB	Output is correct
66	Correct	544 ms	8172 KB	Output is correct
67	Correct	544 ms	8316 KB	Output is correct
68	Correct	545 ms	8300 KB	Output is correct