답안 #934770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
934770	2024-02-28T00:34:39 Z	Whisper	Art Exhibition (JOI18_art)	C++17	100 / 100	147 ms	28900 KB

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 5e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numPic;
pair<int, int> a[MAX];
int s[MAX];
struct FenwickTree{
    int n;
    vector<int> f;
    FenwickTree(int _n){
        this -> n = _n;
        f.resize(n + 5, -1e16);
    }

    void modify(int p, int val){
        assert(val <= 1e16);
        for ( ; p <= n; p += p & (-p)) maximize(f[p], val);
    }
    int query(int p){
        int res = -1e16;
        for ( ; p > 0; p -= p & (-p)) maximize(res, f[p]);
        return res;
    }
};
void Whisper(){
    cin >> numPic;
    for (int i = 1; i <= numPic; ++i){
        cin >> a[i].first >> a[i].second;
    }
    sort(a + 1, a + numPic + 1);
    for (int i = 1; i <= numPic; ++i) s[i] = s[i - 1] + a[i].second;
    FenwickTree fen(numPic);

    int ans = -LINF;
    for (int i = 1; i <= numPic; ++i){
        maximize(ans, fen.query(i) + s[i] - a[i].first);
        maximize(ans, a[i].second);
        fen.modify(i, -s[i - 1] + a[i].first);
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 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	2392 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 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	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2524 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2400 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	2392 KB	Output is correct
21	Correct	1 ms	2392 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	2516 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 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	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2524 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2400 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	2392 KB	Output is correct
21	Correct	1 ms	2392 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	2516 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	3 ms	2652 KB	Output is correct
28	Correct	2 ms	2628 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	2652 KB	Output is correct
32	Correct	2 ms	2652 KB	Output is correct
33	Correct	2 ms	2652 KB	Output is correct
34	Correct	2 ms	2524 KB	Output is correct
35	Correct	2 ms	2652 KB	Output is correct
36	Correct	2 ms	2648 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	2532 KB	Output is correct
40	Correct	2 ms	2652 KB	Output is correct
41	Correct	2 ms	2652 KB	Output is correct
42	Correct	2 ms	2652 KB	Output is correct
43	Correct	2 ms	2652 KB	Output is correct
44	Correct	2 ms	2648 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	2652 KB	Output is correct
49	Correct	2 ms	2636 KB	Output is correct
50	Correct	2 ms	2652 KB	Output is correct
51	Correct	2 ms	2652 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 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	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2524 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2400 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	2392 KB	Output is correct
21	Correct	1 ms	2392 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	2516 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	3 ms	2652 KB	Output is correct
28	Correct	2 ms	2628 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	2652 KB	Output is correct
32	Correct	2 ms	2652 KB	Output is correct
33	Correct	2 ms	2652 KB	Output is correct
34	Correct	2 ms	2524 KB	Output is correct
35	Correct	2 ms	2652 KB	Output is correct
36	Correct	2 ms	2648 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	2532 KB	Output is correct
40	Correct	2 ms	2652 KB	Output is correct
41	Correct	2 ms	2652 KB	Output is correct
42	Correct	2 ms	2652 KB	Output is correct
43	Correct	2 ms	2652 KB	Output is correct
44	Correct	2 ms	2648 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	2652 KB	Output is correct
49	Correct	2 ms	2636 KB	Output is correct
50	Correct	2 ms	2652 KB	Output is correct
51	Correct	2 ms	2652 KB	Output is correct
52	Correct	147 ms	28608 KB	Output is correct
53	Correct	145 ms	28752 KB	Output is correct
54	Correct	140 ms	28732 KB	Output is correct
55	Correct	147 ms	28688 KB	Output is correct
56	Correct	137 ms	28616 KB	Output is correct
57	Correct	139 ms	28740 KB	Output is correct
58	Correct	142 ms	28688 KB	Output is correct
59	Correct	138 ms	28620 KB	Output is correct
60	Correct	138 ms	28732 KB	Output is correct
61	Correct	142 ms	28608 KB	Output is correct
62	Correct	142 ms	28748 KB	Output is correct
63	Correct	142 ms	28760 KB	Output is correct
64	Correct	140 ms	28680 KB	Output is correct
65	Correct	141 ms	28876 KB	Output is correct
66	Correct	137 ms	28616 KB	Output is correct
67	Correct	136 ms	28900 KB	Output is correct
68	Correct	137 ms	28612 KB	Output is correct

답안 #934770

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