답안 #494979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
494979	2021-12-17T19:00:05 Z	lukameladze	Money (IZhO17_money)	C++14	100 / 100	798 ms	20344 KB

money

# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
int n,a[N],dp[N],curle,pr[N],tree[4*N];
void update(int node, int le, int ri ,int idx, int val) {
    if (le > idx || ri < idx) return ;
    if (le == ri) {
        tree[node] = val;
        return ;
    }
    int mid = (le + ri) / 2;
    update(2*node,le,mid,idx,val);
    update(2*node + 1, mid + 1, ri,idx,val);
    tree[node] = tree[2*node] + tree[2*node + 1];
}
int getans(int node, int le, int ri, int start, int end) {
    if (le > end || ri < start) return 0;
    if (le >= start && ri <= end) return tree[node];
    int mid = (le + ri ) /2;
    return getans(2*node, le,mid,start,end) + getans(2*node + 1, mid + 1, ri, start,end);
}
main() {
    cin>>n;
    for (int i = 1; i <= n; i++) {
        cin>>a[i];
    }
    a[0] = 1e9 + 1;
    for (int i = 1; i <= n; i++) {
        if (a[i] >= a[i - 1]) pr[i] = pr[i - 1];
        else pr[i] = i;
    }
    curle = 1;
    for (int i = 1; i <= n; i++) {
        while(curle < i) {
            if (pr[i] > curle) {
                update(1,1,N,a[curle],1);
                curle++;
                continue;
            }
            if (a[curle] + 1 > a[i] - 1 || getans(1,1,N,a[curle] + 1, a[i] - 1) == 0){
                break;
            }
            update(1,1,N,a[curle],1);
            curle++;
        }
        //cout<<i<<" "<<curle<<endl;
        dp[i] = dp[curle - 1] + 1;
    }
    cout<<dp[n]<<endl;
    
}

Compilation message

money.cpp:25:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   25 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	1 ms	460 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	0 ms	460 KB	Output is correct
17	Correct	1 ms	460 KB	Output is correct
18	Correct	1 ms	460 KB	Output is correct
19	Correct	1 ms	460 KB	Output is correct
20	Correct	1 ms	460 KB	Output is correct
21	Correct	1 ms	460 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	1 ms	460 KB	Output is correct
33	Correct	1 ms	460 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	460 KB	Output is correct
37	Correct	2 ms	2636 KB	Output is correct
38	Correct	2 ms	2636 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	1 ms	460 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	0 ms	460 KB	Output is correct
17	Correct	1 ms	460 KB	Output is correct
18	Correct	1 ms	460 KB	Output is correct
19	Correct	1 ms	460 KB	Output is correct
20	Correct	1 ms	460 KB	Output is correct
21	Correct	1 ms	460 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	1 ms	460 KB	Output is correct
33	Correct	1 ms	460 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	460 KB	Output is correct
37	Correct	2 ms	2636 KB	Output is correct
38	Correct	2 ms	2636 KB	Output is correct
39	Correct	252 ms	6072 KB	Output is correct
40	Correct	436 ms	9796 KB	Output is correct
41	Correct	211 ms	4940 KB	Output is correct
42	Correct	200 ms	4720 KB	Output is correct
43	Correct	136 ms	3580 KB	Output is correct
44	Correct	539 ms	12260 KB	Output is correct
45	Correct	537 ms	12264 KB	Output is correct
46	Correct	553 ms	12336 KB	Output is correct
47	Correct	532 ms	12200 KB	Output is correct
48	Correct	531 ms	12100 KB	Output is correct
49	Correct	673 ms	20236 KB	Output is correct
50	Correct	642 ms	20296 KB	Output is correct
51	Correct	665 ms	20296 KB	Output is correct
52	Correct	680 ms	20320 KB	Output is correct
53	Correct	634 ms	20144 KB	Output is correct
54	Correct	629 ms	20320 KB	Output is correct
55	Correct	755 ms	20252 KB	Output is correct
56	Correct	746 ms	20276 KB	Output is correct
57	Correct	798 ms	20164 KB	Output is correct
58	Correct	755 ms	20332 KB	Output is correct
59	Correct	720 ms	20164 KB	Output is correct
60	Correct	771 ms	20344 KB	Output is correct
61	Correct	776 ms	20292 KB	Output is correct
62	Correct	779 ms	20300 KB	Output is correct

답안 #494979

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 55.0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
55.0 / 55.0