Submission #626219

#TimeUsernameProblemLanguageResultExecution timeMemory
626219huutuan죄수들의 도전 (IOI22_prison)C++17
48.50 / 100
17 ms1364 KiB
#include "prison.h" #include<bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int n){ vector<vector<int>> v(32, vector<int>(n+1)); for (int i=8; i<32; ++i) v[i][0]=1; int mm=2187; for (int r=0; r<8; ++r){ for (int i=3*r+8; i<3*r+11; ++i){ for (int j=1; j<=n; ++j){ int s=(i%3-2+3)%3; int t=(j/mm)%3; if (s<t) v[i][j]=-1; if (s>t) v[i][j]=-2; if (s==t) v[i][j]=r+1; } } for (int j=1; j<=n; ++j){ v[r][j]=r*3+(j/mm)%3+8; } mm/=3; } return v; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...