oj.uz

답안 #479632

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479632 2021-10-12T12:21:19 Z Lobo Hacker (BOI15_hac) C++17
100 / 100
 138 ms 22752 KB 
#include <bits/stdc++.h>
 
using namespace std;

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 1050000

ii n, v[maxn], r[maxn], ps[maxn]; 

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    cin >> n;

    for(ii i = 1; i <= n; i++) {
        cin >> v[i];
        v[i+n] = v[i];
    }

    for(ii i = 1; i <= 2*n; i++) {
        ps[i] = ps[i-1] + v[i];
        r[i] = INFii;
    }

    ii ans = 0;
    ii sz = (n+1)/2;
    //cout << sz << endl;

    priority_queue<pair<ii,ii>> pq;

    for(ii i = 1; i <= 2*n; i++) {
        if(i+sz-1 <= 2*n) pq.push(mp(-(ps[i+sz-1]-ps[i-1]),i));

        while(pq.size() && pq.top().sc <= i-sz) pq.pop();
        r[i] = -pq.top().fr;

    }

    for(ii i = 1; i <= n; i++) {
        ans = max(ans, min(r[i],r[i+n]));
        //cout << i << " " << min(r[i],r[i+n]) << endl;
    }

    cout << ans << endl;



}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 20 ms 3336 KB Output is correct
5 Correct 55 ms 7144 KB Output is correct
6 Correct 72 ms 8276 KB Output is correct
7 Correct 60 ms 11588 KB Output is correct
8 Correct 96 ms 20316 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 20 ms 3336 KB Output is correct
36 Correct 55 ms 7144 KB Output is correct
37 Correct 72 ms 8276 KB Output is correct
38 Correct 60 ms 11588 KB Output is correct
39 Correct 96 ms 20316 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 4 ms 1232 KB Output is correct
42 Correct 8 ms 1792 KB Output is correct
43 Correct 69 ms 10044 KB Output is correct
44 Correct 102 ms 22492 KB Output is correct
45 Correct 34 ms 4176 KB Output is correct
46 Correct 65 ms 12852 KB Output is correct
47 Correct 92 ms 22576 KB Output is correct
48 Correct 86 ms 22752 KB Output is correct
49 Correct 138 ms 21952 KB Output is correct
50 Correct 133 ms 21904 KB Output is correct