Submission #740555

#	Time	Username	Problem	Language	Result	Execution time	Memory
740555		ALVIN	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1 ms	340 KiB

prison

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
    const int num_prisoners = 500;
    std::vector<std::vector<int>> strategy(num_prisoners+1, std::vector<int>(N+1, 0));
    
    for (int i = 0; i <= num_prisoners; ++i) {
        if (i <= 250) {
            strategy[i][0] = 0;  // Inspect bag A.
        } else {
            strategy[i][0] = 1;  // Inspect bag B.
        }

        for (int j = 1; j <= N; ++j) {
            strategy[i][j] = (i+1) % num_prisoners;
        }
    }

    for (int i = 0; i <= 250; ++i) {
        strategy[i][i] = -1;  // Identify bag A as having fewer coins.
    }
    
    for (int i = 251; i <= num_prisoners; ++i) {
        strategy[i][i-250] = -2;  // Identify bag B as having fewer coins.
    }

    return strategy;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90