답안 #531984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531984	2022-03-02T02:53:43 Z	wiwiho	Bigger segments (IZhO19_segments)	C++14	100 / 100	102 ms	24768 KB

segments

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int main(){
    StarBurstStream

    int n;
    cin >> n;
    vector<ll> a(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        a[i] += a[i - 1];
    }

    vector<ll> ep(n + 1), dp(n + 1);
    vector<pll> mx(n + 1);
    
    for(int i = 1; i <= n; i++){
        mx[i] = max(mx[i], mx[i - 1]);
        int id = mx[i].S;
        ep[i] = a[i] - a[id];
        dp[i] = dp[id] + 1;
        int nxt = lower_bound(iter(a), ep[i] + a[i]) - a.begin();
        if(nxt <= n) mx[nxt] = max(mx[nxt], mp(a[i], (ll)i));
    }

    /*printv(ep, cerr);
    printv(dp, cerr);
    printv(mx, cerr);*/
    
    cout << dp[n] << "\n";

    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	308 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	308 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	316 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	312 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	304 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	352 KB	Output is correct
33	Correct	1 ms	452 KB	Output is correct
34	Correct	1 ms	452 KB	Output is correct
35	Correct	2 ms	332 KB	Output is correct
36	Correct	1 ms	460 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	460 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct

Subtask #4
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	308 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	308 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	316 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	312 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	304 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	352 KB	Output is correct
33	Correct	1 ms	452 KB	Output is correct
34	Correct	1 ms	452 KB	Output is correct
35	Correct	2 ms	332 KB	Output is correct
36	Correct	1 ms	460 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	460 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	11 ms	4556 KB	Output is correct
47	Correct	13 ms	4628 KB	Output is correct
48	Correct	16 ms	5040 KB	Output is correct
49	Correct	17 ms	5040 KB	Output is correct
50	Correct	16 ms	5176 KB	Output is correct
51	Correct	21 ms	5180 KB	Output is correct
52	Correct	10 ms	2716 KB	Output is correct
53	Correct	8 ms	1728 KB	Output is correct
54	Correct	12 ms	4384 KB	Output is correct
55	Correct	17 ms	5164 KB	Output is correct
56	Correct	13 ms	4672 KB	Output is correct
57	Correct	12 ms	4672 KB	Output is correct
58	Correct	12 ms	4684 KB	Output is correct
59	Correct	14 ms	4812 KB	Output is correct
60	Correct	13 ms	4788 KB	Output is correct

Subtask #5
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	308 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	308 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	316 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	312 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	304 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	352 KB	Output is correct
33	Correct	1 ms	452 KB	Output is correct
34	Correct	1 ms	452 KB	Output is correct
35	Correct	2 ms	332 KB	Output is correct
36	Correct	1 ms	460 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	460 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	11 ms	4556 KB	Output is correct
47	Correct	13 ms	4628 KB	Output is correct
48	Correct	16 ms	5040 KB	Output is correct
49	Correct	17 ms	5040 KB	Output is correct
50	Correct	16 ms	5176 KB	Output is correct
51	Correct	21 ms	5180 KB	Output is correct
52	Correct	10 ms	2716 KB	Output is correct
53	Correct	8 ms	1728 KB	Output is correct
54	Correct	12 ms	4384 KB	Output is correct
55	Correct	17 ms	5164 KB	Output is correct
56	Correct	13 ms	4672 KB	Output is correct
57	Correct	12 ms	4672 KB	Output is correct
58	Correct	12 ms	4684 KB	Output is correct
59	Correct	14 ms	4812 KB	Output is correct
60	Correct	13 ms	4788 KB	Output is correct
61	Correct	54 ms	21796 KB	Output is correct
62	Correct	71 ms	21740 KB	Output is correct
63	Correct	61 ms	22136 KB	Output is correct
64	Correct	83 ms	24300 KB	Output is correct
65	Correct	92 ms	24684 KB	Output is correct
66	Correct	89 ms	24664 KB	Output is correct
67	Correct	65 ms	19932 KB	Output is correct
68	Correct	32 ms	10052 KB	Output is correct
69	Correct	56 ms	20860 KB	Output is correct
70	Correct	102 ms	24768 KB	Output is correct
71	Correct	68 ms	21848 KB	Output is correct
72	Correct	60 ms	22128 KB	Output is correct
73	Correct	73 ms	22768 KB	Output is correct
74	Correct	79 ms	23108 KB	Output is correct
75	Correct	67 ms	23108 KB	Output is correct

답안 #531984

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 10.0 / 10.0

Subtask #4 36.0 / 36.0

Subtask #5 27.0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
10.0 / 10.0

Subtask #4
36.0 / 36.0

Subtask #5
27.0 / 27.0