oj.uz

Submission #384655

# Submission time Handle Problem Language Result Execution time Memory
384655 2021-04-02T03:03:23 Z zoooma13 Hacker (BOI15_hac) C++14
40 / 100
 1000 ms 1644 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n ,sum = 0;
    scanf("%d",&n);
    int m = (n+1)/2;
    int l = n/2;
    vector <int> a(n);
    for(int&i : a)
        scanf("%d",&i) ,sum += i;
    a.insert(a.end() ,a.begin() ,a.end());
    int ans = 0;
    for(int i=0; i<n; i++){
        int mx = 0 ,sm = 0;
        for(int j=i+1; j<=i+l; j++)
            sm += a[j];
        mx = sm;
        for(int j=i+1; j+l<i+n; j++){
            sm = sm - a[j] + a[j+l];
            mx = max(mx ,sm);
        }
        ans = max(ans ,sum-mx);
    }
    printf("%d\n",ans);
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:8:9: warning: unused variable 'm' [-Wunused-variable]
    8 |     int m = (n+1)/2;
      |         ^
hac.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
hac.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |         scanf("%d",&i) ,sum += i;
      |         ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 23 ms 364 KB Output is correct
4 Execution timed out 1081 ms 1644 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 9 ms 364 KB Output is correct
23 Correct 22 ms 364 KB Output is correct
24 Correct 11 ms 364 KB Output is correct
25 Correct 25 ms 492 KB Output is correct
26 Correct 22 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 22 ms 364 KB Output is correct
31 Correct 25 ms 364 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 364 KB Output is correct
34 Correct 23 ms 364 KB Output is correct
35 Execution timed out 1081 ms 1644 KB Time limit exceeded
36 Halted 0 ms 0 KB -