답안 #684712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
684712	2023-01-22T11:22:37 Z	pragmatist	Money (IZhO17_money)	C++17	100 / 100	991 ms	69904 KB

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.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	324 KB	Output is correct
20	Correct	1 ms	292 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	288 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	328 KB	Output is correct
26	Correct	1 ms	324 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	324 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	324 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	197 ms	31956 KB	Output is correct
40	Correct	407 ms	50840 KB	Output is correct
41	Correct	147 ms	25836 KB	Output is correct
42	Correct	168 ms	23024 KB	Output is correct
43	Correct	113 ms	16580 KB	Output is correct
44	Correct	482 ms	64428 KB	Output is correct
45	Correct	458 ms	66124 KB	Output is correct
46	Correct	479 ms	66300 KB	Output is correct
47	Correct	313 ms	66252 KB	Output is correct
48	Correct	343 ms	66220 KB	Output is correct
49	Correct	699 ms	69600 KB	Output is correct
50	Correct	628 ms	69596 KB	Output is correct
51	Correct	707 ms	69640 KB	Output is correct
52	Correct	624 ms	69736 KB	Output is correct
53	Correct	649 ms	69764 KB	Output is correct
54	Correct	658 ms	69616 KB	Output is correct
55	Correct	974 ms	69904 KB	Output is correct
56	Correct	991 ms	69640 KB	Output is correct
57	Correct	956 ms	69608 KB	Output is correct
58	Correct	987 ms	69692 KB	Output is correct
59	Correct	991 ms	69756 KB	Output is correct
60	Correct	972 ms	69788 KB	Output is correct
61	Correct	935 ms	69544 KB	Output is correct
62	Correct	985 ms	69772 KB	Output is correct

답안 #684712

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