Submission #207750

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
207750	2020-03-08T19:16:42 Z	amiratou	Art Exhibition (JOI18_art)	C++14	100 / 100	245 ms	24696 KB

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define fi first
#define se second
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define debugii(x) cerr << " - " << #x << ": " << x.fi<<","<<x.se << endl;
#define sep() cerr << "--------------------" << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ld long double
#define ll long long
#define int ll
#define ii pair<int,int>
#define v vector<int>
#define vii vector<ii>
#define vv vector<vector<int> >
#define mp make_pair
#define INF 1000000000
#define pb push_back
#define EPS 1e-9
const int MOD = 1000000007; // 998244353
int A[500003],B[500003],maxi[500003];
int32_t main(){
	boost;
	//freopen(".in","r",stdin);
	int n,ans=0;
    cin>>n;
    v cum(n,0);
    vii vec(n);
    for (int i = 0; i < n; ++i){
        cin>>A[i]>>B[i],ans=max(ans,B[i]);    
        vec[i]=ii(A[i],B[i]);
    }
    sort(all(vec));
    for (int i = n-1; i >=0 ; i--){
        cum[i]+=vec[i].se;
        if(i!=(n-1))cum[i]+=cum[i+1];
    }
    for (int i = n-1; i >=0 ; i--)
        cum[i]+=vec[i].fi;
    for (int i = 0; i < n; ++i)
    {
        maxi[i]=cum[i];
        if(i)maxi[i]=max(maxi[i],maxi[i-1]);
    }
    for (int i = n-1; i >=1; i--)
        ans=max(ans,maxi[i-1]-vec[i].fi-((i!=(n-1))?(cum[i+1]-vec[i+1].fi):0));
    cout<<ans<<"\n";
	return 0;
}
//long long
//array bounds
//special cases
//binary search

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	380 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	380 KB	Output is correct
6	Correct	6 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	380 KB	Output is correct
27	Correct	7 ms	760 KB	Output is correct
28	Correct	7 ms	760 KB	Output is correct
29	Correct	7 ms	760 KB	Output is correct
30	Correct	8 ms	760 KB	Output is correct
31	Correct	7 ms	760 KB	Output is correct
32	Correct	7 ms	760 KB	Output is correct
33	Correct	7 ms	760 KB	Output is correct
34	Correct	7 ms	760 KB	Output is correct
35	Correct	8 ms	760 KB	Output is correct
36	Correct	7 ms	760 KB	Output is correct
37	Correct	7 ms	760 KB	Output is correct
38	Correct	8 ms	760 KB	Output is correct
39	Correct	7 ms	760 KB	Output is correct
40	Correct	7 ms	760 KB	Output is correct
41	Correct	7 ms	760 KB	Output is correct
42	Correct	7 ms	760 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	7 ms	764 KB	Output is correct
45	Correct	7 ms	760 KB	Output is correct
46	Correct	7 ms	760 KB	Output is correct
47	Correct	7 ms	760 KB	Output is correct
48	Correct	7 ms	760 KB	Output is correct
49	Correct	8 ms	760 KB	Output is correct
50	Correct	7 ms	760 KB	Output is correct
51	Correct	8 ms	760 KB	Output is correct
52	Correct	228 ms	24696 KB	Output is correct
53	Correct	241 ms	24312 KB	Output is correct
54	Correct	232 ms	24312 KB	Output is correct
55	Correct	223 ms	24312 KB	Output is correct
56	Correct	236 ms	24480 KB	Output is correct
57	Correct	240 ms	24368 KB	Output is correct
58	Correct	233 ms	24312 KB	Output is correct
59	Correct	234 ms	24312 KB	Output is correct
60	Correct	223 ms	24312 KB	Output is correct
61	Correct	236 ms	24440 KB	Output is correct
62	Correct	226 ms	24312 KB	Output is correct
63	Correct	226 ms	24312 KB	Output is correct
64	Correct	223 ms	24432 KB	Output is correct
65	Correct	222 ms	24312 KB	Output is correct
66	Correct	228 ms	24312 KB	Output is correct
67	Correct	228 ms	24316 KB	Output is correct
68	Correct	245 ms	24356 KB	Output is correct

Submission #207750

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