Submission #406577

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
406577	2021-05-17T18:51:18 Z	FEDIKUS	Art Exhibition (JOI18_art)	C++17	100 / 100	240 ms	20856 KB

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

const int maxn=5e5+10;
pll niz[maxn];

void solve(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>niz[i].xx>>niz[i].yy;
    sort(niz,niz+n);
    ll res=0;
    ll maxi=LLONG_MIN;
    ll pref=0;
    for(int i=0;i<n;i++){
        maxi=max(maxi,-pref+niz[i].xx);
        pref+=niz[i].yy;
        res=max(res,pref+maxi-niz[i].xx);
    }
    cout<<res;
}

int main(){
    ios;
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

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	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	320 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	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 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	324 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	332 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	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 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	324 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	3 ms	464 KB	Output is correct
28	Correct	3 ms	460 KB	Output is correct
29	Correct	3 ms	460 KB	Output is correct
30	Correct	3 ms	460 KB	Output is correct
31	Correct	3 ms	460 KB	Output is correct
32	Correct	4 ms	460 KB	Output is correct
33	Correct	3 ms	460 KB	Output is correct
34	Correct	3 ms	460 KB	Output is correct
35	Correct	3 ms	436 KB	Output is correct
36	Correct	4 ms	464 KB	Output is correct
37	Correct	3 ms	440 KB	Output is correct
38	Correct	3 ms	464 KB	Output is correct
39	Correct	3 ms	460 KB	Output is correct
40	Correct	3 ms	460 KB	Output is correct
41	Correct	3 ms	460 KB	Output is correct
42	Correct	4 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	3 ms	460 KB	Output is correct
45	Correct	3 ms	460 KB	Output is correct
46	Correct	3 ms	460 KB	Output is correct
47	Correct	3 ms	464 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	3 ms	456 KB	Output is correct
50	Correct	3 ms	460 KB	Output is correct
51	Correct	3 ms	444 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	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 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	324 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	3 ms	464 KB	Output is correct
28	Correct	3 ms	460 KB	Output is correct
29	Correct	3 ms	460 KB	Output is correct
30	Correct	3 ms	460 KB	Output is correct
31	Correct	3 ms	460 KB	Output is correct
32	Correct	4 ms	460 KB	Output is correct
33	Correct	3 ms	460 KB	Output is correct
34	Correct	3 ms	460 KB	Output is correct
35	Correct	3 ms	436 KB	Output is correct
36	Correct	4 ms	464 KB	Output is correct
37	Correct	3 ms	440 KB	Output is correct
38	Correct	3 ms	464 KB	Output is correct
39	Correct	3 ms	460 KB	Output is correct
40	Correct	3 ms	460 KB	Output is correct
41	Correct	3 ms	460 KB	Output is correct
42	Correct	4 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	3 ms	460 KB	Output is correct
45	Correct	3 ms	460 KB	Output is correct
46	Correct	3 ms	460 KB	Output is correct
47	Correct	3 ms	464 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	3 ms	456 KB	Output is correct
50	Correct	3 ms	460 KB	Output is correct
51	Correct	3 ms	444 KB	Output is correct
52	Correct	208 ms	20672 KB	Output is correct
53	Correct	228 ms	20772 KB	Output is correct
54	Correct	240 ms	20764 KB	Output is correct
55	Correct	209 ms	20668 KB	Output is correct
56	Correct	209 ms	20824 KB	Output is correct
57	Correct	207 ms	20676 KB	Output is correct
58	Correct	208 ms	20856 KB	Output is correct
59	Correct	207 ms	20728 KB	Output is correct
60	Correct	207 ms	20676 KB	Output is correct
61	Correct	208 ms	20676 KB	Output is correct
62	Correct	210 ms	20708 KB	Output is correct
63	Correct	207 ms	20748 KB	Output is correct
64	Correct	208 ms	20840 KB	Output is correct
65	Correct	206 ms	20760 KB	Output is correct
66	Correct	209 ms	20768 KB	Output is correct
67	Correct	209 ms	20688 KB	Output is correct
68	Correct	210 ms	20696 KB	Output is correct

Submission #406577

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