답안 #390684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
390684	2021-04-16T13:59:34 Z	SavicS	Money (IZhO17_money)	C++14	45 / 100	1500 ms	77560 KB

money

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1000005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
int niz[maxn];

int cnt[maxn];

bool seku(int l1, int r1, int l2, int r2) {
	return !(l1 > r2 || l2 > r1);
}

int main() 
{
	ios::sync_with_stdio(false);
	cout.tie(nullptr);
	cin.tie(nullptr);
	cin >> n;
	ff(i,1,n)cin >> niz[i];

	// prvi segment ide sve dok je rastuci

	ordered_set<pii> os;
	os.insert({niz[1], 1});
	cnt[niz[1]] += 1;

	int o = 1;
	while(o + 1 <= n && niz[o + 1] >= niz[o]) {
		o += 1;
		cnt[niz[o]] += 1;
		os.insert({niz[o], o});
	}

	int br = 1;
	ff(i,o + 1,n) {
		br += 1;

		int L = os.order_of_key({niz[i], -1});
		int R = L + cnt[niz[i]];

		int j = i;
		while(j + 1 <= n && niz[j + 1] >= niz[j]) {

			int A = os.order_of_key({niz[j + 1], -1});
			int B = A + cnt[niz[j + 1]];

			if(seku(L, R, A, B)) {

				j += 1;
				continue;
			}

			break;
		}

		ff(l,i,j) {
			os.insert({niz[l], l});
			cnt[niz[l]] += 1;
		}
		i = j;

	}

	cout << br << endl;

	return 0;
}
/**

10
5 3 5 5 8 2 3 7 5 10


10
9 9 10 4 4 7 9 1 5 5

6
3 6 4 5 1 2

// probati bojenje sahovski ili slicno

**/

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	328 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	844 KB	Output is correct
38	Correct	1 ms	844 KB	Output is correct
39	Correct	409 ms	35472 KB	Output is correct
40	Correct	896 ms	58212 KB	Output is correct
41	Correct	294 ms	28868 KB	Output is correct
42	Correct	332 ms	25620 KB	Output is correct
43	Correct	220 ms	18144 KB	Output is correct
44	Correct	1014 ms	73824 KB	Output is correct
45	Correct	924 ms	73576 KB	Output is correct
46	Correct	1006 ms	73664 KB	Output is correct
47	Correct	698 ms	73668 KB	Output is correct
48	Correct	793 ms	73612 KB	Output is correct
49	Correct	1418 ms	77508 KB	Output is correct
50	Correct	1356 ms	77508 KB	Output is correct
51	Correct	1421 ms	77496 KB	Output is correct
52	Correct	1250 ms	77560 KB	Output is correct
53	Correct	1381 ms	77508 KB	Output is correct
54	Correct	1355 ms	77316 KB	Output is correct
55	Execution timed out	1589 ms	76104 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #390684

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0