oj.uz

답안 #150876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150876 2019-09-01T09:51:49 Z percywtc On the Grid (FXCUP4_grid) C++17
43 / 100
 65 ms 504 KB 
#include "grid.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> L, ub;

const int TRIALS = 1;

bool check(int N, int target_stick, int target_level, vector<int> undetermined, vector<int>& determined) {
	for (int t = 0; t < TRIALS; t++) {
		vector<int> p(1, target_stick);
		random_shuffle(undetermined.begin(), undetermined.end());

		for (int elm : undetermined) {
			if (elm != target_stick) {
				p.push_back(elm);
			}
		}
		for (int elm : determined) {
			p.push_back(elm);
		}

		int verdict = PutDisks(p);

		int cnt = N - (verdict - N + 1) + 1;

		for (int i = 0; i < cnt; i++) {
			int guess = i + N - cnt + 1;
			ub[p[i]] = min(ub[p[i]], guess);
		}
		
		if (verdict < target_level + N - 1) {
			return false;
		}
	}

	return true;
}

bool cmp(int u, int v) {
	return L[u] < L[v];
}

vector<int> SortDisks(int N) {
	L = vector<int>(N, 0);
	ub = vector<int>(N, N);

	srand(689);

	for (int i = N; i >= 1; i--) {
		vector<int> determined, undetermined;
		for (int j = 0; j < N; j++) {
			if (L[j]) {
				determined.push_back(j);
			} else {
				undetermined.push_back(j);
			}
		}

		int only = -1;
		for (int elm : undetermined) {
			if (ub[elm] >= i) {
				if (only == -1) {
					only = elm;
				} else {
					only = -2;
				}
			}
		}

		if (only > 0) {
			L[only] = i;
			continue;
		}

		sort(determined.begin(), determined.end(), cmp);

		random_shuffle(undetermined.begin(), undetermined.end());
		for (int elm : undetermined) {
			if (ub[elm] < i) {
				continue;
			}
			if (check(N, elm, i, undetermined, determined)) {
				L[elm] = i;
				break;
			}
		}
	}

	return L;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 3 ms 348 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 9 ms 248 KB Output is correct
11 Correct 12 ms 504 KB Output is correct
12 Correct 11 ms 248 KB Output is correct
13 Correct 10 ms 248 KB Output is correct
14 Correct 10 ms 248 KB Output is correct
15 Correct 10 ms 376 KB Output is correct
16 Correct 10 ms 248 KB Output is correct

Subtask #3
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 9 ms 248 KB Output is correct
11 Correct 12 ms 504 KB Output is correct
12 Correct 11 ms 248 KB Output is correct
13 Correct 10 ms 248 KB Output is correct
14 Correct 10 ms 248 KB Output is correct
15 Correct 10 ms 376 KB Output is correct
16 Correct 10 ms 248 KB Output is correct
17 Correct 22 ms 248 KB Output is correct
18 Incorrect 65 ms 248 KB Output isn't correct
19 Halted 0 ms 0 KB -