oj.uz

답안 #862985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862985 2023-10-19T12:30:39 Z somethingnew Bigger segments (IZhO19_segments) C++17
100 / 100
 414 ms 50048 KB 
//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
#define int long long
void upd(pair<int, int> &a, pair<int, int> b) {
    if (a.first < b.first)
        a = b;
    if (a.first == b.first)
        a = min(a, b);
}
struct myset {
    set<pair<int, pair<int, int>>> st;
    void add(int x, pair<int, int> y) {
        /*cout << "ADD " << x << ' ' << y.first << ' ' << y.second << '\n';
        for (auto i : st)
            cout << i.first << ' ' << i.second.first << ' ' << i.second.second << '\n';
        cout << '\n';*/
        while (1) {
            auto it = st.lower_bound({x, {-1, -1}});
            if (it == st.end())
                break;
            if (y >= ((*it).second))
                st.erase(it);
            else
                break;
        }
        auto it = st.lower_bound({x+1, {-1, -1}});
        if (it != st.begin()) {
            it--;
            if ((*it).second >= y)
                return;
        }
        st.insert({x, y});
    }
    pair<int, int> get(int x) {
        auto it = st.lower_bound({x+1, {-1, -1}});
        if (it != st.begin()) {
            it--;
            return it->second;
        }
        return {-1e9, 0};
    }
};
void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> prf(n + 1);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        prf[i + 1] = prf[i] + a[i];
    }
    vector<pair<int, int>> dp(n + 1, {-1e9, 0});
    dp[0] = {0, 0};
    myset st;
    st.add(0, {0, 0});
    for (int i = 1; i <= n; ++i) {
        //cout << i << endl;
        int vl = prf[i];
        pair<int, int> gt = st.get(vl);
        upd(dp[i], {gt.first + 1, vl - gt.second});
       st.add(dp[i].second + prf[i], {dp[i].first, prf[i]});
    }
    cout << dp[n].first << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 596 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 596 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 2 ms 600 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 2 ms 856 KB Output is correct

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 596 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 2 ms 600 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 2 ms 856 KB Output is correct
46 Correct 44 ms 9816 KB Output is correct
47 Correct 42 ms 8240 KB Output is correct
48 Correct 39 ms 4812 KB Output is correct
49 Correct 52 ms 7764 KB Output is correct
50 Correct 51 ms 10500 KB Output is correct
51 Correct 50 ms 9312 KB Output is correct
52 Correct 29 ms 5024 KB Output is correct
53 Correct 14 ms 3056 KB Output is correct
54 Correct 49 ms 8144 KB Output is correct
55 Correct 53 ms 9924 KB Output is correct
56 Correct 49 ms 10168 KB Output is correct
57 Correct 46 ms 9524 KB Output is correct
58 Correct 48 ms 9556 KB Output is correct
59 Correct 49 ms 10172 KB Output is correct
60 Correct 55 ms 10324 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 756 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 596 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 2 ms 600 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 2 ms 856 KB Output is correct
46 Correct 44 ms 9816 KB Output is correct
47 Correct 42 ms 8240 KB Output is correct
48 Correct 39 ms 4812 KB Output is correct
49 Correct 52 ms 7764 KB Output is correct
50 Correct 51 ms 10500 KB Output is correct
51 Correct 50 ms 9312 KB Output is correct
52 Correct 29 ms 5024 KB Output is correct
53 Correct 14 ms 3056 KB Output is correct
54 Correct 49 ms 8144 KB Output is correct
55 Correct 53 ms 9924 KB Output is correct
56 Correct 49 ms 10168 KB Output is correct
57 Correct 46 ms 9524 KB Output is correct
58 Correct 48 ms 9556 KB Output is correct
59 Correct 49 ms 10172 KB Output is correct
60 Correct 55 ms 10324 KB Output is correct
61 Correct 302 ms 48476 KB Output is correct
62 Correct 347 ms 48656 KB Output is correct
63 Correct 329 ms 40416 KB Output is correct
64 Correct 313 ms 24916 KB Output is correct
65 Correct 395 ms 50048 KB Output is correct
66 Correct 377 ms 43344 KB Output is correct
67 Correct 368 ms 34956 KB Output is correct
68 Correct 128 ms 18036 KB Output is correct
69 Correct 382 ms 39508 KB Output is correct
70 Correct 358 ms 48116 KB Output is correct
71 Correct 406 ms 48700 KB Output is correct
72 Correct 367 ms 42704 KB Output is correct
73 Correct 352 ms 44372 KB Output is correct
74 Correct 377 ms 49200 KB Output is correct
75 Correct 414 ms 49092 KB Output is correct