Submission #334434

#	Time	Username	Problem	Language	Result	Execution time	Memory
334434		Kerim	Money (IZhO17_money)	C++17	100 / 100	248 ms	15488 KiB

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;}
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 (stderr)

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 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55