답안 #723551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
723551	2023-04-14T04:55:52 Z	drdilyor	Hacker (BOI15_hac)	C++17	40 / 100	1000 ms	4948 KB

hac

#include<bits/stdc++.h>
using namespace std;
using ll = long long;


int nextPower2(int n) {
    n--;
    n |= n >> 1;
    n |= n >> 2;
    n |= n >> 4;
    n |= n >> 8;
    n |= n >> 16;
    return 1+n;
}

struct segtree {
    int n;
    vector<ll> t;
    segtree(int m) : n(nextPower2(m)), t(n*2, 1e18) {}
    void upd(int l, int r, ll x, int v, int tl, int tr) {
        if (l <= tl && tr <= r) {
            t[v] = min(t[v], x);
            return;
        }
        if (tr < l || r < tl) return;
        int mid = (tl+tr) / 2;
        upd(l, r, x, v*2, tl, mid);
        upd(l, r, x, v*2+1, mid+1, tr);
    }
    void upd(int l, int r, ll x) {
        upd(l, r, x, 1, 0, n-1);
    }
    ll query(int i) {
        ll res = t[i+=n];
        for (i /= 2; i >= 1; i /= 2)
            res = min(res, t[i]);
        return res;
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;

    vector<int> arr(n*2);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
        arr[i+n] = arr[i];
    }

    segtree s(n*2);
    for (int l = 0, r = (n+1) / 2 - 1; l < n; l++, r++) {
        ll sum = accumulate(arr.begin() + l, arr.begin() + r + 1, 0ll);
        s.upd(l, r, sum);
    }
    ll res = 0;
    for (int i = 0; i < n; i++)
        res = max(res, min(s.query(i), s.query(i+n)));
    cout << res << '\n';
}

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	4 ms	468 KB	Output is correct
23	Correct	9 ms	596 KB	Output is correct
24	Correct	4 ms	468 KB	Output is correct
25	Correct	9 ms	596 KB	Output is correct
26	Correct	9 ms	596 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	9 ms	596 KB	Output is correct
31	Correct	9 ms	596 KB	Output is correct

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	10 ms	596 KB	Output is correct
4	Execution timed out	1074 ms	4948 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	4 ms	468 KB	Output is correct
23	Correct	9 ms	596 KB	Output is correct
24	Correct	4 ms	468 KB	Output is correct
25	Correct	9 ms	596 KB	Output is correct
26	Correct	9 ms	596 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	9 ms	596 KB	Output is correct
31	Correct	9 ms	596 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	10 ms	596 KB	Output is correct
35	Execution timed out	1074 ms	4948 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-