oj.uz

답안 #428638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
428638 2021-06-15T13:22:05 Z shenxy Cheerleaders (info1cup20_cheerleaders) C++11
100 / 100
 1511 ms 141148 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
long long inv[17], niv[17];
struct seg {
	int s, v;
	seg *l, *r;
	seg(int _s) {
		s = _s, v = 0;
		if (s) {
			l = new seg(s - 1);
			r = new seg(s - 1);
		}
	}
	void update(int i) {
		if (s) {
			if (i < (1 << (s - 1))) l -> update(i), inv[s - 1] += r -> v;
			else r -> update(i - (1 << (s - 1))), niv[s - 1] += l -> v;
			v = l -> v + r -> v;
		} else ++v;
	}
} *root;
int main() {
	int N, h;
	scanf("%d", &N);
	if (N == 0) {
		printf("0\n11");
		return 0;
	}
	int a[1 << N];
	long long ans[N];
	vector<int> res[N];
	fill_n(ans, N, 0);
	for (int i = 0; i < (1 << N); ++i) scanf("%d", &h), a[h] = i;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < i; ++j) res[i].push_back(2);
		root = new seg(N);
		fill_n(inv, N, 0);
		fill_n(niv, N, 0);
		for (int j = 0; j < (1 << N); ++j) root -> update(a[j]);
		for (int j = 0; j < N; ++j) {
			res[i].push_back(2);
			if (inv[j] > niv[j]) res[i].push_back(1), ans[i] += niv[j];
			else ans[i] += inv[j];
		}
		for (int j = 0; j < (1 << N); ++j) a[j] = (a[j] >> 1) + ((1 & a[j]) << (N - 1));
	}
	printf("%lld\n", *min_element(ans, ans + N));
	for (int i: res[min_element(ans, ans + N) - ans]) printf("%d", i);
	return 0;
}

Compilation message

cheerleaders.cpp: In function 'int main()':
cheerleaders.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
cheerleaders.cpp:35:42: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  for (int i = 0; i < (1 << N); ++i) scanf("%d", &h), a[h] = i;
      |                                     ~~~~~^~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Correct!
2 Correct 0 ms 204 KB Correct!
3 Correct 0 ms 204 KB Correct!
4 Correct 0 ms 204 KB Correct!

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Correct!
2 Correct 1 ms 332 KB Correct!
3 Correct 1 ms 332 KB Correct!
4 Correct 1 ms 332 KB Correct!

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1612 KB Correct!
2 Correct 6 ms 1612 KB Correct!
3 Correct 6 ms 1692 KB Correct!
4 Correct 6 ms 1612 KB Correct!

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 31112 KB Correct!
2 Correct 129 ms 31148 KB Correct!
3 Correct 306 ms 66184 KB Correct!

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 878 ms 140384 KB Correct!
2 Correct 896 ms 140408 KB Correct!
3 Correct 1511 ms 140496 KB Correct!
4 Correct 1289 ms 140332 KB Correct!
5 Correct 1294 ms 141148 KB Correct!