답안 #58968 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58968	2018-07-19T22:15:45 Z	Benq	Hacker (BOI15_hac)	C++14	100 / 100	119 ms	25664 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 500001;

int v[MX], opt[MX], N;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    FOR(i,1,N+1) cin >> v[i];
    int K = (N+1)/2;
    FOR(i,1,K+1) opt[1] += v[i];
    FOR(i,2,N+1) {
        opt[i] = opt[i-1];
        opt[i] -= v[i-1];
        if (i+K-1 <= N) opt[i] += v[i+K-1];
        else opt[i] += v[i+K-1-N];
    }
    deque<pi> d;
    int ans = 0;
    FOR(i,1,2*N+1) {
        int I = i%N; if (I == 0) I = N;
        // i to i-K+1 
        while (sz(d) && d.back().f >= opt[I]) d.pop_back();
        d.pb({opt[I],i});
        while (d.front().s <= i-K) d.pop_front();
        if (i >= K) ans = max(ans,d.front().f);
    }
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	524 KB	Output is correct
8	Correct	3 ms	528 KB	Output is correct
9	Correct	3 ms	532 KB	Output is correct
10	Correct	3 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	3 ms	648 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	3 ms	840 KB	Output is correct
18	Correct	3 ms	840 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	524 KB	Output is correct
8	Correct	3 ms	528 KB	Output is correct
9	Correct	3 ms	532 KB	Output is correct
10	Correct	3 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	3 ms	648 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	3 ms	840 KB	Output is correct
18	Correct	3 ms	840 KB	Output is correct
19	Correct	2 ms	840 KB	Output is correct
20	Correct	3 ms	840 KB	Output is correct
21	Correct	3 ms	840 KB	Output is correct
22	Correct	3 ms	840 KB	Output is correct
23	Correct	3 ms	908 KB	Output is correct
24	Correct	3 ms	908 KB	Output is correct
25	Correct	3 ms	1052 KB	Output is correct
26	Correct	3 ms	1052 KB	Output is correct
27	Correct	2 ms	1052 KB	Output is correct
28	Correct	2 ms	1052 KB	Output is correct
29	Correct	2 ms	1052 KB	Output is correct
30	Correct	2 ms	1052 KB	Output is correct
31	Correct	3 ms	1052 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1052 KB	Output is correct
2	Correct	2 ms	1052 KB	Output is correct
3	Correct	3 ms	1052 KB	Output is correct
4	Correct	16 ms	1936 KB	Output is correct
5	Correct	35 ms	3612 KB	Output is correct
6	Correct	47 ms	5220 KB	Output is correct
7	Correct	66 ms	6948 KB	Output is correct
8	Correct	103 ms	10740 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	2 ms	500 KB	Output is correct
6	Correct	2 ms	500 KB	Output is correct
7	Correct	2 ms	524 KB	Output is correct
8	Correct	3 ms	528 KB	Output is correct
9	Correct	3 ms	532 KB	Output is correct
10	Correct	3 ms	636 KB	Output is correct
11	Correct	2 ms	636 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Correct	3 ms	636 KB	Output is correct
15	Correct	3 ms	648 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	3 ms	840 KB	Output is correct
18	Correct	3 ms	840 KB	Output is correct
19	Correct	2 ms	840 KB	Output is correct
20	Correct	3 ms	840 KB	Output is correct
21	Correct	3 ms	840 KB	Output is correct
22	Correct	3 ms	840 KB	Output is correct
23	Correct	3 ms	908 KB	Output is correct
24	Correct	3 ms	908 KB	Output is correct
25	Correct	3 ms	1052 KB	Output is correct
26	Correct	3 ms	1052 KB	Output is correct
27	Correct	2 ms	1052 KB	Output is correct
28	Correct	2 ms	1052 KB	Output is correct
29	Correct	2 ms	1052 KB	Output is correct
30	Correct	2 ms	1052 KB	Output is correct
31	Correct	3 ms	1052 KB	Output is correct
32	Correct	2 ms	1052 KB	Output is correct
33	Correct	2 ms	1052 KB	Output is correct
34	Correct	3 ms	1052 KB	Output is correct
35	Correct	16 ms	1936 KB	Output is correct
36	Correct	35 ms	3612 KB	Output is correct
37	Correct	47 ms	5220 KB	Output is correct
38	Correct	66 ms	6948 KB	Output is correct
39	Correct	103 ms	10740 KB	Output is correct
40	Correct	5 ms	10740 KB	Output is correct
41	Correct	8 ms	10740 KB	Output is correct
42	Correct	8 ms	10740 KB	Output is correct
43	Correct	39 ms	10740 KB	Output is correct
44	Correct	117 ms	14052 KB	Output is correct
45	Correct	22 ms	14052 KB	Output is correct
46	Correct	57 ms	14136 KB	Output is correct
47	Correct	119 ms	17868 KB	Output is correct
48	Correct	74 ms	20312 KB	Output is correct
49	Correct	60 ms	24072 KB	Output is correct
50	Correct	62 ms	25664 KB	Output is correct

답안 #58968

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