답안 #887063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887063	2023-12-13T15:27:15 Z	ByeWorld	Art Exhibition (JOI18_art)	C++14	100 / 100	139 ms	29088 KB

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long 
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 5e5+20;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
const int INF = 1e18;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;

int n;
vector <pii> vec;
int a[MAXN], mx[MAXN];

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i=1; i<=n; i++){
        int x, y; cin >> x >> y;
        vec.pb({x, y});
    }
    vec.pb({-1, -1});
    sort(vec.begin(), vec.end());

    a[1] = vec[1].se;
    for(int i=2; i<=n; i++){
        a[i] = a[i-1];
        a[i] += vec[i].se; a[i] -= vec[i].fi-vec[i-1].fi; 
        //cout << i << ' ' << a[i] << " te\n";
    }
    mx[n+1] = -INF;
    for(int i=n; i>=1; i--) mx[i] = max(mx[i+1], a[i]);

    int ans = 0, te = 0;
    for(int i=1; i<=n; i++){
        //cout << i << ' ' << mx[i] << ' ' << te << " te\n";
        ans = max(ans, mx[i]+te);
        te -= vec[i].se; te += vec[i+1].fi-vec[i].fi;
    }
    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2512 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2512 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2392 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	2 ms	2652 KB	Output is correct
28	Correct	2 ms	2652 KB	Output is correct
29	Correct	2 ms	2652 KB	Output is correct
30	Correct	2 ms	2652 KB	Output is correct
31	Correct	2 ms	2780 KB	Output is correct
32	Correct	2 ms	2652 KB	Output is correct
33	Correct	2 ms	2648 KB	Output is correct
34	Correct	2 ms	2772 KB	Output is correct
35	Correct	2 ms	2652 KB	Output is correct
36	Correct	2 ms	2652 KB	Output is correct
37	Correct	2 ms	2652 KB	Output is correct
38	Correct	2 ms	2652 KB	Output is correct
39	Correct	2 ms	2652 KB	Output is correct
40	Correct	2 ms	2652 KB	Output is correct
41	Correct	2 ms	2656 KB	Output is correct
42	Correct	2 ms	2652 KB	Output is correct
43	Correct	2 ms	2648 KB	Output is correct
44	Correct	2 ms	2652 KB	Output is correct
45	Correct	2 ms	2652 KB	Output is correct
46	Correct	2 ms	2652 KB	Output is correct
47	Correct	2 ms	2652 KB	Output is correct
48	Correct	2 ms	2664 KB	Output is correct
49	Correct	2 ms	2652 KB	Output is correct
50	Correct	2 ms	2652 KB	Output is correct
51	Correct	2 ms	2848 KB	Output is correct
52	Correct	130 ms	28596 KB	Output is correct
53	Correct	132 ms	28852 KB	Output is correct
54	Correct	132 ms	28736 KB	Output is correct
55	Correct	132 ms	28868 KB	Output is correct
56	Correct	136 ms	28880 KB	Output is correct
57	Correct	132 ms	28824 KB	Output is correct
58	Correct	132 ms	28856 KB	Output is correct
59	Correct	134 ms	29088 KB	Output is correct
60	Correct	130 ms	28748 KB	Output is correct
61	Correct	132 ms	28856 KB	Output is correct
62	Correct	132 ms	28856 KB	Output is correct
63	Correct	135 ms	28860 KB	Output is correct
64	Correct	139 ms	28736 KB	Output is correct
65	Correct	129 ms	28736 KB	Output is correct
66	Correct	133 ms	28752 KB	Output is correct
67	Correct	131 ms	28848 KB	Output is correct
68	Correct	134 ms	28856 KB	Output is correct

답안 #887063

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