Submission #524889

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
524889	2022-02-10T08:21:49 Z	AA_Surely	Art Exhibition (JOI18_art)	C++17	100 / 100	179 ms	20864 KB

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int MAXN = 5e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

int n;
PLL ns[MAXN];

int main() {
    IOS;
    
    cin >> n;
    F0R(i, n) cin >> ns[i].F >> ns[i].S;
    sort(ns, ns + n);

    LL candid = 0, ans = 0;
    F0R(i, n) {
        candid = max(candid + ns[i].S, ns[i].F + ns[i].S);
        ans = max(ans, candid - ns[i].F);
    }
    cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	312 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	324 KB	Output is correct
27	Correct	3 ms	460 KB	Output is correct
28	Correct	2 ms	452 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	448 KB	Output is correct
31	Correct	2 ms	464 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	464 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	3 ms	460 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	456 KB	Output is correct
40	Correct	2 ms	456 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	2 ms	440 KB	Output is correct
48	Correct	3 ms	480 KB	Output is correct
49	Correct	3 ms	472 KB	Output is correct
50	Correct	2 ms	460 KB	Output is correct
51	Correct	2 ms	440 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	312 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	324 KB	Output is correct
27	Correct	3 ms	460 KB	Output is correct
28	Correct	2 ms	452 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	448 KB	Output is correct
31	Correct	2 ms	464 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	464 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	3 ms	460 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	456 KB	Output is correct
40	Correct	2 ms	456 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	2 ms	440 KB	Output is correct
48	Correct	3 ms	480 KB	Output is correct
49	Correct	3 ms	472 KB	Output is correct
50	Correct	2 ms	460 KB	Output is correct
51	Correct	2 ms	440 KB	Output is correct
52	Correct	164 ms	20804 KB	Output is correct
53	Correct	179 ms	20692 KB	Output is correct
54	Correct	169 ms	20704 KB	Output is correct
55	Correct	174 ms	20864 KB	Output is correct
56	Correct	179 ms	20760 KB	Output is correct
57	Correct	168 ms	20756 KB	Output is correct
58	Correct	166 ms	20672 KB	Output is correct
59	Correct	162 ms	20676 KB	Output is correct
60	Correct	169 ms	20760 KB	Output is correct
61	Correct	163 ms	20548 KB	Output is correct
62	Correct	160 ms	20760 KB	Output is correct
63	Correct	167 ms	20804 KB	Output is correct
64	Correct	169 ms	20812 KB	Output is correct
65	Correct	163 ms	20648 KB	Output is correct
66	Correct	168 ms	20676 KB	Output is correct
67	Correct	170 ms	20704 KB	Output is correct
68	Correct	169 ms	20804 KB	Output is correct

Submission #524889

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0