oj.uz

답안 #1086420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086420 2024-09-10T14:50:32 Z steveonalex Candies (JOI18_candies) C++17
100 / 100
 447 ms 32084 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
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 T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const ll INF = 1e18 + 69;
const int N = 2e5 + 69;
ll a[N], pref[N];

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n; cin >> n;
    a[1] = a[n+2] = -INF;
    for(int i = 2; i<=n+1; ++i) cin >> a[i];

    for(int i = 1; i<=n+2; ++i) pref[i] = pref[i-1] + a[i];

    set<array<ll, 3>> S1, S2;
    // S1 sort by range, S2 sort by value
    for(int i = 1; i<=n+2; ++i){
        S1.insert({{i, i, a[i]}});
        S2.insert({{a[i], i, i}});
    }

    ll ans = 0;
    for(int iteration = 1; iteration <= (n + 1) / 2; ++iteration){
        array<ll, 3> cur = *S2.rbegin();
        ans += cur[0];
        array<ll, 3> _cur = {cur[1], cur[2], cur[0]};
        S1.erase(_cur); S2.erase(cur);

        // cout << _cur[0]-1 << " " << _cur[1]-1 << " " << _cur[2] << "\n";

        auto it = S1.lower_bound(_cur);
        array<ll, 3> R = *it;
        it--;
        array<ll, 3> L = *it;
        S1.erase(L); S1.erase(R);
        S2.erase({{L[2], L[0], L[1]}}); 
        S2.erase({{R[2], R[0], R[1]}}); 

        _cur = {L[0], R[1], L[2] + R[2] - _cur[2]};
        S1.insert(_cur);
        S2.insert({{_cur[2], _cur[0], _cur[1]}});

        // cout << _cur[0]-1 << " " << _cur[1]-1 << " " << _cur[2] << "\n";


        cout << ans << "\n";
    }

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 796 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 736 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 740 KB Output is correct
20 Correct 2 ms 604 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 796 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 736 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 740 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 367 ms 31928 KB Output is correct
22 Correct 357 ms 31884 KB Output is correct
23 Correct 368 ms 31828 KB Output is correct
24 Correct 209 ms 31828 KB Output is correct
25 Correct 190 ms 31696 KB Output is correct
26 Correct 197 ms 31856 KB Output is correct
27 Correct 208 ms 31996 KB Output is correct
28 Correct 193 ms 31828 KB Output is correct
29 Correct 228 ms 31812 KB Output is correct
30 Correct 239 ms 31932 KB Output is correct
31 Correct 236 ms 31872 KB Output is correct
32 Correct 236 ms 31824 KB Output is correct
33 Correct 320 ms 31732 KB Output is correct
34 Correct 286 ms 31820 KB Output is correct
35 Correct 272 ms 31824 KB Output is correct
36 Correct 412 ms 31828 KB Output is correct
37 Correct 447 ms 31828 KB Output is correct
38 Correct 384 ms 31824 KB Output is correct
39 Correct 192 ms 31824 KB Output is correct
40 Correct 180 ms 31764 KB Output is correct
41 Correct 193 ms 31824 KB Output is correct
42 Correct 214 ms 32008 KB Output is correct
43 Correct 246 ms 31988 KB Output is correct
44 Correct 205 ms 31992 KB Output is correct
45 Correct 217 ms 31892 KB Output is correct
46 Correct 217 ms 31960 KB Output is correct
47 Correct 211 ms 32084 KB Output is correct
48 Correct 276 ms 31744 KB Output is correct
49 Correct 271 ms 31808 KB Output is correct
50 Correct 305 ms 31632 KB Output is correct