답안 #390687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
390687	2021-04-16T14:03:16 Z	SavicS	Money (IZhO17_money)	C++14	100 / 100	235 ms	18884 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 dud[maxn];
void upd(int x, int val){
	while(x <= maxn){
		dud[x] += val;
		x += x&(-x);
	}
}
int query(int x){
	int sum = 0;
	while(x > 0){
		sum += dud[x];
		x -= x&(-x);
	}
	return sum;
}

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

	upd(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;
		upd(niz[o], 1);
	}

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

		int L = query(niz[i] - 1);
		int R = L + cnt[niz[i]];

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

			int A = query(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) {
			upd(niz[l], 1);
			cnt[niz[l]] += 1;
		}
		i = j;

	}

	cout << br << '\n';

	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	336 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 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	332 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	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 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	332 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	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	460 KB	Output is correct
19	Correct	1 ms	460 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	460 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	332 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 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	332 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	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	460 KB	Output is correct
19	Correct	1 ms	460 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	460 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	332 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 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	460 KB	Output is correct
33	Correct	1 ms	460 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	336 KB	Output is correct
37	Correct	2 ms	2252 KB	Output is correct
38	Correct	2 ms	2252 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 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	332 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	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	460 KB	Output is correct
19	Correct	1 ms	460 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	460 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	332 KB	Output is correct
25	Correct	1 ms	588 KB	Output is correct
26	Correct	1 ms	588 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	460 KB	Output is correct
33	Correct	1 ms	460 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	336 KB	Output is correct
37	Correct	2 ms	2252 KB	Output is correct
38	Correct	2 ms	2252 KB	Output is correct
39	Correct	67 ms	2308 KB	Output is correct
40	Correct	117 ms	3652 KB	Output is correct
41	Correct	55 ms	1860 KB	Output is correct
42	Correct	51 ms	1876 KB	Output is correct
43	Correct	43 ms	1496 KB	Output is correct
44	Correct	162 ms	4312 KB	Output is correct
45	Correct	147 ms	4424 KB	Output is correct
46	Correct	142 ms	4332 KB	Output is correct
47	Correct	131 ms	4284 KB	Output is correct
48	Correct	134 ms	4420 KB	Output is correct
49	Correct	189 ms	12068 KB	Output is correct
50	Correct	186 ms	11948 KB	Output is correct
51	Correct	178 ms	12044 KB	Output is correct
52	Correct	173 ms	11964 KB	Output is correct
53	Correct	179 ms	12040 KB	Output is correct
54	Correct	177 ms	11968 KB	Output is correct
55	Correct	205 ms	11960 KB	Output is correct
56	Correct	221 ms	18884 KB	Output is correct
57	Correct	226 ms	18752 KB	Output is correct
58	Correct	222 ms	18756 KB	Output is correct
59	Correct	216 ms	18800 KB	Output is correct
60	Correct	235 ms	18780 KB	Output is correct
61	Correct	218 ms	18880 KB	Output is correct
62	Correct	209 ms	18884 KB	Output is correct

답안 #390687

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