oj.uz

Submission #891413

# Submission time Handle Problem Language Result Execution time Memory
891413 2023-12-23T00:21:02 Z a5a7 Hacker (BOI15_hac) C++14
100 / 100
 275 ms 20268 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    int sum[n];
    int currSum = 0;
    int val = (n+1)/2;
    for (int i = 0; i < val; i++){
        currSum += a[i];
    }
    for (int i = val; i < (val+n); i++){
        sum[i-val] = currSum;
        currSum += a[i%n];
        currSum -= a[i-val];
    }
    multiset<int> current;
    for (int i = 0; i < val; i++){
        current.insert(sum[i]);
    }
    int answer[n];
    for (int i = (val-1); i < (val-1+n); i++){
        answer[i%n] = *current.begin();
        current.erase(current.find(sum[i-val+1]));
        current.insert(sum[(i+1)%n]);
    }
    cout << *max_element(answer, answer+n) << endl;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 33 ms 3412 KB Output is correct
5 Correct 93 ms 8164 KB Output is correct
6 Correct 121 ms 10068 KB Output is correct
7 Correct 145 ms 12184 KB Output is correct
8 Correct 275 ms 20052 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 508 KB Output is correct
35 Correct 33 ms 3412 KB Output is correct
36 Correct 93 ms 8164 KB Output is correct
37 Correct 121 ms 10068 KB Output is correct
38 Correct 145 ms 12184 KB Output is correct
39 Correct 275 ms 20052 KB Output is correct
40 Correct 4 ms 600 KB Output is correct
41 Correct 8 ms 1116 KB Output is correct
42 Correct 12 ms 1372 KB Output is correct
43 Correct 102 ms 8356 KB Output is correct
44 Correct 256 ms 20188 KB Output is correct
45 Correct 41 ms 4176 KB Output is correct
46 Correct 142 ms 12116 KB Output is correct
47 Correct 269 ms 20048 KB Output is correct
48 Correct 236 ms 20268 KB Output is correct
49 Correct 207 ms 19628 KB Output is correct
50 Correct 203 ms 19496 KB Output is correct