oj.uz

답안 #720144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720144 2023-04-07T13:49:13 Z Trent Hacker (BOI15_hac) C++17
100 / 100
 135 ms 15612 KB 
#include "bits/stdc++.h"
 
using namespace std;
#define forR(i, a) for(int i = 0; (i) < (a); ++(i))
#define REP(i, a, b) for(int i = (a); (i) < (b); ++i)
#define all(a) a.begin(), a.end()
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define printArr(arr) for(int asdfg : arr) cout << asdfg << ' '; cout << '\n'
#define open(x) freopen(((string) x + ".in").c_str(), "r", stdin); freopen(((string) x + ".out").c_str(), "w", stdout);
typedef long long ll;
struct pii{int a, b;};

const int MN = 2e6 + 10;
int v[MN], ra[MN];

signed main(){
    int n; cin >> n;
    int su = 0;
    forR(i, n) {
        cin >> v[i];
        su += v[i];
    }
    forR(i, n) v[i + n] = v[i + 2 * n] = v[i];
    int oSiz = n / 2;
    for(int i=0, oWin=0; i < 3 * n; ++i){
        oWin += v[i] - (i >= oSiz ? v[i-oSiz] : 0);
        if(i >= oSiz - 1) ra[i - oSiz + 1] = oWin;
    }
    deque<pii> ma;
    REP(i, 1, n-oSiz) {
        while(!ma.empty() && ma.back().b < ra[i]) ma.pop_back();
        ma.push_back({i, ra[i]});
    }
    int bes = 0;
    forR(i, n){
        int nex = i + n - oSiz;
        while(!ma.empty() && ma.back().b < ra[nex]) ma.pop_back();
        ma.push_back({nex, ra[nex]});
        if(i >= ma.front().a) ma.pop_front();
        bes = max(bes, su - ma.front().b);
    }
    cout << bes << '\n';
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 312 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 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 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 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 312 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 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 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 212 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 2 ms 444 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 304 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 452 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 20 ms 2368 KB Output is correct
5 Correct 53 ms 5388 KB Output is correct
6 Correct 62 ms 6756 KB Output is correct
7 Correct 75 ms 8088 KB Output is correct
8 Correct 132 ms 13296 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 312 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 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 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 212 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 2 ms 444 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 304 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 452 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 20 ms 2368 KB Output is correct
36 Correct 53 ms 5388 KB Output is correct
37 Correct 62 ms 6756 KB Output is correct
38 Correct 75 ms 8088 KB Output is correct
39 Correct 132 ms 13296 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 7 ms 724 KB Output is correct
42 Correct 8 ms 1108 KB Output is correct
43 Correct 51 ms 5484 KB Output is correct
44 Correct 135 ms 13148 KB Output is correct
45 Correct 22 ms 2772 KB Output is correct
46 Correct 92 ms 7980 KB Output is correct
47 Correct 122 ms 13164 KB Output is correct
48 Correct 128 ms 15612 KB Output is correct
49 Correct 109 ms 14620 KB Output is correct
50 Correct 104 ms 14664 KB Output is correct