답안 #37450 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
37450	2017-12-25T14:25:51 Z	Kerim	Money (IZhO17_money)	C++14	100 / 100	333 ms	10536 KB

money

#include "bits/stdc++.h"
#define MAXN 1090009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
//~ set<int>s;
int F[MAXN];
int arr[MAXN];
void upd(int x,int val){
	//~ cout<<"upd "<<val<<endl;
	for(;x;x-=x&(-x))
		umin(F[x],val);
}
int tap(int x){
	//~ cout<<"tap "<<x<<" ";
	int res=INF;
	for(;x<MAXN;x+=x&(-x))
		umin(res,F[x]);
	//~ cout<<res<<endl;	
	return res;	
}
int main(){
    //~ freopen("file.in", "r", stdin);
    srand((unsigned)time(NULL));
    int n=1000000;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
		scanf("%d",arr+i);
		//~ arr[i]=rand()%1000000+1;
	for(int i=1;i<MAXN;i++)
		F[i]=INF;
	int pos=-1;	
	for(int i=1;i<n;i++){
		upd(arr[i],arr[i]);
		//~ s.insert(arr[i]);
		if(arr[i]>arr[i+1]){
			pos=i+1;
			break;
		}
	}
	if(pos==-1){
		puts("1");
		return 0;
	}
	int ans=1;
	while(1){
		//~ __typeof((s).begin())it=s.upper_bound(arr[pos]);
		int right=tap(arr[pos]+1);
		//~ if(it!=s.end())
			//~ right=*it;
		int now=arr[pos],tmp=pos;
		ans++;
		for(int i=pos;i<=n;i++){
			upd(arr[i],arr[i]);
			//~ s.insert(arr[i]);
			if(now<=arr[i] and arr[i]<=right)
				now=arr[i];
			else{
				pos=i;
				break;
			}
		}
		if(tmp==pos)
			break;
	}
	printf("%d\n",ans);
	return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	10536 KB	Output is correct
2	Correct	0 ms	10536 KB	Output is correct
3	Correct	0 ms	10536 KB	Output is correct
4	Correct	3 ms	10536 KB	Output is correct
5	Correct	3 ms	10536 KB	Output is correct
6	Correct	3 ms	10536 KB	Output is correct
7	Correct	3 ms	10536 KB	Output is correct
8	Correct	0 ms	10536 KB	Output is correct
9	Correct	3 ms	10536 KB	Output is correct
10	Correct	3 ms	10536 KB	Output is correct
11	Correct	0 ms	10536 KB	Output is correct
12	Correct	3 ms	10536 KB	Output is correct
13	Correct	3 ms	10536 KB	Output is correct
14	Correct	0 ms	10536 KB	Output is correct
15	Correct	0 ms	10536 KB	Output is correct
16	Correct	0 ms	10536 KB	Output is correct
17	Correct	3 ms	10536 KB	Output is correct
18	Correct	3 ms	10536 KB	Output is correct
19	Correct	0 ms	10536 KB	Output is correct
20	Correct	0 ms	10536 KB	Output is correct
21	Correct	0 ms	10536 KB	Output is correct
22	Correct	0 ms	10536 KB	Output is correct
23	Correct	0 ms	10536 KB	Output is correct
24	Correct	0 ms	10536 KB	Output is correct
25	Correct	0 ms	10536 KB	Output is correct
26	Correct	0 ms	10536 KB	Output is correct
27	Correct	3 ms	10536 KB	Output is correct
28	Correct	0 ms	10536 KB	Output is correct
29	Correct	0 ms	10536 KB	Output is correct
30	Correct	3 ms	10536 KB	Output is correct
31	Correct	0 ms	10536 KB	Output is correct
32	Correct	0 ms	10536 KB	Output is correct
33	Correct	0 ms	10536 KB	Output is correct
34	Correct	3 ms	10536 KB	Output is correct
35	Correct	0 ms	10536 KB	Output is correct
36	Correct	0 ms	10536 KB	Output is correct
37	Correct	0 ms	10536 KB	Output is correct
38	Correct	0 ms	10536 KB	Output is correct
39	Correct	83 ms	10536 KB	Output is correct
40	Correct	193 ms	10536 KB	Output is correct
41	Correct	73 ms	10536 KB	Output is correct
42	Correct	63 ms	10536 KB	Output is correct
43	Correct	56 ms	10536 KB	Output is correct
44	Correct	203 ms	10536 KB	Output is correct
45	Correct	229 ms	10536 KB	Output is correct
46	Correct	246 ms	10536 KB	Output is correct
47	Correct	219 ms	10536 KB	Output is correct
48	Correct	209 ms	10536 KB	Output is correct
49	Correct	303 ms	10536 KB	Output is correct
50	Correct	296 ms	10536 KB	Output is correct
51	Correct	273 ms	10536 KB	Output is correct
52	Correct	316 ms	10536 KB	Output is correct
53	Correct	266 ms	10536 KB	Output is correct
54	Correct	299 ms	10536 KB	Output is correct
55	Correct	246 ms	10536 KB	Output is correct
56	Correct	279 ms	10536 KB	Output is correct
57	Correct	303 ms	10536 KB	Output is correct
58	Correct	293 ms	10536 KB	Output is correct
59	Correct	269 ms	10536 KB	Output is correct
60	Correct	313 ms	10536 KB	Output is correct
61	Correct	266 ms	10536 KB	Output is correct
62	Correct	333 ms	10536 KB	Output is correct

답안 #37450

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