# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1140284 | goatmar | 죄수들의 도전 (IOI22_prison) | C++20 | 0 ms | 0 KiB |
#include <vector>
using namespace std;
vector<vector<int>> devise_strategy(int N) {
int x = 1;
vector<vector<int>> strategy(x + 1, vector<int>(N + 1, 0));
strategy[0][0] = 0;
for (int j = 1; j <= N; ++j) {
if (j == 1) {
strategy[0][j] = -1;
} else if (j == N) {
strategy[0][j] = -2;
} else {
strategy[0][j] = 1;
}
}
strategy[1][0] = 1;
for (int j = 1; j <= N; ++j) {
if (j == 1) {
strategy[1][j] = -2; //
} else if (j == N) {
strategy[1][j] = -1;
} else {
strategy[1][j] = 0;
}
}
return strategy;
}
#include <iostream>
int main() {
int N = 3;
vector<vector<int>> strategy = devise_strategy(N);
for (int i = 0; i < strategy.size(); ++i) {
cout << "Estrategia para i = " << i << ": ";
for (int j = 0; j < strategy[i].size(); ++j) {
cout << strategy[i][j] << " ";
}
cout << endl;
}
return 0;
}