Submission #1321215

#TimeUsernameProblemLanguageResultExecution timeMemory
1321215mirasm죄수들의 도전 (IOI22_prison)C++20
38 / 100
10 ms1700 KiB
#include "prison.h" #include<bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int n) { vector<vector<int>> ans(39, vector<int>(n + 1)); for (int i = 0, go = 13; i <= 12; go += 2, i++) { ans[i][0] = 0; for (int j = 1; j <= n; j++) { ans[i][j] = go + (j >> (12 - i) & 1); } } for (int i = 13, bit = 12; i < 39; bit--, i += 2) { ans[i][0] = 1; ans[i + 1][0] = 1; for (int j = 1; j <= n; j++) { if (j >> bit & 1) { ans[i][j] = -1; ans[i + 1][j] = (12 - bit) + 1; } else { ans[i][j] = (12 - bit) + 1; ans[i + 1][j] = -2; } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...