답안 #249725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249725	2020-07-15T15:37:08 Z	MarcoMeijer	Art Exhibition (JOI18_art)	C++14	100 / 100	267 ms	28792 KB

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

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  program();
}


//===================//
//   begin program   //
//===================//

const int MX = 7e5;
ll n, a[MX], b[MX];
ll SA[MX];
ll sm[MX];

void program() {
    cin>>n;
    RE(i,n) cin>>a[i]>>b[i];
    RE(i,n) SA[i]=i;
    sort(SA,SA+n, [](int i, int j) {
        return a[i]<a[j];
    });
    sm[0] = 0;
    RE(i,n) sm[i+1] = sm[i]+b[SA[i]];

    ll ans = 0;
    ll mx = a[SA[0]]-sm[0];
    RE(i,n) {
        mx = max(mx, a[SA[i]]-sm[i]);
        ans = max(ans, sm[i+1]-a[SA[i]]+mx);
    }
    cout<<ans<<endl;
}

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	384 KB	Output is correct
2	Correct	384 KB	Output is correct
3	Correct	384 KB	Output is correct
4	Correct	384 KB	Output is correct
5	Correct	384 KB	Output is correct
6	Correct	384 KB	Output is correct
7	Correct	384 KB	Output is correct
8	Correct	384 KB	Output is correct
9	Correct	384 KB	Output is correct
10	Correct	384 KB	Output is correct
11	Correct	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	2 ms	512 KB	Output is correct
28	Correct	2 ms	512 KB	Output is correct
29	Correct	2 ms	512 KB	Output is correct
30	Correct	2 ms	512 KB	Output is correct
31	Correct	4 ms	512 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	3 ms	512 KB	Output is correct
35	Correct	2 ms	512 KB	Output is correct
36	Correct	2 ms	512 KB	Output is correct
37	Correct	2 ms	512 KB	Output is correct
38	Correct	3 ms	512 KB	Output is correct
39	Correct	3 ms	512 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	4 ms	512 KB	Output is correct
42	Correct	3 ms	512 KB	Output is correct
43	Correct	4 ms	512 KB	Output is correct
44	Correct	4 ms	512 KB	Output is correct
45	Correct	4 ms	512 KB	Output is correct
46	Correct	4 ms	512 KB	Output is correct
47	Correct	2 ms	512 KB	Output is correct
48	Correct	2 ms	512 KB	Output is correct
49	Correct	2 ms	512 KB	Output is correct
50	Correct	3 ms	512 KB	Output is correct
51	Correct	2 ms	512 KB	Output is correct
52	Correct	248 ms	15992 KB	Output is correct
53	Correct	258 ms	28664 KB	Output is correct
54	Correct	243 ms	28664 KB	Output is correct
55	Correct	242 ms	28664 KB	Output is correct
56	Correct	253 ms	28792 KB	Output is correct
57	Correct	243 ms	28664 KB	Output is correct
58	Correct	244 ms	28664 KB	Output is correct
59	Correct	248 ms	28664 KB	Output is correct
60	Correct	248 ms	28664 KB	Output is correct
61	Correct	267 ms	28664 KB	Output is correct
62	Correct	247 ms	28664 KB	Output is correct
63	Correct	250 ms	28664 KB	Output is correct
64	Correct	252 ms	28792 KB	Output is correct
65	Correct	250 ms	28636 KB	Output is correct
66	Correct	249 ms	28664 KB	Output is correct
67	Correct	250 ms	28648 KB	Output is correct
68	Correct	253 ms	28664 KB	Output is correct

답안 #249725

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