oj.uz

Submission #149925

# Submission time Handle Problem Language Result Execution time Memory
149925 2019-09-01T07:24:00 Z Outfraware Boat People(#3577, c4big, bsyo2k, cepiloth) On the Grid (FXCUP4_grid) C++17
12 / 100
 8 ms 384 KB 
#include "grid.h"

typedef std::vector<int> VI;


bool visit[1001] = { 0, };
VI v;

// ģ�� ���� �����
VI &makeSeq(int N, int start, VI &found, VI &len_friend) {
	//VI v(N);

	/*for (int i = N - 1; i >= 0; --i) {
		if (!len_friend[i])
			break;

		v[i] = len_friend[i];
	}*/

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

		if (visit[num])
			continue;

		v[i++] = num;
	}

	return v;
}

VI SortDisks(int N) {
	VI found(N, 0);
	VI len_friend(N, 0);
	v = found;

	int max_h = N + (N - 1);

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

			if (X != max_h)
				continue;

			found[v[0]] = L;
			visit[v[0]] = true;
			len_friend[L - 1] = v[0];
			v[L - 1] = v[0];
			--max_h;
			break;
		}
	}
	
	return found;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 304 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 6 ms 304 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Incorrect 8 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 8 ms 384 KB Output isn't correct
3 Correct 6 ms 304 KB Output is correct
4 Correct 7 ms 256 KB Output is correct
5 Correct 5 ms 304 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Halted 0 ms 0 KB -
8 Correct 5 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 6 ms 256 KB Output is correct