Submission #1230021

#TimeUsernameProblemLanguageResultExecution timeMemory
1230021badge881죄수들의 도전 (IOI22_prison)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> result(37, vector<int>(N + 1, 0)); int power = 12; for (int i = 0; i < 12; i++) { for (int j = 1; j <= N; j++) if (j & (1 << power)) result[i][j] = 13 + i; else result[i][j] = 25 + i; power--; } // cas final on verifie la pow 0 (0 ou 1) et on decide directement car forcement differents for (int j = 1; j <= N; j++) if (j % 2 == 0) result[12][j] = -1; // prend sac A else result[12][j] = -2; // prend sac B power = 12; for (int i = 13; i < 25; i++) { // sac A a la power `power` active result[i][0] = 1; for (int j = 1; j <= N; j++) if (j & (1 << power)) result[i][j] = i - 12; else result[i][j] = -2; // prend sac B power--; } power = 12; for (int i = 25; i < 37; i++) { // sac A a la power `power` disactive result[i][0] = 2; for (int j = 1; j <= N; j++) if (j & (1 << power)) result[i][j] = -1; // prend sac A else result[i][j] = i - 24; power--; } return result; } #ifdef HOME int main() { int N; cin >> N; vector<vector<int>> result = devise_strategy(N); for (int i = 0; i < 37; i++) { cout << "I read " << i << " on board, I will see bag " << result[i][0] << " and write on board: "; for (int j = 1; j <= N; j++) cout << result[i][j] << " "; cout << endl; } int tab = 0; int sacA, sacB; cin >> sacA >> sacB; while (tab >= 0) if (result[tab][0] == 0) cout << "I read " << tab << ", I see bag A and write on board: " << (tab = result[tab][sacA]) << endl; else cout << "I read " << tab << ", I see bag B and write on board: " << (tab = result[tab][sacB]) << endl; cout << "output: " << tab << endl; return 0; } #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...