Submission #555606

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
555606	2022-05-01T09:12:29 Z	ngpin04	Money (IZhO17_money)	C++14	100 / 100	1488 ms	73728 KB

money

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
const int N = 1e6 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

int las[N];
int l[N];
int r[N];
int a[N];
int n;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	cin >> n;
	vector <int> val;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		val.push_back(a[i]);
	}
	sort(ALL(val));
	val.resize(unique(ALL(val)) - val.begin());
	for (int i = 1; i <= n; i++)
		a[i] = lower_bound(ALL(val), a[i]) - val.begin() + 1;

	a[0] = 0;
	a[n + 1] = n + 1;
	r[0] = n + 1;
	l[n + 1] = 0;

	int ans = 0;
	set <int> s;	
	s.insert(0);
	for (int i = 1; i <= n; i++) {
		int j = r[i - 1];
		if (a[i - 1] <= a[i] && a[i] <= a[j]) {

			r[i] = j;
			l[j] = i;

			l[i] = i - 1;
			r[i - 1] = i;

			if (a[i] < a[j]) 
				las[a[i]] = i;
		} else {
			ans++;
			int pre = las[*prev(s.upper_bound(a[i]))];
			int nxt = r[pre];

			r[i] = nxt;
			l[nxt] = i;

			l[i] = pre;
			r[pre] = i;

			las[a[i]] = i;
		}

		s.insert(a[i]);
	}

	cout << ans + 1;
	return 0;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	328 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	324 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	328 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	324 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	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	328 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	324 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	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	324 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	328 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	328 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	324 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	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	324 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	328 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	78 ms	11144 KB	Output is correct
40	Correct	143 ms	18108 KB	Output is correct
41	Correct	67 ms	9092 KB	Output is correct
42	Correct	65 ms	8148 KB	Output is correct
43	Correct	45 ms	5832 KB	Output is correct
44	Correct	163 ms	22800 KB	Output is correct
45	Correct	159 ms	22740 KB	Output is correct
46	Correct	217 ms	22840 KB	Output is correct
47	Correct	130 ms	22828 KB	Output is correct
48	Correct	140 ms	22860 KB	Output is correct
49	Correct	679 ms	42704 KB	Output is correct
50	Correct	701 ms	42740 KB	Output is correct
51	Correct	688 ms	42856 KB	Output is correct
52	Correct	702 ms	42696 KB	Output is correct
53	Correct	635 ms	42836 KB	Output is correct
54	Correct	666 ms	42620 KB	Output is correct
55	Correct	1373 ms	73540 KB	Output is correct
56	Correct	1422 ms	73560 KB	Output is correct
57	Correct	1422 ms	73572 KB	Output is correct
58	Correct	1430 ms	73672 KB	Output is correct
59	Correct	1454 ms	73560 KB	Output is correct
60	Correct	1488 ms	73536 KB	Output is correct
61	Correct	1402 ms	73728 KB	Output is correct
62	Correct	1372 ms	73596 KB	Output is correct

Submission #555606

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