답안 #149218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149218 2019-09-01T05:59:35 Z Outfraware Boat People(#3577, c4big, bsyo2k, cepiloth) On the Grid (FXCUP4_grid) C++17
12 / 100
9 ms 344 KB
#include "grid.h"

typedef std::vector<int> VI;

// ģ�� ���� �����
VI makeSeq(int N, int start, VI &found) {
	VI v(N);
	
	for (int i = 0, count = 0; count < N; ++count) {
		int num = (start + count) % N;

		// �ش� ģ���� ���̰� �������ٸ�.
		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;
}


# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Incorrect 9 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Incorrect 9 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -