oj.uz

답안 #1093141

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093141 2024-09-26T02:55:56 Z anhthi Candies (JOI18_candies) C++14
100 / 100
 69 ms 11196 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }

template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }

template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }

int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}

const ll oo = (ll) 1e17;
const int inf = (ll) 2e9 + 7, mod = (ll) 1e9 + 7;

const int mxn = 2e5 + 5, mxm = 3e2 + 5;
const int LG = 18, BASE = 311, BLOCK = 350;

void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n;
ll a[mxn];

int pre[mxn], nxt[mxn], del[mxn];
priority_queue<pair<ll, int>> pq;

int main(void) {

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #define TASK "cquery"
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    cin >> n;
    rep(i, n) {
        cin >> a[i];
        pq.push({a[i], i});
        nxt[i] = i + 1;
        pre[i] = i - 1;
    }

    ll cur = 0;
    a[0] = a[n + 1] = -oo;

    for (int i = 1; i <= (n + 1) / 2; ++i) {

        while (del[ pq.top().se ]) pq.pop();

        int x = pq.top().se; pq.pop();
        cur += a[x];
        a[x] = a[pre[x]] + a[nxt[x]] - a[x];

        pq.push({a[x], x});
        del[pre[x]] = del[nxt[x]] = true;
        nxt[x] = nxt[nxt[x]];
        pre[x] = pre[pre[x]];
        nxt[pre[x]] = x;
        pre[nxt[x]] = x;

        cout << cur << '\n';
    }

    return 0;
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
candies.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 476 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 476 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 67 ms 10888 KB Output is correct
22 Correct 68 ms 11044 KB Output is correct
23 Correct 69 ms 10984 KB Output is correct
24 Correct 53 ms 10688 KB Output is correct
25 Correct 53 ms 10720 KB Output is correct
26 Correct 52 ms 10684 KB Output is correct
27 Correct 62 ms 11196 KB Output is correct
28 Correct 63 ms 10944 KB Output is correct
29 Correct 61 ms 10944 KB Output is correct
30 Correct 60 ms 10944 KB Output is correct
31 Correct 68 ms 11060 KB Output is correct
32 Correct 61 ms 10912 KB Output is correct
33 Correct 61 ms 10684 KB Output is correct
34 Correct 61 ms 10688 KB Output is correct
35 Correct 62 ms 10688 KB Output is correct
36 Correct 66 ms 10944 KB Output is correct
37 Correct 68 ms 10944 KB Output is correct
38 Correct 69 ms 10956 KB Output is correct
39 Correct 56 ms 10688 KB Output is correct
40 Correct 56 ms 10668 KB Output is correct
41 Correct 58 ms 10696 KB Output is correct
42 Correct 62 ms 10992 KB Output is correct
43 Correct 63 ms 10948 KB Output is correct
44 Correct 66 ms 10944 KB Output is correct
45 Correct 66 ms 10940 KB Output is correct
46 Correct 61 ms 10984 KB Output is correct
47 Correct 62 ms 10940 KB Output is correct
48 Correct 65 ms 10612 KB Output is correct
49 Correct 63 ms 10688 KB Output is correct
50 Correct 63 ms 10692 KB Output is correct