답안 #114412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114412	2019-06-01T08:58:30 Z	lyc	Art Exhibition (JOI18_art)	C++14	100 / 100	221 ms	16140 KB

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x) 
#define REP(i, n) for (int i = 0; i < n; ++i) 
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)

int main() {
    //freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);

    using pll=pair<ll, ll>;
    int n; cin >> n;
    pll ab[n+1];
    FOR(i,1,n){
        ll a, b; cin >> a >> b;
        ab[i] = mp(a,b);
    }

    sort(ab+1, ab+1+n);

    ll pre[n+1]; pre[0] = 0;
    FOR(i,1,n) pre[i] = pre[i-1] + ab[i].sc;
    // max S - (Amax-Amin)
    // max pre[i]-pre[j-1] - A[i] + A[j]
    ll maxi = 0, ans = 0;
    FOR(i,1,n){
        maxi = max(maxi, -pre[i-1]+ab[i].fi);
        ans = max(ans, pre[i]-ab[i].fi + maxi);
    }
    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	424 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	352 KB	Output is correct
5	Correct	2 ms	284 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	304 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	424 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	352 KB	Output is correct
5	Correct	2 ms	284 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	304 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	420 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	4 ms	512 KB	Output is correct
28	Correct	4 ms	588 KB	Output is correct
29	Correct	4 ms	608 KB	Output is correct
30	Correct	4 ms	512 KB	Output is correct
31	Correct	4 ms	556 KB	Output is correct
32	Correct	4 ms	524 KB	Output is correct
33	Correct	4 ms	512 KB	Output is correct
34	Correct	5 ms	584 KB	Output is correct
35	Correct	5 ms	512 KB	Output is correct
36	Correct	4 ms	640 KB	Output is correct
37	Correct	4 ms	640 KB	Output is correct
38	Correct	4 ms	612 KB	Output is correct
39	Correct	4 ms	564 KB	Output is correct
40	Correct	4 ms	640 KB	Output is correct
41	Correct	4 ms	512 KB	Output is correct
42	Correct	4 ms	688 KB	Output is correct
43	Correct	4 ms	512 KB	Output is correct
44	Correct	4 ms	640 KB	Output is correct
45	Correct	4 ms	512 KB	Output is correct
46	Correct	4 ms	524 KB	Output is correct
47	Correct	4 ms	524 KB	Output is correct
48	Correct	4 ms	512 KB	Output is correct
49	Correct	4 ms	576 KB	Output is correct
50	Correct	4 ms	512 KB	Output is correct
51	Correct	4 ms	512 KB	Output is correct
52	Correct	218 ms	15992 KB	Output is correct
53	Correct	202 ms	16092 KB	Output is correct
54	Correct	221 ms	16012 KB	Output is correct
55	Correct	197 ms	16092 KB	Output is correct
56	Correct	198 ms	16016 KB	Output is correct
57	Correct	195 ms	16016 KB	Output is correct
58	Correct	198 ms	16016 KB	Output is correct
59	Correct	197 ms	16016 KB	Output is correct
60	Correct	197 ms	16016 KB	Output is correct
61	Correct	197 ms	16028 KB	Output is correct
62	Correct	198 ms	16020 KB	Output is correct
63	Correct	195 ms	16136 KB	Output is correct
64	Correct	202 ms	16016 KB	Output is correct
65	Correct	202 ms	16012 KB	Output is correct
66	Correct	207 ms	16140 KB	Output is correct
67	Correct	197 ms	16016 KB	Output is correct
68	Correct	215 ms	16020 KB	Output is correct

답안 #114412

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