oj.uz

답안 #628046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628046 2022-08-13T03:57:01 Z vbee Bigger segments (IZhO19_segments) C++14
100 / 100
 167 ms 34544 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define TASK "simpsegments"
#define pb push_back
#define all(r) (r).begin(), (r).end()
#define ll long long
#define MASK(i) (1 << (i))
#define BIT(x, i) ((x) >> (i) & 1)

using namespace std;

const int LOG = 19;
const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int N = 5e5 + 7;

int n, trace[N];
ll f[N], pre[N], a[N];

bool minimize(ll &a, ll b){
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

struct segtree{
    vector<ll> t;
    segtree(int _n){
        t.resize(4 * _n + 7);
        for (int i = 1; i < 4 * _n; i++) t[i] = loo;
    }
    void update(int v, int lt, int rt, int pos, ll value){
        if (lt == rt) return (void)(t[v] = value);
        int middle = (rt + lt) / 2;
        if (pos <= middle) update(v * 2, lt, middle, pos, value);
        else update(v * 2 + 1, middle + 1, rt, pos, value);
        t[v] = min(t[v * 2], t[v * 2 + 1]);
    }

    int getid(int v, int lt, int rt, ll value){
        if (t[v] > value) return -1;
        if (lt == rt) return lt;
        int middle = (rt + lt) / 2;
        int temp = getid(v * 2 + 1, middle + 1, rt, value);
        if (temp == -1) return getid(v * 2, lt, middle, value);
        else return temp;
    }
};
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen(TASK".inp", "r", stdin);
//    freopen(TASK".out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];

    for (int i = 1; i <= n; i++) f[i] = loo;
    segtree seg(n + 1);
    seg.update(1, 1, n + 1, 1, 0);
    for (int i = 1; i <= n; i++){
        int cur = seg.getid(1, 1, n + 1, pre[i]);
        if (minimize(f[i], pre[i] - pre[cur - 1])) trace[i] = cur - 1;
        seg.update(1, 1, n + 1, i + 1, f[i] + pre[i]);
    }
    int cur = n, res = 0;
    while (cur != 0) {
        cur = trace[cur];
        res++;
    }
    cout << res;
//    }
    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 284 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 340 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 328 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 284 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 340 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 328 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 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 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 284 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 340 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 328 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 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 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 464 KB Output is correct
45 Correct 1 ms 468 KB Output is correct

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 284 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 340 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 328 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 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 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 464 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 23 ms 6612 KB Output is correct
47 Correct 24 ms 6616 KB Output is correct
48 Correct 26 ms 6980 KB Output is correct
49 Correct 28 ms 7096 KB Output is correct
50 Correct 32 ms 7116 KB Output is correct
51 Correct 38 ms 7132 KB Output is correct
52 Correct 14 ms 3668 KB Output is correct
53 Correct 9 ms 2308 KB Output is correct
54 Correct 24 ms 6368 KB Output is correct
55 Correct 32 ms 7156 KB Output is correct
56 Correct 27 ms 6604 KB Output is correct
57 Correct 25 ms 6580 KB Output is correct
58 Correct 26 ms 6604 KB Output is correct
59 Correct 27 ms 6740 KB Output is correct
60 Correct 33 ms 6768 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 284 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 340 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 328 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 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 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 464 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 23 ms 6612 KB Output is correct
47 Correct 24 ms 6616 KB Output is correct
48 Correct 26 ms 6980 KB Output is correct
49 Correct 28 ms 7096 KB Output is correct
50 Correct 32 ms 7116 KB Output is correct
51 Correct 38 ms 7132 KB Output is correct
52 Correct 14 ms 3668 KB Output is correct
53 Correct 9 ms 2308 KB Output is correct
54 Correct 24 ms 6368 KB Output is correct
55 Correct 32 ms 7156 KB Output is correct
56 Correct 27 ms 6604 KB Output is correct
57 Correct 25 ms 6580 KB Output is correct
58 Correct 26 ms 6604 KB Output is correct
59 Correct 27 ms 6740 KB Output is correct
60 Correct 33 ms 6768 KB Output is correct
61 Correct 124 ms 31628 KB Output is correct
62 Correct 147 ms 31552 KB Output is correct
63 Correct 133 ms 32008 KB Output is correct
64 Correct 146 ms 34208 KB Output is correct
65 Correct 156 ms 34452 KB Output is correct
66 Correct 167 ms 34404 KB Output is correct
67 Correct 120 ms 27612 KB Output is correct
68 Correct 57 ms 13900 KB Output is correct
69 Correct 133 ms 30736 KB Output is correct
70 Correct 151 ms 34544 KB Output is correct
71 Correct 132 ms 31612 KB Output is correct
72 Correct 130 ms 32076 KB Output is correct
73 Correct 138 ms 32492 KB Output is correct
74 Correct 144 ms 32972 KB Output is correct
75 Correct 147 ms 32924 KB Output is correct