oj.uz

Submission #137483

# Submission time Handle Problem Language Result Execution time Memory
137483 2019-07-28T03:22:30 Z silxikys Hacker (BOI15_hac) C++14
60 / 100
 60 ms 10360 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 5e5+5;
int n;
int v[2*maxn];
int pre[2*maxn];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        v[i+n] = v[i];
    }
    pre[0] = v[0];
    for (int i = 1; i < 2*n; i++) {
        pre[i] = pre[i-1] + v[i];
    }
    int total = pre[n-1];
    if (n <= 5000) {
        int res = 0;
        for (int i = 0; i < n; i++) {
            int maxSum = 0;
            for (int j = i+n/2; j < i+n; j++) {
                maxSum = max(maxSum,pre[j]-pre[j-n/2]);
            }
            res = max(res,total-maxSum);
        }
        cout << res << '\n';
    }
    else {
        int res = 0;
        for (int i = 0; i < 1; i++) {
            int maxSum = 0;
            for (int j = i+n/2; j < i+n; j++) {
                maxSum = max(maxSum,pre[j]-pre[j-n/2]);
            }
            res = max(res,total-maxSum);
        }
        cout << res << '\n';
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 15 ms 376 KB Output is correct
4 Correct 11 ms 2040 KB Output is correct
5 Correct 22 ms 4216 KB Output is correct
6 Correct 31 ms 5368 KB Output is correct
7 Correct 36 ms 6392 KB Output is correct
8 Correct 60 ms 10360 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 14 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 14 ms 504 KB Output is correct
26 Correct 14 ms 508 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 380 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 14 ms 376 KB Output is correct
31 Correct 14 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 15 ms 376 KB Output is correct
35 Correct 11 ms 2040 KB Output is correct
36 Correct 22 ms 4216 KB Output is correct
37 Correct 31 ms 5368 KB Output is correct
38 Correct 36 ms 6392 KB Output is correct
39 Correct 60 ms 10360 KB Output is correct
40 Incorrect 3 ms 632 KB Output isn't correct
41 Halted 0 ms 0 KB -