oj.uz

Submission #440177

# Submission time Handle Problem Language Result Execution time Memory
440177 2021-07-01T16:58:43 Z CodeChamp_SS Hacker (BOI15_hac) C++17
100 / 100
 542 ms 37976 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define ff                  first
#define ss                  second
#define pb                  push_back
#define eb                  emplace_back
#define mp                  make_pair
#define lb                  lower_bound
#define ub                  upper_bound
#define setbits(x)          __builtin_popcountll(x)
#define zrobits(x)          __builtin_ctzll(x)
#define sz(v)               (int)v.size()
#define ps(y)               cout << fixed << setprecision(y)
#define ms(arr, v)          memset(arr, v, sizeof(arr))
#define all(v)              v.begin(), v.end()
#define rall(v)             v.rbegin(), v.rend()
#define trav(x, v)          for(auto &x: v)
#define w(t)                int t; cin >> t; while(t--)
#define rep0(i, n)          for(int i = 0; i < n; i++)
#define rrep0(i, n)         for(int i = n - 1; i >= 0; i--)
#define rep1(i, n)          for(int i = 1; i <= n; i++)
#define rrep1(i, n)         for(int i = n; i > 0; i--)
#define inp(arr, n)         rep0(i, n) cin >> arr[i];
#define rep(i, a, b)        for(int i = a; i <= b; i++)
#define rrep(i, a, b)       for(int i = a; i >= b; i--)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef map<ll, ll> mii;
typedef map<char, ll> mci;
typedef priority_queue<ll> pq_mx;
typedef priority_queue<ll, vi, greater<>> pq_mn;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> pbds;
/*
 * find_by_order(i) -> returns an iterator to the element at ith position (0 based)
 * order_of_key(i)  -> returns the position of element i (0 based)
 */

const int N = 1e6 + 5;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const ll inf = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void fio() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
}

ll n, a[N], pre[N], sub[N];

int main() {
    fio();

    cin >> n;
    inp(a, n)
    rep(x, n, 2 * n - 1) a[x] = a[x - n];
    rep1(x, 2 * n) pre[x] = pre[x - 1] + a[x - 1];

    trav(x, sub) x = 1e9;
    ll k = (n + 1) / 2;
    multiset<ll> st;
    rep1(x, 2 * n) {
        if (x + k - 1 <= 2 * n) st.insert(pre[x + k - 1] - pre[x - 1]);
        if (x > k) st.erase(st.find(pre[x - 1] - pre[x - k - 1]));
        sub[(x - 1) % n] = min(sub[(x - 1) % n], *st.begin());
    }

    ll res = 0;
    rep0(x, n) res = max(res, sub[x]);
    cout << res;

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 4 ms 8140 KB Output is correct
3 Correct 5 ms 8140 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8140 KB Output is correct
7 Correct 6 ms 8136 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 5 ms 8140 KB Output is correct
10 Correct 5 ms 8140 KB Output is correct
11 Correct 5 ms 8140 KB Output is correct
12 Correct 5 ms 8136 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 5 ms 8140 KB Output is correct
17 Correct 5 ms 8140 KB Output is correct
18 Correct 5 ms 8140 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 4 ms 8140 KB Output is correct
3 Correct 5 ms 8140 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8140 KB Output is correct
7 Correct 6 ms 8136 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 5 ms 8140 KB Output is correct
10 Correct 5 ms 8140 KB Output is correct
11 Correct 5 ms 8140 KB Output is correct
12 Correct 5 ms 8136 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 5 ms 8140 KB Output is correct
17 Correct 5 ms 8140 KB Output is correct
18 Correct 5 ms 8140 KB Output is correct
19 Correct 6 ms 8140 KB Output is correct
20 Correct 5 ms 8140 KB Output is correct
21 Correct 5 ms 8140 KB Output is correct
22 Correct 6 ms 8268 KB Output is correct
23 Correct 7 ms 8396 KB Output is correct
24 Correct 6 ms 8268 KB Output is correct
25 Correct 7 ms 8396 KB Output is correct
26 Correct 7 ms 8396 KB Output is correct
27 Correct 5 ms 8140 KB Output is correct
28 Correct 4 ms 8132 KB Output is correct
29 Correct 4 ms 8140 KB Output is correct
30 Correct 7 ms 8396 KB Output is correct
31 Correct 7 ms 8396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 5 ms 8140 KB Output is correct
3 Correct 7 ms 8396 KB Output is correct
4 Correct 49 ms 12536 KB Output is correct
5 Correct 135 ms 19104 KB Output is correct
6 Correct 226 ms 21832 KB Output is correct
7 Correct 226 ms 24700 KB Output is correct
8 Correct 542 ms 35528 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 4 ms 8140 KB Output is correct
3 Correct 5 ms 8140 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8140 KB Output is correct
7 Correct 6 ms 8136 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 5 ms 8140 KB Output is correct
10 Correct 5 ms 8140 KB Output is correct
11 Correct 5 ms 8140 KB Output is correct
12 Correct 5 ms 8136 KB Output is correct
13 Correct 4 ms 8140 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 5 ms 8140 KB Output is correct
16 Correct 5 ms 8140 KB Output is correct
17 Correct 5 ms 8140 KB Output is correct
18 Correct 5 ms 8140 KB Output is correct
19 Correct 6 ms 8140 KB Output is correct
20 Correct 5 ms 8140 KB Output is correct
21 Correct 5 ms 8140 KB Output is correct
22 Correct 6 ms 8268 KB Output is correct
23 Correct 7 ms 8396 KB Output is correct
24 Correct 6 ms 8268 KB Output is correct
25 Correct 7 ms 8396 KB Output is correct
26 Correct 7 ms 8396 KB Output is correct
27 Correct 5 ms 8140 KB Output is correct
28 Correct 4 ms 8132 KB Output is correct
29 Correct 4 ms 8140 KB Output is correct
30 Correct 7 ms 8396 KB Output is correct
31 Correct 7 ms 8396 KB Output is correct
32 Correct 5 ms 8140 KB Output is correct
33 Correct 5 ms 8140 KB Output is correct
34 Correct 7 ms 8396 KB Output is correct
35 Correct 49 ms 12536 KB Output is correct
36 Correct 135 ms 19104 KB Output is correct
37 Correct 226 ms 21832 KB Output is correct
38 Correct 226 ms 24700 KB Output is correct
39 Correct 542 ms 35528 KB Output is correct
40 Correct 10 ms 8752 KB Output is correct
41 Correct 14 ms 9332 KB Output is correct
42 Correct 20 ms 9944 KB Output is correct
43 Correct 137 ms 19992 KB Output is correct
44 Correct 397 ms 37700 KB Output is correct
45 Correct 61 ms 13972 KB Output is correct
46 Correct 216 ms 26024 KB Output is correct
47 Correct 474 ms 37704 KB Output is correct
48 Correct 313 ms 37976 KB Output is correct
49 Correct 318 ms 37104 KB Output is correct
50 Correct 282 ms 36992 KB Output is correct