답안 #39380 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39380	2018-01-13T10:46:15 Z	Extazy	Money (IZhO17_money)	C++14	25 / 100	3 ms	18780 KB

money

#include <bits/stdc++.h>
#define endl '\n'
#define prev kjlahjkghakj
#define left iljhghakjja
#define right lkhljahjkajhahja

using namespace std;

const int N = 1000007;

int n,a[N];
bool used[N];
int state[N];
int left[N],right[N];

multiset < int >::iterator prev(multiset < int >::iterator it) {
    --it;
    return it;
}

bool are_consecutive(multiset < int > &s, int v1, int v2) {
    if(v1==v2) return true;
    return *prev(s.lower_bound(v2))==v1; 
}

int recurse(int pos) {
    if(pos<1) return 0;
    if(used[pos]) return state[pos];

    used[pos]=true;

    int i,ans=recurse(pos-1)+1;
    multiset < int > s;
    int leftmost=pos,rightmost=pos;

    for(i=1;i<=pos;i++) s.insert(a[i]);
    for(i=pos-1;i>=1;i--) {
        if(!are_consecutive(s,a[i],a[i+1])) break;
        if(a[i]<a[i+1]) {
            if(a[i+1]!=a[pos]) {
                leftmost=min(leftmost,left[a[i+1]]);
                rightmost=max(rightmost,right[a[i+1]]);
            }
        }
        if(leftmost<i || rightmost>pos) break;
        ans=min(ans,1+recurse(i-1));
    }

    return state[pos]=ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int i;

    scanf("%d", &n);
    for(i=1;i<=n;i++) {
        scanf("%d", &a[i]);
        right[a[i]]=i;
    }
    for(i=n;i>=1;i--) {
        left[a[i]]=i;
    }

    printf("%d\n", recurse(n));

    return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:57:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
money.cpp:59:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
                           ^

Subtask #1
9.0 / 9.0

#	결과	메모리	Grader output
1	Correct	18780 KB	Output is correct
2	Correct	18780 KB	Output is correct
3	Correct	18780 KB	Output is correct
4	Correct	18780 KB	Output is correct
5	Correct	18780 KB	Output is correct
6	Correct	18780 KB	Output is correct
7	Correct	18780 KB	Output is correct
8	Correct	18780 KB	Output is correct
9	Correct	18780 KB	Output is correct
10	Correct	18780 KB	Output is correct
11	Correct	18780 KB	Output is correct
12	Correct	18780 KB	Output is correct
13	Correct	18780 KB	Output is correct
14	Correct	18780 KB	Output is correct
15	Correct	18780 KB	Output is correct
16	Correct	18780 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	메모리	Grader output
1	Correct	18780 KB	Output is correct
2	Correct	18780 KB	Output is correct
3	Correct	18780 KB	Output is correct
4	Correct	18780 KB	Output is correct
5	Correct	18780 KB	Output is correct
6	Correct	18780 KB	Output is correct
7	Correct	18780 KB	Output is correct
8	Correct	18780 KB	Output is correct
9	Correct	18780 KB	Output is correct
10	Correct	18780 KB	Output is correct
11	Correct	18780 KB	Output is correct
12	Correct	18780 KB	Output is correct
13	Correct	18780 KB	Output is correct
14	Correct	18780 KB	Output is correct
15	Correct	18780 KB	Output is correct
16	Correct	18780 KB	Output is correct
17	Correct	18780 KB	Output is correct
18	Correct	18780 KB	Output is correct
19	Correct	18780 KB	Output is correct
20	Correct	18780 KB	Output is correct
21	Correct	18780 KB	Output is correct
22	Correct	18780 KB	Output is correct
23	Correct	18780 KB	Output is correct
24	Correct	18780 KB	Output is correct
25	Correct	18780 KB	Output is correct
26	Correct	18780 KB	Output is correct

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	18780 KB	Output is correct
2	Correct	0 ms	18780 KB	Output is correct
3	Correct	0 ms	18780 KB	Output is correct
4	Correct	0 ms	18780 KB	Output is correct
5	Correct	0 ms	18780 KB	Output is correct
6	Correct	0 ms	18780 KB	Output is correct
7	Correct	0 ms	18780 KB	Output is correct
8	Correct	0 ms	18780 KB	Output is correct
9	Correct	0 ms	18780 KB	Output is correct
10	Correct	0 ms	18780 KB	Output is correct
11	Correct	0 ms	18780 KB	Output is correct
12	Correct	0 ms	18780 KB	Output is correct
13	Correct	0 ms	18780 KB	Output is correct
14	Correct	0 ms	18780 KB	Output is correct
15	Correct	0 ms	18780 KB	Output is correct
16	Correct	0 ms	18780 KB	Output is correct
17	Correct	0 ms	18780 KB	Output is correct
18	Correct	0 ms	18780 KB	Output is correct
19	Correct	0 ms	18780 KB	Output is correct
20	Correct	0 ms	18780 KB	Output is correct
21	Correct	0 ms	18780 KB	Output is correct
22	Correct	0 ms	18780 KB	Output is correct
23	Correct	0 ms	18780 KB	Output is correct
24	Correct	0 ms	18780 KB	Output is correct
25	Correct	0 ms	18780 KB	Output is correct
26	Correct	0 ms	18780 KB	Output is correct
27	Correct	0 ms	18780 KB	Output is correct
28	Correct	0 ms	18780 KB	Output is correct
29	Correct	0 ms	18780 KB	Output is correct
30	Correct	0 ms	18780 KB	Output is correct
31	Correct	0 ms	18780 KB	Output is correct
32	Incorrect	3 ms	18780 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	18780 KB	Output is correct
2	Correct	0 ms	18780 KB	Output is correct
3	Correct	0 ms	18780 KB	Output is correct
4	Correct	0 ms	18780 KB	Output is correct
5	Correct	0 ms	18780 KB	Output is correct
6	Correct	0 ms	18780 KB	Output is correct
7	Correct	0 ms	18780 KB	Output is correct
8	Correct	0 ms	18780 KB	Output is correct
9	Correct	0 ms	18780 KB	Output is correct
10	Correct	0 ms	18780 KB	Output is correct
11	Correct	0 ms	18780 KB	Output is correct
12	Correct	0 ms	18780 KB	Output is correct
13	Correct	0 ms	18780 KB	Output is correct
14	Correct	0 ms	18780 KB	Output is correct
15	Correct	0 ms	18780 KB	Output is correct
16	Correct	0 ms	18780 KB	Output is correct
17	Correct	0 ms	18780 KB	Output is correct
18	Correct	0 ms	18780 KB	Output is correct
19	Correct	0 ms	18780 KB	Output is correct
20	Correct	0 ms	18780 KB	Output is correct
21	Correct	0 ms	18780 KB	Output is correct
22	Correct	0 ms	18780 KB	Output is correct
23	Correct	0 ms	18780 KB	Output is correct
24	Correct	0 ms	18780 KB	Output is correct
25	Correct	0 ms	18780 KB	Output is correct
26	Correct	0 ms	18780 KB	Output is correct
27	Correct	0 ms	18780 KB	Output is correct
28	Correct	0 ms	18780 KB	Output is correct
29	Correct	0 ms	18780 KB	Output is correct
30	Correct	0 ms	18780 KB	Output is correct
31	Correct	0 ms	18780 KB	Output is correct
32	Incorrect	3 ms	18780 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

답안 #39380

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 20.0

Subtask #4
0 / 55.0