oj.uz

답안 #513774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
513774 2022-01-17T15:35:38 Z Mazaalai Money (IZhO17_money) C++17
100 / 100
 199 ms 20052 KB 
#include <bits/stdc++.h>
#define pb push_back
#define LINE "-----------------\n"
#define ALL(x) x.begin(),x.end()
using namespace std;
int n, m;
vector <int> nums, sorted;
const int N = 1e6 + 5;
const int M = 1e6 + 1;
int cnt[N], nx[N], pv[N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	cin >> n;
	for (int i = 0; i < n; i++) {
		int x; cin >> x;
		cnt[x]++;
		nums.pb(x);
		// sorted.pb(x);
	}
	// sort(ALL(sorted));
	for (int i = 1; i < M; i++) {
		if (cnt[i] > 0) sorted.pb(i);
	}
	nx[0] = sorted[0];
	pv[sorted[0]] = 0;
	for (int i = 0; i < sorted.size()-1; i++) {
		// if (sorted[i] != sorted[i+1]) {
			nx[sorted[i]] = sorted[i+1];
			pv[sorted[i+1]] = sorted[i];
		// }
	}
	nx[sorted.back()] = M;
	pv[M] = sorted.back();
	int ans = 0;
	for (int i = n - 1, j, curCnt, a, b; i >= 0; i--) {
		curCnt = 1;
		bool border = 1;
		for (j = i-1; j >= 0; j--) {
			if (nums[j] == nums[j+1]) {
				curCnt++;
				continue;
			} else {
				if (nx[nums[j]] != nums[j+1]) break;
				if (!border && curCnt != cnt[nums[j+1]]) break;
				cnt[nums[j+1]] -= curCnt;
				if (cnt[nums[j+1]] == 0) {
					a = pv[nums[j+1]], b = nx[nums[j+1]];
					nx[a] = b;
					pv[b] = a;
				}
				border = 0;
				curCnt = 1;
			}
		}
		cnt[nums[j+1]] -= curCnt;
		if (cnt[nums[j+1]] == 0) {
			a = pv[nums[j+1]], b = nx[nums[j+1]];
			nx[a] = b;
			pv[b] = a;
		}
		ans++;
		i = j+1;
	}
	cout << ans << '\n';
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:31:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for (int i = 0; i < sorted.size()-1; i++) {
      |                  ~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 4 ms 328 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 4 ms 332 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 4 ms 332 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 4 ms 396 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 4 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 3 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 332 KB Output is correct
31 Correct 4 ms 324 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 4 ms 460 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 4 ms 332 KB Output is correct
36 Correct 4 ms 332 KB Output is correct
37 Correct 4 ms 1996 KB Output is correct
38 Correct 4 ms 1996 KB Output is correct
39 Correct 52 ms 2436 KB Output is correct
40 Correct 70 ms 4524 KB Output is correct
41 Correct 36 ms 2532 KB Output is correct
42 Correct 32 ms 2556 KB Output is correct
43 Correct 25 ms 1548 KB Output is correct
44 Correct 84 ms 4584 KB Output is correct
45 Correct 87 ms 4524 KB Output is correct
46 Correct 83 ms 4576 KB Output is correct
47 Correct 84 ms 4480 KB Output is correct
48 Correct 92 ms 4480 KB Output is correct
49 Correct 129 ms 19460 KB Output is correct
50 Correct 150 ms 19464 KB Output is correct
51 Correct 128 ms 19476 KB Output is correct
52 Correct 138 ms 19444 KB Output is correct
53 Correct 138 ms 19500 KB Output is correct
54 Correct 130 ms 19544 KB Output is correct
55 Correct 183 ms 19948 KB Output is correct
56 Correct 163 ms 20028 KB Output is correct
57 Correct 180 ms 19912 KB Output is correct
58 Correct 199 ms 19952 KB Output is correct
59 Correct 165 ms 19992 KB Output is correct
60 Correct 180 ms 19924 KB Output is correct
61 Correct 163 ms 20052 KB Output is correct
62 Correct 182 ms 19892 KB Output is correct