oj.uz

Submission #448724

# Submission time Handle Problem Language Result Execution time Memory
448724 2021-08-01T04:35:47 Z SirCovidThe19th Hacker (BOI15_hac) C++14
100 / 100
 456 ms 18472 KB 
#include <bits/stdc++.h>
using namespace std; 

int main(){
    int n; cin >> n; int k = ceil(n/2.0), A[2*n+1] = {}, ans = 0; multiset<int> s;
    for (int i = 1; i <= n; i++) cin >> A[i], A[i+n] = A[i];
    for (int i = 1; i <= 2*n; i++) A[i] += A[i-1];
    for (int i = 1; i+k-1 <= 2*n; i++){
        s.insert(A[i+k-1]-A[i-1]);
        if (i >= k){
            ans = max(ans, *s.begin());
            s.erase(s.find(A[i]-A[i-k]));
        }
    }cout<<ans<<endl;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 3 ms 428 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 3 ms 432 KB Output is correct
31 Correct 3 ms 460 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 49 ms 3020 KB Output is correct
5 Correct 161 ms 7324 KB Output is correct
6 Correct 185 ms 9116 KB Output is correct
7 Correct 232 ms 10928 KB Output is correct
8 Correct 456 ms 17988 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 4 ms 468 KB Output is correct
26 Correct 3 ms 428 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 3 ms 432 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 4 ms 460 KB Output is correct
35 Correct 49 ms 3020 KB Output is correct
36 Correct 161 ms 7324 KB Output is correct
37 Correct 185 ms 9116 KB Output is correct
38 Correct 232 ms 10928 KB Output is correct
39 Correct 456 ms 17988 KB Output is correct
40 Correct 6 ms 588 KB Output is correct
41 Correct 12 ms 972 KB Output is correct
42 Correct 18 ms 1356 KB Output is correct
43 Correct 141 ms 7320 KB Output is correct
44 Correct 395 ms 18000 KB Output is correct
45 Correct 59 ms 3652 KB Output is correct
46 Correct 211 ms 10928 KB Output is correct
47 Correct 421 ms 18088 KB Output is correct
48 Correct 384 ms 18472 KB Output is correct
49 Correct 320 ms 17472 KB Output is correct
50 Correct 328 ms 17488 KB Output is correct