oj.uz

답안 #871430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871430 2023-11-10T19:30:26 Z rainboy Secret Permutation (RMI19_permutation) C++17
컴파일 오류
 0 ms 0 KB 
#include "permutation.h"
#include <cassert>
#include <cstring>
#include <vector>

using namespace std;

typedef vector<int> vi;

const int N = 256, M = 50000, INF = 0x3f3f3f3f;

int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

char used[N]; int kk[N];

int check(int *aa, int n, int m) {
	int a = 0;
	for (int i = 0; i < m; i++)
		a = min(a, aa[i]);
	memset(used, 0, n * sizeof *used);
	for (int i = 0; i < m; i++) {
		if (aa[i] - a >= n || used[aa[i] - a])
			return 0;
		used[aa[i] - a] = 1;
	}
	return 1;
}

int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;

void solve(int n) {
	for (int i = 0; i < n; i++)
		rr[i] = i;
	for (int i = 0; i < n; i++) {
		int j = rand_() % (i + 1), tmp;
		tmp = rr[i], rr[i] = rr[j], rr[j] = tmp;
	}
	vi ii(n);
	for (int i = 0; i < n; i++) {
		for (int h = 0; h < n; h++)
			ii[h] = rr[(i + h) % n] + 1;
		dd[i] = query(ii);
	}
	int sum = 0;
	for (int i = 0; i < n; i++)
		sum += dd[i];
	sum /= n - 1;
	for (int i = 0; i < n; i++)
		dd[i] = sum - dd[i];
	vi aa(n), aa_(n);
	int m = 0;
	aaa[m][0] = 0, aaa[m][1] = dd[1], m++;
	int j = 2;
	while (1) {
		assert(m != 0);
		while (j < n) {
			m_ = 0;
			for (int h = 0; h < m; h++) {
				memcpy(aaa_[m_], aaa[h], j * sizeof *aaa[h]), aaa_[m_][j] = aaa[h][j - 1] + dd[j];
				if (check(aaa_[m_], n, j + 1))
					m_++;
				if (m_ >= M)
					goto out;
				memcpy(aaa_[m_], aaa[h], j * sizeof *aaa[h]), aaa_[m_][j] = aaa[h][j - 1] - dd[j];
				if (check(aaa_[m_], n, j + 1))
					m_++;
				if (m_ >= M)
					goto out;
			}
			m = m_;
			for (int h = 0; h < m_; h++)
				memcpy(aaa[h], aaa_[h], (j + 1) * sizeof *aaa_[h]);
			j++;
		}
out:
		if (j == n) {
			m_ = 0;
			for (int h = 0; h < m; h++)
				if (abs_(aaa[h][n - 1]) == dd[0])
					memcpy(aaa_[m_++], aaa[h], n * sizeof *aaa[h]);
			m = m_;
			for (int h = 0; h < m_; h++)
				memcpy(aaa[h], aaa_[h], n * sizeof *aaa_[h]);
			if (m == 1) {
				for (int i = 0; i < n; i++)
					aa[i] = aaa[0][i];
				break;
			}
		}
		int z_ = INF, i_ = -1;
		for (int i = 0; i < j; i++) {
			memset(kk, 0, n * sizeof *kk);
			for (int h = 0; h < m; h++)
				kk[abs_(aaa[h][i])]++;
			int z = 0;
			for (int a = 0; a < n; a++)
				z += kk[a] * kk[a];
			if (z_ > z)
				z_ = z, i_ = i;
		}
		for (int h = 0; h < n; h++)
			ii[h] = rr[h < i_ ? i_ - 1 - h : h] + 1;
		int a = query(ii) - (sum - dd[0]) + dd[i_];
		m_ = 0;
		for (int h = 0; h < m; h++)
			if (abs_(aaa[h][i_]) == a)
				memcpy(aaa_[m_++], aaa[h], n * sizeof *aaa[h]);
		m = m_;
		for (int h = 0; h < m_; h++)
			memcpy(aaa[h], aaa_[h], n * sizeof *aaa_[h]);
	}
	int a = 0;
	for (int i = 0; i < n; i++)
		a = min(a, aa[i]);
	for (int i = 0; i < n; i++)
		aa[i] -= a - 1;
	for (int i = 0; i < n; i++)
		aa_[rr[i]] = aa[i];
	for (int i = 0; i < n; i++)
		aa[i] = aa_[i];
	answer(aa);
}#include "permutation.h"
#include <cstring>
#include <vector>

using namespace std;

typedef vector<int> vi;

const int N = 256, M = 65536, INF = 0x3f3f3f3f;

int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

char used[N]; int kk[N];

int check(int *aa, int n, int m) {
	int a = 0;
	for (int i = 0; i < m; i++)
		a = min(a, aa[i]);
	memset(used, 0, n * sizeof *used);
	for (int i = 0; i < m; i++) {
		if (aa[i] - a >= n || used[aa[i] - a])
			return 0;
		used[aa[i] - a] = 1;
	}
	return 1;
}

int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;

void solve(int n) {
	for (int i = 0; i < n; i++)
		rr[i] = i;
	for (int i = 0; i < n; i++) {
		int j = rand_() % (i + 1), tmp;
		tmp = rr[i], rr[i] = rr[j], rr[j] = tmp;
	}
	vi ii(n);
	for (int i = 0; i < n; i++) {
		for (int h = 0; h < n; h++)
			ii[h] = rr[(i + h) % n] + 1;
		dd[i] = query(ii);
	}
	int sum = 0;
	for (int i = 0; i < n; i++)
		sum += dd[i];
	sum /= n - 1;
	for (int i = 0; i < n; i++)
		dd[i] = sum - dd[i];
	vi aa(n), aa_(n);
	int m = 0;
	aaa[m][0] = 0, aaa[m][1] = dd[1], m++;
	int j = 2;
	while (1) {
		while (j < n) {
			m_ = 0;
			for (int h = 0; h < m; h++) {
				memcpy(aaa_[m_], aaa[h], j * sizeof *aaa[h]), aaa_[m_][j] = aaa[h][j - 1] + dd[j];
				if (check(aaa_[m_], n, j + 1))
					m_++;
				if (m_ >= M)
					goto out;
				memcpy(aaa_[m_], aaa[h], j * sizeof *aaa[h]), aaa_[m_][j] = aaa[h][j - 1] - dd[j];
				if (check(aaa_[m_], n, j + 1))
					m_++;
				if (m_ >= M)
					goto out;
			}
			m = m_;
			for (int h = 0; h < m_; h++)
				memcpy(aaa[h], aaa_[h], (j + 1) * sizeof *aaa_[h]);
			j++;
		}
out:
		if (j == n) {
			m_ = 0;
			for (int h = 0; h < m; h++)
				if (abs_(aaa[h][n - 1]) == dd[0])
					memcpy(aaa_[m_++], aaa[h], n * sizeof *aaa[h]);
			m = m_;
			for (int h = 0; h < m_; h++)
				memcpy(aaa[h], aaa_[h], n * sizeof *aaa_[h]);
			if (m == 1) {
				for (int i = 0; i < n; i++)
					aa[i] = aaa[0][i];
				break;
			}
		}
		int z_ = INF, i_ = -1;
		for (int i = 0; i < j; i++) {
			memset(kk, 0, n * sizeof *kk);
			for (int h = 0; h < m; h++)
				kk[abs_(aaa[h][i])]++;
			int z = 0;
			for (int a = 0; a < n; a++)
				z += kk[a] * kk[a];
			if (z_ > z)
				z_ = z, i_ = i;
		}
		for (int h = 0; h < n; h++)
			ii[h] = rr[h < i_ ? i_ - 1 - h : h] + 1;
		int a = query(ii) - (sum - dd[0]) + dd[i_];
		m_ = 0;
		for (int h = 0; h < m; h++)
			if (abs_(aaa[h][i_]) == a)
				memcpy(aaa_[m_++], aaa[h], n * sizeof *aaa[h]);
		m = m_;
		for (int h = 0; h < m_; h++)
			memcpy(aaa[h], aaa_[h], n * sizeof *aaa_[h]);
	}
	int a = 0;
	for (int i = 0; i < n; i++)
		a = min(a, aa[i]);
	for (int i = 0; i < n; i++)
		aa[i] -= a - 1;
	for (int i = 0; i < n; i++)
		aa_[rr[i]] = aa[i];
	for (int i = 0; i < n; i++)
		aa[i] = aa_[i];
	answer(aa);
}

Compilation message

permutation.cpp:129:2: error: stray '#' in program
  129 | }#include "permutation.h"
      |  ^
permutation.cpp:129:3: error: 'include' does not name a type
  129 | }#include "permutation.h"
      |   ^~~~~~~
permutation.cpp:137:11: error: redefinition of 'const int N'
  137 | const int N = 256, M = 65536, INF = 0x3f3f3f3f;
      |           ^
permutation.cpp:10:11: note: 'const int N' previously defined here
   10 | const int N = 256, M = 50000, INF = 0x3f3f3f3f;
      |           ^
permutation.cpp:137:20: error: redefinition of 'const int M'
  137 | const int N = 256, M = 65536, INF = 0x3f3f3f3f;
      |                    ^
permutation.cpp:10:20: note: 'const int M' previously defined here
   10 | const int N = 256, M = 50000, INF = 0x3f3f3f3f;
      |                    ^
permutation.cpp:137:31: error: redefinition of 'const int INF'
  137 | const int N = 256, M = 65536, INF = 0x3f3f3f3f;
      |                               ^~~
permutation.cpp:10:31: note: 'const int INF' previously defined here
   10 | const int N = 256, M = 50000, INF = 0x3f3f3f3f;
      |                               ^~~
permutation.cpp:139:5: error: redefinition of 'int abs_(int)'
  139 | int abs_(int a) { return a > 0 ? a : -a; }
      |     ^~~~
permutation.cpp:12:5: note: 'int abs_(int)' previously defined here
   12 | int abs_(int a) { return a > 0 ? a : -a; }
      |     ^~~~
permutation.cpp:140:5: error: redefinition of 'int min(int, int)'
  140 | int min(int a, int b) { return a < b ? a : b; }
      |     ^~~
permutation.cpp:13:5: note: 'int min(int, int)' previously defined here
   13 | int min(int a, int b) { return a < b ? a : b; }
      |     ^~~
permutation.cpp:142:14: error: redefinition of 'unsigned int X'
  142 | unsigned int X = 12345;
      |              ^
permutation.cpp:15:14: note: 'unsigned int X' previously defined here
   15 | unsigned int X = 12345;
      |              ^
permutation.cpp:144:5: error: redefinition of 'int rand_()'
  144 | int rand_() {
      |     ^~~~~
permutation.cpp:17:5: note: 'int rand_()' previously defined here
   17 | int rand_() {
      |     ^~~~~
permutation.cpp:148:6: error: redefinition of 'char used [256]'
  148 | char used[N]; int kk[N];
      |      ^~~~
permutation.cpp:21:6: note: 'char used [256]' previously declared here
   21 | char used[N]; int kk[N];
      |      ^~~~
permutation.cpp:148:19: error: redefinition of 'int kk [256]'
  148 | char used[N]; int kk[N];
      |                   ^~
permutation.cpp:21:19: note: 'int kk [256]' previously declared here
   21 | char used[N]; int kk[N];
      |                   ^~
permutation.cpp:150:5: error: redefinition of 'int check(int*, int, int)'
  150 | int check(int *aa, int n, int m) {
      |     ^~~~~
permutation.cpp:23:5: note: 'int check(int*, int, int)' previously defined here
   23 | int check(int *aa, int n, int m) {
      |     ^~~~~
permutation.cpp:163:5: error: redefinition of 'int rr [256]'
  163 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |     ^~
permutation.cpp:36:5: note: 'int rr [256]' previously declared here
   36 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |     ^~
permutation.cpp:163:12: error: redefinition of 'int dd [256]'
  163 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |            ^~
permutation.cpp:36:12: note: 'int dd [256]' previously declared here
   36 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |            ^~
permutation.cpp:163:19: error: redefinition of 'int aaa [50000][256]'
  163 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                   ^~~
permutation.cpp:36:19: note: 'int aaa [50000][256]' previously declared here
   36 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                   ^~~
permutation.cpp:163:30: error: redefinition of 'int aaa_ [50000][256]'
  163 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                              ^~~~
permutation.cpp:36:30: note: 'int aaa_ [50000][256]' previously declared here
   36 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                              ^~~~
permutation.cpp:163:42: error: redefinition of 'int m'
  163 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                                          ^
permutation.cpp:36:42: note: 'int m' previously declared here
   36 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                                          ^
permutation.cpp:163:45: error: redefinition of 'int m_'
  163 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                                             ^~
permutation.cpp:36:45: note: 'int m_' previously declared here
   36 | int rr[N], dd[N], aaa[M][N], aaa_[M][N], m, m_;
      |                                             ^~
permutation.cpp:165:6: error: redefinition of 'void solve(int)'
  165 | void solve(int n) {
      |      ^~~~~
permutation.cpp:38:6: note: 'void solve(int)' previously defined here
   38 | void solve(int n) {
      |      ^~~~~
stub.cpp: In function 'int query(int*)':
stub.cpp:15:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |   fscanf(stdin, "%d", &x);
      |   ~~~~~~^~~~~~~~~~~~~~~~~
stub.cpp: In function 'int main(int, char**)':
stub.cpp:48:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |   fscanf(stdin, "%d", &N);
      |   ~~~~~~^~~~~~~~~~~~~~~~~