oj.uz

Submission #236296

# Submission time Handle Problem Language Result Execution time Memory
236296 2020-06-01T04:14:53 Z tjd229 Secret Permutation (RMI19_permutation) C++14
50 / 100
 5000 ms 384 KB 
#include  "permutation.h"
#include <vector>
#include <algorithm>
#include <random>
using namespace std;
 
 
int Tx[257], x[257];
int use[257];
int _N;
#include <stdio.h>
void print(int *p) {
	for (int i = 1; i <= _N; ++i) printf("%d ", p[i]);
	puts("");
}
bool recon(int ix, vector<int> &P) {
 
	int bk = P.back();
	//
	if (ix == _N) {
		int d = bk - P[0];
		if (d < 0) d = -d;
		return d == x[1];
	}
	int nxt = bk + x[ix + 1];
	if (nxt <= _N && use[nxt] == 0) {
		use[nxt] = 1;
		P.push_back(nxt);
		if (recon(ix + 1, P)) return 1;
		P.pop_back();
		use[nxt] = 0;
	}
	nxt = bk - x[ix + 1];
	if (nxt > 0 && use[nxt] == 0) {
		use[nxt] = 1;
		P.push_back(nxt);
		if (recon(ix + 1, P)) return 1;
		P.pop_back();
		use[nxt] = 0;
	}
	return 0;
}
void solve(int N) {
	_N = N;
	int sum = 0;
	vector<int> P, V;
	for (int i = 1; i <= N; ++i) V.push_back(i);
	/*mt19937 g(random_device);
	shuffle(V.begin(), V.end(),g);*/
	//srand(229);
	random_shuffle(V.begin(), V.end());
 
	for (int i = 1; i <= N; ++i) {
		Tx[i] = query(V);
		sum += Tx[i];
		use[i] = 0;
		rotate(V.begin(), V.begin() + 1, V.end());
	}
	int T = sum / (N - 1);
 
	for (int i = 1; i <= N; ++i) x[i] = T - Tx[i];
	//print(x);
	for (int i = 1; i <= N; ++i) {
      if (i + x[1] > N && i - x[1] < 1) continue;
		P.push_back(i); use[i] = 1;
		if (recon(1, P)) {
			vector<int> ans(N);
			for (i = 0; i < N; ++i)
				ans[V[i] - 1] = P[i];// , printf("%d,%d\n", V[i], P[i]);
 
			answer(ans);
			break;
		}
		P.pop_back(); use[i] = 0;
	}
}

Compilation message

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]
   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]
   fscanf(stdin, "%d", &N);
   ~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 256 KB Output is correct

Subtask #3
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 254 ms 384 KB Output is correct
18 Correct 32 ms 256 KB Output is correct
19 Correct 186 ms 376 KB Output is correct
20 Correct 42 ms 256 KB Output is correct
21 Correct 24 ms 384 KB Output is correct
22 Correct 323 ms 376 KB Output is correct
23 Correct 38 ms 256 KB Output is correct
24 Execution timed out 5048 ms 256 KB Time limit exceeded
25 Halted 0 ms 0 KB -