oj.uz

Submission #545980

# Submission time Handle Problem Language Result Execution time Memory
545980 2022-04-05T19:25:39 Z OttoTheDino Hacker (BOI15_hac) C++17
100 / 100
 311 ms 22376 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (ll i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (ll i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<ll> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

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

    ll n; cin >> n;
    ll w[n], k = (n+1)/2, s = 0;
    rep (i,0,n-1) cin >> w[i];
    rep (i,0,k-1) s += w[i];
    vi segs;
    rep (i,0,n-1) {
        segs.pb(s);
        s -= w[i];
        s += w[(i+k)%n];
    }
    multiset<ll> st;
    rep (i,0,k-1) st.insert(segs[i]);
    ll ans = 0;
    rep (i,0,n-1) {
        ans = max(ans, *st.begin());
        st.erase(st.find(segs[i]));
        st.insert(segs[(i+k)%n]);
    }
    cout << ans << "\n";

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 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 340 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 516 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 468 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 31 ms 3436 KB Output is correct
5 Correct 85 ms 8120 KB Output is correct
6 Correct 130 ms 10116 KB Output is correct
7 Correct 155 ms 12028 KB Output is correct
8 Correct 308 ms 19852 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 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 340 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 516 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 31 ms 3436 KB Output is correct
36 Correct 85 ms 8120 KB Output is correct
37 Correct 130 ms 10116 KB Output is correct
38 Correct 155 ms 12028 KB Output is correct
39 Correct 308 ms 19852 KB Output is correct
40 Correct 4 ms 724 KB Output is correct
41 Correct 8 ms 1112 KB Output is correct
42 Correct 12 ms 1592 KB Output is correct
43 Correct 102 ms 9008 KB Output is correct
44 Correct 286 ms 21980 KB Output is correct
45 Correct 41 ms 4560 KB Output is correct
46 Correct 155 ms 13348 KB Output is correct
47 Correct 311 ms 22044 KB Output is correct
48 Correct 251 ms 22376 KB Output is correct
49 Correct 217 ms 21416 KB Output is correct
50 Correct 204 ms 21440 KB Output is correct