답안 #565811

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565811	2022-05-21T11:03:46 Z	imtiyazrasool92	Art Exhibition (JOI18_art)	C++17	100 / 100	567 ms	25248 KB

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>

using namespace std;


template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template < typename T_container, typename T = typename enable_if < !is_same<T_container, string>::value, typename T_container::value_type >::type > ostream & operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }

void dbg_out() { cerr << '\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef imtiyazrasool92
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

int main() {
    int N;
    cin >> N;

    vector<array<int64_t, 2>> A(N);
    for (auto &[x, y] : A)
        cin >> x >> y;

    sort(A.begin(), A.end());

    priority_queue<int64_t> Q;
    Q.push((A[1][0] - A[0][0]) - A[0][1]);

    int64_t answer = A[0][1];
    int64_t prefix = A[0][1];
    int64_t remove_prefix = (A[1][0] - A[0][0]) - A[0][1];

    for (int i = 1; i < N; i++) {
        prefix += A[i][1];
        prefix -= abs(A[i][0] - A[i - 1][0]);

        answer = max<int64_t>(answer, prefix);
        answer = max<int64_t>(answer, prefix + Q.top());

        remove_prefix -= A[i][1];
        if (i + 1 < N)
            remove_prefix += (A[i + 1][0] - A[i][0]);

        Q.push(remove_prefix);
    }

    cout << answer;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	416 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	2 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	1 ms	308 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	304 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	6 ms	488 KB	Output is correct
28	Correct	6 ms	484 KB	Output is correct
29	Correct	7 ms	612 KB	Output is correct
30	Correct	6 ms	488 KB	Output is correct
31	Correct	7 ms	564 KB	Output is correct
32	Correct	6 ms	572 KB	Output is correct
33	Correct	6 ms	596 KB	Output is correct
34	Correct	7 ms	596 KB	Output is correct
35	Correct	7 ms	508 KB	Output is correct
36	Correct	6 ms	596 KB	Output is correct
37	Correct	6 ms	596 KB	Output is correct
38	Correct	6 ms	484 KB	Output is correct
39	Correct	7 ms	596 KB	Output is correct
40	Correct	6 ms	588 KB	Output is correct
41	Correct	6 ms	596 KB	Output is correct
42	Correct	6 ms	596 KB	Output is correct
43	Correct	7 ms	596 KB	Output is correct
44	Correct	8 ms	500 KB	Output is correct
45	Correct	6 ms	564 KB	Output is correct
46	Correct	6 ms	596 KB	Output is correct
47	Correct	6 ms	596 KB	Output is correct
48	Correct	6 ms	568 KB	Output is correct
49	Correct	9 ms	596 KB	Output is correct
50	Correct	6 ms	596 KB	Output is correct
51	Correct	5 ms	568 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	416 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	2 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	1 ms	308 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	304 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	6 ms	488 KB	Output is correct
28	Correct	6 ms	484 KB	Output is correct
29	Correct	7 ms	612 KB	Output is correct
30	Correct	6 ms	488 KB	Output is correct
31	Correct	7 ms	564 KB	Output is correct
32	Correct	6 ms	572 KB	Output is correct
33	Correct	6 ms	596 KB	Output is correct
34	Correct	7 ms	596 KB	Output is correct
35	Correct	7 ms	508 KB	Output is correct
36	Correct	6 ms	596 KB	Output is correct
37	Correct	6 ms	596 KB	Output is correct
38	Correct	6 ms	484 KB	Output is correct
39	Correct	7 ms	596 KB	Output is correct
40	Correct	6 ms	588 KB	Output is correct
41	Correct	6 ms	596 KB	Output is correct
42	Correct	6 ms	596 KB	Output is correct
43	Correct	7 ms	596 KB	Output is correct
44	Correct	8 ms	500 KB	Output is correct
45	Correct	6 ms	564 KB	Output is correct
46	Correct	6 ms	596 KB	Output is correct
47	Correct	6 ms	596 KB	Output is correct
48	Correct	6 ms	568 KB	Output is correct
49	Correct	9 ms	596 KB	Output is correct
50	Correct	6 ms	596 KB	Output is correct
51	Correct	5 ms	568 KB	Output is correct
52	Correct	536 ms	24872 KB	Output is correct
53	Correct	534 ms	25116 KB	Output is correct
54	Correct	534 ms	25132 KB	Output is correct
55	Correct	530 ms	25028 KB	Output is correct
56	Correct	540 ms	25004 KB	Output is correct
57	Correct	513 ms	25032 KB	Output is correct
58	Correct	509 ms	24992 KB	Output is correct
59	Correct	528 ms	25000 KB	Output is correct
60	Correct	529 ms	25008 KB	Output is correct
61	Correct	521 ms	24872 KB	Output is correct
62	Correct	526 ms	25116 KB	Output is correct
63	Correct	519 ms	25248 KB	Output is correct
64	Correct	539 ms	25004 KB	Output is correct
65	Correct	567 ms	25008 KB	Output is correct
66	Correct	500 ms	25020 KB	Output is correct
67	Correct	542 ms	24996 KB	Output is correct
68	Correct	527 ms	25004 KB	Output is correct

답안 #565811

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