oj.uz

답안 #365394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365394 2021-02-11T15:16:18 Z Mlxa Mouse (info1cup19_mouse) C++14
81.6923 / 100
 205 ms 1772 KB 
#ifdef LC
#include "pch.h"
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple

const int N = 1000;

int n;
int p[N];
int c[N][N];
bool b[N][N];
int bc[N];
int kn[N];

mt19937 rnd;

int query(vector<int>);

void block(int i, int j) {
	if (b[i][j]) {
		return;
	}
	b[i][j] = true;
	++bc[i];
	if (bc[i] == n - 1) {
		kn[i] = 1;
		while (b[i][kn[i]]) {
			++kn[i];
		}
		for (int ii = 0; ii < n; ++ii) {
			if (ii != i) {
				block(ii, kn[i]);
			}
		}
	}
}

bool bad(vector<int> q) {
	for (int i = 0; i < (int)q.size(); ++i) {
		if (q[i] == kn[i]) {
			return true;
		}
	}
	return false;
}

void solve(int _n) {
	n = _n;
	int bound = n <= 50? 600 : 4000;
	vector<int> q(n);
	iota(all(q), 1);
	for (int it = 1; ; ++it) {
		int cur = query(q);
		if (cur == n) {
			return;
		}
		if (cur > 1) {
			for (int i = 0; i < n; ++i) {
				c[i][q[i]] += cur;
			}
		} else if (!cur) {
			for (int i = 0; i < n; ++i) {
				block(i, q[i]);
			}
		}
		shuffle(all(q), rnd);
		while (bad(q)) {
			shuffle(all(q), rnd);
		}
		if (it == bound - 2 || *min_element(bc, bc + n) == n - 1) {
#ifdef LC
			cout << it << " queries" << endl;
#endif
			for (int i = 0; i < n; ++i) {
				for (int j = 1; j <= n; ++j) {
					if (b[i][j]) {
						c[i][j] = -1;
					}
				}
				q[i] = (int)(max_element(c[i] + 1, c[i] + n + 1) - c[i]);
			}
			assert(query(q) == n);
			return;
		}
	}
}

#ifdef LC
int query(vector<int> q) {
	int cnt = 0;
	for (int i = 0; i < (int)q.size(); ++i) {
		cnt += p[i] == q[i];
	}
	return cnt;
}
signed main() {
	assert(freopen("input.txt", "r", stdin));
	int _n;
	cin >> _n;
	for (int i = 0; i < _n; ++i) {
		cin >> p[i];
	}
	solve(_n);
	return 0;
}
#endif

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Correct! Number of queries: 35
2 Correct 1 ms 364 KB Correct! Number of queries: 3
3 Correct 1 ms 364 KB Correct! Number of queries: 31
4 Correct 1 ms 364 KB Correct! Number of queries: 35
5 Correct 1 ms 364 KB Correct! Number of queries: 25
6 Correct 1 ms 364 KB Correct! Number of queries: 16

Subtask #2
31.99999 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Correct! Number of queries: 35
2 Correct 1 ms 364 KB Correct! Number of queries: 3
3 Correct 1 ms 364 KB Correct! Number of queries: 31
4 Correct 1 ms 364 KB Correct! Number of queries: 35
5 Correct 1 ms 364 KB Correct! Number of queries: 25
6 Correct 1 ms 364 KB Correct! Number of queries: 16
7 Correct 6 ms 516 KB Correct! Number of queries: 500
8 Correct 11 ms 620 KB Correct! Number of queries: 500
9 Correct 9 ms 620 KB Correct! Number of queries: 600
10 Correct 10 ms 620 KB Correct! Number of queries: 600
11 Correct 6 ms 620 KB Correct! Number of queries: 400
12 Correct 9 ms 620 KB Correct! Number of queries: 600
13 Correct 8 ms 620 KB Correct! Number of queries: 500
14 Correct 12 ms 620 KB Correct! Number of queries: 600
15 Correct 7 ms 516 KB Correct! Number of queries: 500
16 Correct 14 ms 620 KB Correct! Number of queries: 600

Subtask #3
36.692327 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Correct! Number of queries: 35
2 Correct 1 ms 364 KB Correct! Number of queries: 3
3 Correct 1 ms 364 KB Correct! Number of queries: 31
4 Correct 1 ms 364 KB Correct! Number of queries: 35
5 Correct 1 ms 364 KB Correct! Number of queries: 25
6 Correct 1 ms 364 KB Correct! Number of queries: 16
7 Correct 6 ms 516 KB Correct! Number of queries: 500
8 Correct 11 ms 620 KB Correct! Number of queries: 500
9 Correct 9 ms 620 KB Correct! Number of queries: 600
10 Correct 10 ms 620 KB Correct! Number of queries: 600
11 Correct 6 ms 620 KB Correct! Number of queries: 400
12 Correct 9 ms 620 KB Correct! Number of queries: 600
13 Correct 8 ms 620 KB Correct! Number of queries: 500
14 Correct 12 ms 620 KB Correct! Number of queries: 600
15 Correct 7 ms 516 KB Correct! Number of queries: 500
16 Correct 14 ms 620 KB Correct! Number of queries: 600
17 Correct 193 ms 1648 KB Correct! Number of queries: 3900
18 Correct 165 ms 1516 KB Correct! Number of queries: 3600
19 Correct 159 ms 1516 KB Correct! Number of queries: 3500
20 Correct 205 ms 1644 KB Correct! Number of queries: 4000
21 Correct 160 ms 1516 KB Correct! Number of queries: 3500
22 Correct 179 ms 1516 KB Correct! Number of queries: 3900
23 Correct 161 ms 1540 KB Correct! Number of queries: 3500
24 Correct 191 ms 1644 KB Correct! Number of queries: 3900
25 Correct 168 ms 1772 KB Correct! Number of queries: 3500
26 Correct 168 ms 1644 KB Correct! Number of queries: 3700