Submission #241154

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
241154	2020-06-23T06:38:03 Z	jiahng	Art Exhibition (JOI18_art)	C++14	50 / 100	230 ms	16120 KB

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

typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0)
#define maxn 500001
#define int ll
int N;
pi A[maxn];
int ss[maxn],mn[maxn];

int32_t main(){
	fast;
	
	cin>>N;
	
	FOR(i,1,N) cin>>A[i].f>>A[i].s;
	
	sort(A+1,A+N+1);
	
	FOR(i,1,N) ss[i] = ss[i-1] + A[i].s;
	
	FOR(i,0,N-1) ss[i] -= A[i+1].f;
	
	mn[0] = ss[0];
	FOR(i,1,N) mn[i] = min(mn[i-1],ss[i]);
		
	int ans = 0; bool f = 1;
	
	FOR(i,1,N){
		if (f) ans = ss[i] + A[i+1].f - A[i].f - mn[i-1];
		ans = max((ll)ans,ss[i] + A[i+1].f - A[i].f - mn[i-1]);
		f = 0;
	}
	
	cout<<ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	6 ms	512 KB	Output is correct
28	Correct	6 ms	512 KB	Output is correct
29	Correct	6 ms	512 KB	Output is correct
30	Correct	7 ms	512 KB	Output is correct
31	Correct	7 ms	512 KB	Output is correct
32	Correct	6 ms	512 KB	Output is correct
33	Correct	6 ms	512 KB	Output is correct
34	Correct	6 ms	512 KB	Output is correct
35	Correct	8 ms	512 KB	Output is correct
36	Correct	7 ms	512 KB	Output is correct
37	Correct	6 ms	512 KB	Output is correct
38	Correct	6 ms	512 KB	Output is correct
39	Correct	7 ms	512 KB	Output is correct
40	Correct	7 ms	512 KB	Output is correct
41	Correct	7 ms	512 KB	Output is correct
42	Correct	7 ms	512 KB	Output is correct
43	Correct	6 ms	512 KB	Output is correct
44	Correct	6 ms	512 KB	Output is correct
45	Correct	7 ms	640 KB	Output is correct
46	Correct	6 ms	512 KB	Output is correct
47	Correct	7 ms	640 KB	Output is correct
48	Correct	7 ms	512 KB	Output is correct
49	Correct	6 ms	512 KB	Output is correct
50	Correct	7 ms	512 KB	Output is correct
51	Correct	6 ms	512 KB	Output is correct
52	Correct	218 ms	16112 KB	Output is correct
53	Correct	220 ms	16060 KB	Output is correct
54	Correct	210 ms	16120 KB	Output is correct
55	Correct	215 ms	16120 KB	Output is correct
56	Correct	219 ms	15992 KB	Output is correct
57	Correct	218 ms	15992 KB	Output is correct
58	Correct	217 ms	15992 KB	Output is correct
59	Correct	215 ms	16120 KB	Output is correct
60	Correct	212 ms	16120 KB	Output is correct
61	Correct	213 ms	15992 KB	Output is correct
62	Correct	222 ms	15992 KB	Output is correct
63	Correct	209 ms	15992 KB	Output is correct
64	Correct	219 ms	15992 KB	Output is correct
65	Correct	230 ms	16012 KB	Output is correct
66	Incorrect	216 ms	16028 KB	Output isn't correct
67	Halted	0 ms	0 KB	-

Submission #241154

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0