답안 #1034404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1034404	2024-07-25T13:25:45 Z	Phuoc	Art Exhibition (JOI18_art)	C++14	100 / 100	147 ms	32656 KB

#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <map>
#include <stack>
#include <queue>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define el '\n'
#define mpair make_pair
#define MASK(i) (1LL << (i))
#define BIT(mask, i) (((mask) >> (i)) & 1)
#define fi first
#define se second
 
/* Author: Pham Gia Phuoc */
 
const ll MOD = (ll)(1e9) + 1LL * 19972207;
 
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 T1, class T2>
    bool minimize(T1 &a, T2 b){
        if(a > b){a = b; return true;} return false;
    }
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if(a < b){a = b; return true;} return false;
    }
 
/** END OF TEMPLATE. DRINK A CUP OF COFFEE BEFORE READING MY CODE **/
 
const int MAX = 500010;
const ll INF = (ll) 1e18 + 67LL;
const int oo = (int)(1e9 + 7);
const int NUM_BIT = 62;

#define FOR(i, a, b) for(int i = a; i <= b; i++)

int n;
long long size[MAX], values[MAX];

void init(){
    cin >> n;
    FOR(i, 1, n) cin >> size[i] >> values[i];
}

namespace subtask1{
    bool check(){
        return n <= 16;
    }

    void solve(){
        long long ans = -INF;
        FOR(mask, 1, MASK(n) - 1){
            long long sumVal = 0, maxSize = 0, minSize = INF;
            FOR(i, 0, n - 1) if(BIT(mask, i))
                {sumVal += values[i + 1]; maximize(maxSize, size[i + 1]); minimize(minSize, size[i + 1]);}
            maximize(ans, sumVal - (maxSize - minSize));          
        }
        cout << ans;
    }
}

namespace subtask2{
    bool check(){
        return n <= 500000;
    }

    pair <long long, long long> arts[MAX];
    long long sum[MAX];

    void solve(){
        FOR(i, 1, n) arts[i] = make_pair(size[i], values[i]);
        sort(arts + 1, arts + n + 1);
        long long ans = -INF;
        long long mi = INF;
        FOR(i, 1, n){
            sum[i] = sum[i - 1] + arts[i].se;
            minimize(mi, sum[i - 1] - arts[i].fi);
            maximize(ans, sum[i] - arts[i].fi - mi);
        }
        cout << ans;
    }
}

void solve(){
    // if(subtask1::check()){subtask1::solve(); return;}
    if(subtask2::check()){subtask2::solve(); return;}
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    // #define test "test"
    // freopen(test".inp", "r", stdin);
    // freopen(test".out", "w", stdout);
    srand(time(0));
    int t = 1;
    while(t--){
        // gen();
        init();
        solve();
    }
    
    return 0;
}
 
 
 
/*** ROAD TO VOI 2025 ***/

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 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	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 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	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	600 KB	Output is correct
29	Correct	1 ms	732 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	656 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	600 KB	Output is correct
43	Correct	2 ms	616 KB	Output is correct
44	Correct	2 ms	600 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	1 ms	600 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 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	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 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	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	600 KB	Output is correct
29	Correct	1 ms	732 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	656 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	600 KB	Output is correct
43	Correct	2 ms	616 KB	Output is correct
44	Correct	2 ms	600 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	1 ms	600 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct
52	Correct	124 ms	32364 KB	Output is correct
53	Correct	120 ms	32592 KB	Output is correct
54	Correct	118 ms	32472 KB	Output is correct
55	Correct	118 ms	32592 KB	Output is correct
56	Correct	123 ms	32596 KB	Output is correct
57	Correct	147 ms	32468 KB	Output is correct
58	Correct	122 ms	32644 KB	Output is correct
59	Correct	120 ms	32444 KB	Output is correct
60	Correct	146 ms	32408 KB	Output is correct
61	Correct	120 ms	32336 KB	Output is correct
62	Correct	127 ms	32584 KB	Output is correct
63	Correct	121 ms	32636 KB	Output is correct
64	Correct	117 ms	32592 KB	Output is correct
65	Correct	117 ms	32480 KB	Output is correct
66	Correct	120 ms	32656 KB	Output is correct
67	Correct	117 ms	32596 KB	Output is correct
68	Correct	117 ms	32596 KB	Output is correct

답안 #1034404

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