oj.uz

Submission #1101120

# Submission time Handle Problem Language Result Execution time Memory
1101120 2024-10-15T15:14:10 Z Kodik Hacker (BOI15_hac) C++17
100 / 100
 274 ms 26188 KB 
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
#define int ll
int mod = 998244353; 


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int> arr(2*n+1, 0);
    multiset<int> vals;
    int sz = (n+1)/2;
    for(int i = 1; i <= n; ++i){
        cin >> arr[i];
        arr[i+n] = arr[i];
    }
    for(int i = 1; i <= 2*n; ++i){
        arr[i] += arr[i-1];
    }
    int ans = 0;
    vector<int> ret(n+1 ,INT_MAX);
    for(int i = 1; i <= 2*n;++i){
        if(i+sz-1<=2*n){
            vals.insert(arr[i+sz-1]-arr[i-1]);
        }
        if(i>sz){
            vals.erase(vals.find(arr[i-1]-arr[i-1-sz]));
        }
        int prev = ((i-1)%n)+1;
        ret[prev] = min(ret[prev], *vals.begin());
    }
    for(int i = 1; i <= n;++i){
        ans = max(ans, ret[i]);
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 3 ms 716 KB Output is correct
4 Correct 31 ms 4436 KB Output is correct
5 Correct 85 ms 10580 KB Output is correct
6 Correct 119 ms 13120 KB Output is correct
7 Correct 132 ms 15896 KB Output is correct
8 Correct 272 ms 25932 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 480 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 2 ms 500 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 3 ms 716 KB Output is correct
35 Correct 31 ms 4436 KB Output is correct
36 Correct 85 ms 10580 KB Output is correct
37 Correct 119 ms 13120 KB Output is correct
38 Correct 132 ms 15896 KB Output is correct
39 Correct 272 ms 25932 KB Output is correct
40 Correct 4 ms 852 KB Output is correct
41 Correct 7 ms 1364 KB Output is correct
42 Correct 10 ms 1844 KB Output is correct
43 Correct 85 ms 10720 KB Output is correct
44 Correct 274 ms 25932 KB Output is correct
45 Correct 36 ms 5492 KB Output is correct
46 Correct 139 ms 15696 KB Output is correct
47 Correct 254 ms 25932 KB Output is correct
48 Correct 207 ms 26188 KB Output is correct
49 Correct 186 ms 25420 KB Output is correct
50 Correct 187 ms 25272 KB Output is correct