답안 #513775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
513775	2022-01-17T15:37:29 Z	Mazaalai	Money (IZhO17_money)	C++17	100 / 100	175 ms	20140 KB

money

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#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:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
money.cpp: In function 'int main()':
money.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for (int i = 0; i < sorted.size()-1; i++) {
      |                  ~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	2 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	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 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	332 KB	Output is correct
2	Correct	2 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	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 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	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	3 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	460 KB	Output is correct
26	Correct	2 ms	460 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	2 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	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 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	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	3 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	460 KB	Output is correct
26	Correct	2 ms	460 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	2 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	2 ms	332 KB	Output is correct
32	Correct	2 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	2 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	2 ms	1996 KB	Output is correct
38	Correct	2 ms	1996 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	2 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	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 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	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	3 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	460 KB	Output is correct
26	Correct	2 ms	460 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	2 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	2 ms	332 KB	Output is correct
32	Correct	2 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	2 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	2 ms	1996 KB	Output is correct
38	Correct	2 ms	1996 KB	Output is correct
39	Correct	44 ms	2428 KB	Output is correct
40	Correct	65 ms	4520 KB	Output is correct
41	Correct	34 ms	2424 KB	Output is correct
42	Correct	30 ms	2532 KB	Output is correct
43	Correct	22 ms	1608 KB	Output is correct
44	Correct	83 ms	4552 KB	Output is correct
45	Correct	83 ms	4540 KB	Output is correct
46	Correct	81 ms	4540 KB	Output is correct
47	Correct	90 ms	4492 KB	Output is correct
48	Correct	86 ms	4512 KB	Output is correct
49	Correct	132 ms	19504 KB	Output is correct
50	Correct	127 ms	19464 KB	Output is correct
51	Correct	125 ms	19556 KB	Output is correct
52	Correct	127 ms	19476 KB	Output is correct
53	Correct	137 ms	19500 KB	Output is correct
54	Correct	127 ms	19520 KB	Output is correct
55	Correct	157 ms	19892 KB	Output is correct
56	Correct	161 ms	19976 KB	Output is correct
57	Correct	162 ms	20012 KB	Output is correct
58	Correct	175 ms	20140 KB	Output is correct
59	Correct	160 ms	20008 KB	Output is correct
60	Correct	160 ms	19912 KB	Output is correct
61	Correct	164 ms	20068 KB	Output is correct
62	Correct	167 ms	19996 KB	Output is correct

답안 #513775

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