oj.uz

Submission #176033

# Submission time Handle Problem Language Result Execution time Memory
176033 2020-01-07T17:28:58 Z mcdx9524 Bigger segments (IZhO19_segments) C++14
100 / 100
 122 ms 14224 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

int rand(int l, int r) {
    return uniform_int_distribution <int> (l, r) (rnd);
}

const int inf = 1e9 + 7;

void solve() {
    int n;
    cin >> n;
    vector <int> a(n + 1, 0);
    vector <ll> pref(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pref[i] = a[i] + pref[i - 1];
    }
    vector <pair <int, ll> > dp(n + 1, {0, inf});
    dp[0] = {0, 0};
    for (int i = 0; i <= n; i++) {
        if (i >= 1) {
            ll sum = a[i];
            if (dp[i - 1].first > dp[i].first) {
                dp[i].first = dp[i - 1].first;
                dp[i].second = dp[i - 1].second + a[i];
            } else if (dp[i - 1].first == dp[i].first) {
                dp[i].second = min(dp[i].second, dp[i - 1].second + a[i]);
            }
        }
        int l = i + 1, r = n;
        int ans = -1;
        while (l <= r) {
            int m = (l + r) / 2;
            if (pref[m] - pref[i] >= dp[i].second) {
                ans = m;
                r = m - 1;
            } else {
                l = m + 1;
            }
        }
        if (ans == -1) {
            continue;
        }
        ll sum = pref[ans] - pref[i];
        if (sum >= dp[i].second) {
            if (dp[i].first + 1 > dp[ans].first) {
                dp[ans].first = dp[i].first + 1;
                dp[ans].second = sum;
            } else if (dp[i].first + 1 == dp[ans].first) {
                dp[ans].second = min(dp[ans].second, sum);
            }
        }
    }
    cout << dp[n].first << '\n';
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int test_cnt = 1;
    //cin >> test_cnt;
    while (test_cnt--) {
        solve();
    }
    return 0;
}

Compilation message

segments.cpp: In function 'void solve()':
segments.cpp:28:16: warning: unused variable 'sum' [-Wunused-variable]
             ll sum = a[i];
                ^~~

Subtask #1
13.0 / 13.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 380 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 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct

Subtask #2
14.0 / 14.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 380 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 380 KB Output is correct
14 Correct 2 ms 376 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 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct

Subtask #3
10.0 / 10.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 380 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 380 KB Output is correct
14 Correct 2 ms 376 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 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 380 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 3 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 504 KB Output is correct

Subtask #4
36.0 / 36.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 380 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 380 KB Output is correct
14 Correct 2 ms 376 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 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 380 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 3 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 504 KB Output is correct
46 Correct 16 ms 3064 KB Output is correct
47 Correct 22 ms 3108 KB Output is correct
48 Correct 22 ms 3112 KB Output is correct
49 Correct 21 ms 3064 KB Output is correct
50 Correct 22 ms 3064 KB Output is correct
51 Correct 25 ms 3064 KB Output is correct
52 Correct 14 ms 1656 KB Output is correct
53 Correct 9 ms 1148 KB Output is correct
54 Correct 19 ms 3064 KB Output is correct
55 Correct 23 ms 3064 KB Output is correct
56 Correct 17 ms 3064 KB Output is correct
57 Correct 18 ms 3064 KB Output is correct
58 Correct 18 ms 3064 KB Output is correct
59 Correct 18 ms 3064 KB Output is correct
60 Correct 18 ms 3064 KB Output is correct

Subtask #5
27.0 / 27.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 380 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 380 KB Output is correct
14 Correct 2 ms 376 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 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 380 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 3 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 504 KB Output is correct
46 Correct 16 ms 3064 KB Output is correct
47 Correct 22 ms 3108 KB Output is correct
48 Correct 22 ms 3112 KB Output is correct
49 Correct 21 ms 3064 KB Output is correct
50 Correct 22 ms 3064 KB Output is correct
51 Correct 25 ms 3064 KB Output is correct
52 Correct 14 ms 1656 KB Output is correct
53 Correct 9 ms 1148 KB Output is correct
54 Correct 19 ms 3064 KB Output is correct
55 Correct 23 ms 3064 KB Output is correct
56 Correct 17 ms 3064 KB Output is correct
57 Correct 18 ms 3064 KB Output is correct
58 Correct 18 ms 3064 KB Output is correct
59 Correct 18 ms 3064 KB Output is correct
60 Correct 18 ms 3064 KB Output is correct
61 Correct 76 ms 14072 KB Output is correct
62 Correct 89 ms 14072 KB Output is correct
63 Correct 105 ms 14224 KB Output is correct
64 Correct 110 ms 14084 KB Output is correct
65 Correct 104 ms 14072 KB Output is correct
66 Correct 122 ms 14072 KB Output is correct
67 Correct 97 ms 11384 KB Output is correct
68 Correct 52 ms 5752 KB Output is correct
69 Correct 90 ms 14200 KB Output is correct
70 Correct 109 ms 14076 KB Output is correct
71 Correct 77 ms 14204 KB Output is correct
72 Correct 90 ms 14204 KB Output is correct
73 Correct 93 ms 14072 KB Output is correct
74 Correct 89 ms 14200 KB Output is correct
75 Correct 89 ms 14200 KB Output is correct