oj.uz

Submission #966207

# Submission time Handle Problem Language Result Execution time Memory
966207 2024-04-19T14:12:53 Z 42kangaroo Prisoner Challenge (IOI22_prison) C++17
10 / 100
 4 ms 604 KB 
#include "prison.h"

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
	using namespace std;
	vector<vector<int>> strat(26, vector<int>(N + 1, 0));
	strat[0][0] = 0;
	for (int i = 0; i < N; ++i) {
		strat[0][i + 1] = ((i + 1) >> 11) + 1;
	}
	strat[1][0] = strat[2][0] = strat[3][0] = 1;
	for (int i = 1; i < 4; ++i) {
		for (int j = 0; j < N; ++j) {
			if ((j + 1) >> 11 == i - 1) {
				strat[i][j + 1] = 4 + (((j + 1) >> 10) % 2);
			} else if ((j + 1) >> 11 > i - 1) strat[i][j + 1] = -2;
			else strat[i][j + 1] = -1;
		}
	}
	for (int i = 0; i < 9; ++i) {
		strat[4 + 2 * i][0] = strat[5 + 2 * i][0] = i % 2;
		for (int j = 0; j < N; ++j) {
			if (((j + 1) >> (11 - i)) % 2 == 0) {
				strat[5 + 2 * i][j + 1] = -1 - (i) % 2;
				strat[4 + 2 * i][j + 1] = 6 + 2 * i + ((j + 1) >> (10 - i)) % 2;
			} else {
				strat[4 + 2 * i][j + 1] = -1 - (i + 1) % 2;
				strat[5 + 2 * i][j + 1] = 6 + 2 * i + ((j + 1) >> (10 - i)) % 2;
			}
		}
	}
	strat[22][0] = strat[23][0] = 1;
	for (int i = 0; i < N; ++i) {
		if (((i + 1) >> 2) % 2 == 0) {
			strat[23][i + 1] = -2;
			if (i % 4 == 3) {
				strat[22][i + 1] = -2;
			} else if (i % 4 == 2) {
				strat[22][i + 1] = -1;
			} else {
				strat[22][i + 1] = 24 + i % 2;
			}
		} else {
			strat[22][i + 1] = -1;
			if (i % 4 == 3) {
				strat[23][i + 1] = -2;
			} else if (i % 4 == 2) {
				strat[23][i + 1] = -1;
			} else {
				strat[23][i + 1] = 24 + i % 2;
			}
		}
	}
	strat[24][0] = strat[25][0] = 0;
	for (int i = 0; i < N; ++i) {
		strat[24][i + 1] = -1 - (((i + 1) % 4) > 1);
		strat[25][i + 1] = -1 - (((i + 1) % 4) > 2);
	}
	return strat;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 1 ms 348 KB Output is partially correct
3 Partially correct 0 ms 348 KB Output is partially correct
4 Incorrect 4 ms 604 KB Strategy failed for N=2187, A=1025, B=1024
5 Halted 0 ms 0 KB -