Submission #828111

#TimeUsernameProblemLanguageResultExecution timeMemory
828111SebPrisoner Challenge (IOI22_prison)C++17
0 / 100
1 ms300 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define f first #define s second std::vector<std::vector<int>> devise_strategy(int N) { vector <vector<int>> ans; vector <int> aux; aux.push_back(0); for (int i=1;i<=N;i++) { if ((i>>11)&1) aux.push_back(24); else aux.push_back(12); } ans.push_back(aux); aux.clear(); for (int k=0;k<=11;k++) { aux.push_back(1); for (int i=1;i<=N;i++) { if ((i>>k)&1) aux.push_back(-2); else aux.push_back(24+k); } ans.push_back(aux); aux.clear(); } for (int k=0;k<=11;k++) { aux.push_back(1); for (int i=1;i<=N;i++) { if ((i>>k)&1) aux.push_back(24+k); else aux.push_back(-1); } ans.push_back(aux); aux.clear(); } for (int k=0;k<=10;k++) { aux.push_back(0); for (int i=1;i<=N;i++) { if ((i>>k)&1) aux.push_back(13+k); else aux.push_back(1+k); } ans.push_back(aux); aux.clear(); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...