Submission #684712

#	Time	Username	Problem	Language	Result	Execution time	Memory
684712		pragmatist	Money (IZhO17_money)	C++17	100 / 100	991 ms	69904 KiB

money

/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
 
#include<bits/stdc++.h>
 
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"
 
using namespace std;
 
const int N = (int)1e6 + 7; // make sure this is right
const int M = (int)9e7 + 7;
const int inf = (int)2e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)1e9 + 7; // make sure this is right
 
bool bit(int x, int i) {
	return x >> i & 1;
}
 
int sum(int x, int y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}
 
int n, a[N], p[N], mx[N], mn[N];
 
void solve() {
	cin >> n;
	mn[0] = inf;
	mx[0] = -inf;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		mn[i] = min(mn[i - 1], a[i]);
		mx[i] = max(mx[i - 1], a[i]);
		if(i > 1) p[i] = p[i - 1] + (a[i - 1] <= a[i]);
	}
	int j = 1, ans = 0;
	multiset<int> s;
	for(int i = 1; i <= n; ++i) {
		ans++;
		int k = i;
		j = i;
		while(j <= n && p[j] - p[i] == j - i) {
			bool can = (a[j] <= mn[i - 1] || a[i] >= mx[i - 1]);
			if(can) {
				k = j;
				j++;
				continue;	
			}
			auto it = s.lower_bound(a[j]);
			if(it != s.end()) {
				it--;
				int x = *it;
				if(a[i] < x) break;
			} else break;
			k = j;
			j++;
		}
		for(int l = i; l <= k; ++l) s.insert(a[l]);
		i = k;
	}
	cout << ans;
}
 
signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55