oj.uz

답안 #334434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334434 2020-12-09T06:54:55 Z Kerim Money (IZhO17_money) C++17
100 / 100
 248 ms 15488 KB 
#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;}
int F[MAXN],arr[MAXN];
void upd(int x,int val){
	for(;x;x-=x&(-x))
		umin(F[x],val);
}
int tap(int x){
	int res=INF;
	for(;x<MAXN;x+=x&(-x))
		umin(res,F[x]);
	return res;	
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
		scanf("%d",arr+i);
	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]);
		if(arr[i]>arr[i+1]){
			pos=i+1;
			break;
		}
	}
	if(pos==-1){
		puts("1");
		return 0;
	}
	int ans=1;
	while(1){
		int right=tap(arr[pos]+1);
		int now=arr[pos],tmp=pos;
		ans++;
		for(int i=pos;i<=n;i++){
			upd(arr[i],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:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
money.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |   scanf("%d",arr+i);
      |   ~~~~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4588 KB Output is correct
2 Correct 3 ms 4588 KB Output is correct
3 Correct 3 ms 4588 KB Output is correct
4 Correct 3 ms 4608 KB Output is correct
5 Correct 3 ms 4588 KB Output is correct
6 Correct 3 ms 4588 KB Output is correct
7 Correct 3 ms 4608 KB Output is correct
8 Correct 3 ms 4588 KB Output is correct
9 Correct 3 ms 4588 KB Output is correct
10 Correct 3 ms 4608 KB Output is correct
11 Correct 3 ms 4588 KB Output is correct
12 Correct 3 ms 4588 KB Output is correct
13 Correct 3 ms 4588 KB Output is correct
14 Correct 3 ms 4588 KB Output is correct
15 Correct 3 ms 4588 KB Output is correct
16 Correct 3 ms 4588 KB Output is correct
17 Correct 3 ms 4588 KB Output is correct
18 Correct 3 ms 4588 KB Output is correct
19 Correct 3 ms 4588 KB Output is correct
20 Correct 3 ms 4588 KB Output is correct
21 Correct 3 ms 4592 KB Output is correct
22 Correct 3 ms 4588 KB Output is correct
23 Correct 3 ms 4588 KB Output is correct
24 Correct 3 ms 4588 KB Output is correct
25 Correct 4 ms 4588 KB Output is correct
26 Correct 3 ms 4588 KB Output is correct
27 Correct 3 ms 4588 KB Output is correct
28 Correct 3 ms 4588 KB Output is correct
29 Correct 4 ms 4588 KB Output is correct
30 Correct 3 ms 4588 KB Output is correct
31 Correct 3 ms 4588 KB Output is correct
32 Correct 3 ms 4588 KB Output is correct
33 Correct 3 ms 4588 KB Output is correct
34 Correct 3 ms 4588 KB Output is correct
35 Correct 4 ms 4608 KB Output is correct
36 Correct 3 ms 4588 KB Output is correct
37 Correct 3 ms 4588 KB Output is correct
38 Correct 3 ms 4588 KB Output is correct
39 Correct 93 ms 9708 KB Output is correct
40 Correct 152 ms 13036 KB Output is correct
41 Correct 83 ms 8684 KB Output is correct
42 Correct 75 ms 8300 KB Output is correct
43 Correct 51 ms 7148 KB Output is correct
44 Correct 198 ms 15212 KB Output is correct
45 Correct 189 ms 15212 KB Output is correct
46 Correct 191 ms 15468 KB Output is correct
47 Correct 170 ms 15304 KB Output is correct
48 Correct 179 ms 15488 KB Output is correct
49 Correct 220 ms 15340 KB Output is correct
50 Correct 214 ms 15340 KB Output is correct
51 Correct 217 ms 15340 KB Output is correct
52 Correct 218 ms 15340 KB Output is correct
53 Correct 242 ms 15340 KB Output is correct
54 Correct 214 ms 15084 KB Output is correct
55 Correct 233 ms 15248 KB Output is correct
56 Correct 241 ms 15212 KB Output is correct
57 Correct 246 ms 15212 KB Output is correct
58 Correct 236 ms 15212 KB Output is correct
59 Correct 233 ms 15212 KB Output is correct
60 Correct 248 ms 15468 KB Output is correct
61 Correct 230 ms 15212 KB Output is correct
62 Correct 239 ms 15340 KB Output is correct