oj.uz

Submission #149414

# Submission time Handle Problem Language Result Execution time Memory
149414 2019-09-01T06:26:23 Z Outfraware Boat People(#3577, c4big, bsyo2k, cepiloth) On the Grid (FXCUP4_grid) C++17
0 / 100
 5 ms 256 KB 
#include "grid.h"

typedef std::vector<int> VI;

// ģ�� ���� �����
VI makeSeq(int N, int start, VI &found) {
	VI v(N);
	
	for (int i = 0; i < N; ++i) {
		if (found[i]) {
			int id = found[i] - 1;  // "L - 1" means idx.
			v[id] = i;
		}
	}

	for (int i = 0, count = 0; count < N; ++count) {
		int num = (start + count) % N;

		if (v[i])
			continue;

		// �ش� ģ���� ���̰� �������ٸ�.
		//if (found[num] > 0) {
		//	int id = found[num] - 1;  // "L - 1" means idx.
		//	v[id] = num;
		//	continue;
		//}

		v[i] = num;
		++i;
	}

	return v;
}

VI SortDisks(int N) {
	VI found(N, 0);

	int max_h = N + (N - 1);

	for (int k = N - 1; k >= 0; --k) {
		for (int i = 0; i < N; ++i) {
			VI v = makeSeq(N, i, found);
			int X = PutDisks(v);

			if (X != max_h)
				continue;

			found[v[0]] = k + 1;
			--max_h;
			break;
		}
	}
	
	return found;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -