제출 #1234618

#제출 시각아이디문제언어결과실행 시간메모리
1234618Muhammad_AneeqPrisoner Challenge (IOI22_prison)C++20
0 / 100
0 ms328 KiB
#include "prison.h" #include <vector> #include <iostream> using namespace std; vector<vector<int>> devise_strategy(int n) { vector<vector<int>>ans(39); for (int i=1;i<=26;i++) { vector<int>s; s.push_back(1); for (int j=1;j<=n;j++) { bool w=(i%2==0); int bt=(i+1)/2-1; bool x=(1<<bt)&j; if (x==w) s.push_back(26+bt-1); else if (x&!w) s.push_back(-1); else s.push_back(-2); } ans[i]=s; } for (int i=27;i<=38;i++) { vector<int>s; s.push_back(0); for (int j=1;j<=n;j++) { int bt=(i-26); bool w=(1<<bt)&j; bt=2*bt+1; s.push_back(bt+w); } ans[i]=s; } vector<int>s; s.push_back(0); for (int j=1;j<=n;j++) { int bt=12; bool w=(1<<bt)&j; bt=2*bt+1; s.push_back(bt+w); } ans[0]=s; // for (int i=0;i<40;i++) // cout<<ans[i].size()<<endl; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...