답안 #1084440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1084440	2024-09-06T08:51:34 Z	anhthi	Hacker (BOI15_hac)	C++14	100 / 100	40 ms	15700 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 = 2e6, mxm = 3e6;
const int LG = 18;

int n;
int a[mxn + 5];
int pref[mxn + 5], p[mxn + 5];

int main(void) {

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

    cin >> n;
    rep(i, n) {
        cin >> a[i];
        a[i + n] = a[i];
    }

    int v = n / 2 + (n & 1);
    rep(i, n << 1) {
        pref[i] = pref[i-1] + a[i];
        p[i] = pref[i] - (i < v ? 0 : pref[i - v]);
    }
    int ans = 0;
    deque<int> dq;
    ford(i, n << 1, 1) {
        while (!dq.empty() && p[i] < p[dq.front()])
            dq.pop_front();
        dq.push_front(i);
        while (dq.back() - i >= v)
            dq.pop_back();

        if (i + v - 1 <= (n << 1))
            maximize(ans, p[dq.back()]);
    }

    cout << ans;

    return 0;
}

Subtask #1
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	344 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 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	468 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	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	344 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 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	468 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	856 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	7 ms	2544 KB	Output is correct
5	Correct	15 ms	5764 KB	Output is correct
6	Correct	19 ms	7256 KB	Output is correct
7	Correct	25 ms	8784 KB	Output is correct
8	Correct	38 ms	14172 KB	Output is correct

Subtask #4
40.0 / 40.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	344 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 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	468 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	856 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	7 ms	2544 KB	Output is correct
36	Correct	15 ms	5764 KB	Output is correct
37	Correct	19 ms	7256 KB	Output is correct
38	Correct	25 ms	8784 KB	Output is correct
39	Correct	38 ms	14172 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	3 ms	860 KB	Output is correct
42	Correct	3 ms	1112 KB	Output is correct
43	Correct	19 ms	5976 KB	Output is correct
44	Correct	40 ms	14304 KB	Output is correct
45	Correct	8 ms	3160 KB	Output is correct
46	Correct	26 ms	8824 KB	Output is correct
47	Correct	40 ms	14164 KB	Output is correct
48	Correct	39 ms	15700 KB	Output is correct
49	Correct	31 ms	14576 KB	Output is correct
50	Correct	38 ms	14672 KB	Output is correct

답안 #1084440

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 40.0 / 40.0

Subtask #1
20.0 / 20.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
40.0 / 40.0