답안 #884492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884492	2023-12-07T13:45:25 Z	tsumondai	Money (IZhO17_money)	C++14	100 / 100	139 ms	22864 KB

money

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 1e6 + 10;

const int oo = 1e9, mod = 1e9 + 7;

int n, a[N];
int bit[N];

void update(int x) {
	for (int i = x; i < N; i += i & -i) {
		bit[i]++;
	}
}

int get(int x) {
	int ans = 0;
	for (int i = x; i > 0; i -= i & -i) {
		ans += bit[i];
	}

	return ans;
}

void updateRange(int l, int r) {
	for (int i = l; i <= r; i++) {
		update(a[i]);
	}
}


void process() {
	cin >> n;
	foru(i, 1, n) cin >> a[i];
	int ans = 0, pre = 0;
	for (int i = 1; i < n; i++) {
        if (i < n && a[i] > a[i + 1]) {
            ++ans;
            updateRange(pre + 1, i);
            pre = i;
            continue;
        }
        
        if (a[i] == a[i + 1]) continue;
        
        if (get(a[i + 1] - 1) - get(a[pre + 1]) > 0) {
            ++ans;
            updateRange(pre + 1, i);
            pre = i;
        }
    }
 
    cout << ans + 1;
	return;
}

signed main() {
	cin.tie(0)->sync_with_stdio(false);
	//freopen(".inp", "r", stdin);
	//freopen(".out", "w", stdout);
	process();
	cerr << "Time elapsed: " << __TIME << " s.\n";
	return 0;
}

// dont stop

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	6488 KB	Output is correct
2	Correct	1 ms	6492 KB	Output is correct
3	Correct	1 ms	6488 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6492 KB	Output is correct
6	Correct	1 ms	6608 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	6492 KB	Output is correct
11	Correct	1 ms	4556 KB	Output is correct
12	Correct	1 ms	6492 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	6488 KB	Output is correct
2	Correct	1 ms	6492 KB	Output is correct
3	Correct	1 ms	6488 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6492 KB	Output is correct
6	Correct	1 ms	6608 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	6492 KB	Output is correct
11	Correct	1 ms	4556 KB	Output is correct
12	Correct	1 ms	6492 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	6488 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	4440 KB	Output is correct
24	Correct	1 ms	6492 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2648 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	6488 KB	Output is correct
2	Correct	1 ms	6492 KB	Output is correct
3	Correct	1 ms	6488 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6492 KB	Output is correct
6	Correct	1 ms	6608 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	6492 KB	Output is correct
11	Correct	1 ms	4556 KB	Output is correct
12	Correct	1 ms	6492 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	6488 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	4440 KB	Output is correct
24	Correct	1 ms	6492 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2648 KB	Output is correct
27	Correct	1 ms	6744 KB	Output is correct
28	Correct	1 ms	6492 KB	Output is correct
29	Correct	1 ms	6492 KB	Output is correct
30	Correct	1 ms	6492 KB	Output is correct
31	Correct	1 ms	6492 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2648 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	5468 KB	Output is correct
38	Correct	1 ms	5468 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	6488 KB	Output is correct
2	Correct	1 ms	6492 KB	Output is correct
3	Correct	1 ms	6488 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6492 KB	Output is correct
6	Correct	1 ms	6608 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	6492 KB	Output is correct
11	Correct	1 ms	4556 KB	Output is correct
12	Correct	1 ms	6492 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	6488 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	4440 KB	Output is correct
24	Correct	1 ms	6492 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2648 KB	Output is correct
27	Correct	1 ms	6744 KB	Output is correct
28	Correct	1 ms	6492 KB	Output is correct
29	Correct	1 ms	6492 KB	Output is correct
30	Correct	1 ms	6492 KB	Output is correct
31	Correct	1 ms	6492 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2648 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	5468 KB	Output is correct
38	Correct	1 ms	5468 KB	Output is correct
39	Correct	55 ms	11700 KB	Output is correct
40	Correct	118 ms	18100 KB	Output is correct
41	Correct	48 ms	13308 KB	Output is correct
42	Correct	37 ms	9048 KB	Output is correct
43	Correct	26 ms	6236 KB	Output is correct
44	Correct	122 ms	16440 KB	Output is correct
45	Correct	101 ms	16576 KB	Output is correct
46	Correct	102 ms	16724 KB	Output is correct
47	Correct	85 ms	16468 KB	Output is correct
48	Correct	103 ms	18516 KB	Output is correct
49	Correct	108 ms	22848 KB	Output is correct
50	Correct	120 ms	22844 KB	Output is correct
51	Correct	118 ms	22612 KB	Output is correct
52	Correct	113 ms	22864 KB	Output is correct
53	Correct	106 ms	22704 KB	Output is correct
54	Correct	109 ms	22608 KB	Output is correct
55	Correct	126 ms	22816 KB	Output is correct
56	Correct	124 ms	22612 KB	Output is correct
57	Correct	130 ms	22580 KB	Output is correct
58	Correct	120 ms	22708 KB	Output is correct
59	Correct	126 ms	22824 KB	Output is correct
60	Correct	139 ms	22836 KB	Output is correct
61	Correct	127 ms	22608 KB	Output is correct
62	Correct	129 ms	22816 KB	Output is correct

답안 #884492

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