답안 #1092926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1092926	2024-09-25T11:36:27 Z	TrinhKhanhDung	Art Exhibition (JOI18_art)	C++14	100 / 100	131 ms	24800 KB

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 5e5 + 10;

int N;
pair<ll, ll> arts[MAX];
ll suf[MAX];

void solve(){
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> arts[i].fi >> arts[i].se;
    }

    sort(arts + 1, arts + N + 1);

    ll ans = -oo;
    for(int i = 1; i <= N; i++){
        maximize(ans, arts[i].se);
    }

    for(int i = N; i > 1; i--){
        suf[i] = suf[i + 1] + arts[i].se - arts[i].fi + arts[i - 1].fi;
    }

    ll minVal = 0;
    for(int i = N - 1; i >= 1; i--){
        maximize(ans, suf[i + 1] - minVal + arts[i].se);
        minimize(minVal, suf[i + 1]);
    }

    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    solve();

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	464 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	480 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	480 KB	Output is correct
36	Correct	2 ms	680 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	2 ms	600 KB	Output is correct
40	Correct	2 ms	604 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	2 ms	852 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	2 ms	476 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	600 KB	Output is correct
51	Correct	2 ms	600 KB	Output is correct
52	Correct	129 ms	24660 KB	Output is correct
53	Correct	131 ms	24656 KB	Output is correct
54	Correct	119 ms	24656 KB	Output is correct
55	Correct	122 ms	24684 KB	Output is correct
56	Correct	122 ms	24660 KB	Output is correct
57	Correct	128 ms	24584 KB	Output is correct
58	Correct	126 ms	24800 KB	Output is correct
59	Correct	124 ms	24660 KB	Output is correct
60	Correct	119 ms	24652 KB	Output is correct
61	Correct	121 ms	24444 KB	Output is correct
62	Correct	124 ms	24572 KB	Output is correct
63	Correct	125 ms	24656 KB	Output is correct
64	Correct	126 ms	24640 KB	Output is correct
65	Correct	128 ms	24656 KB	Output is correct
66	Correct	121 ms	24660 KB	Output is correct
67	Correct	121 ms	24660 KB	Output is correct
68	Correct	124 ms	24656 KB	Output is correct

답안 #1092926

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