Submission #625982

#TimeUsernameProblemLanguageResultExecution timeMemory
625982huutuanPrisoner Challenge (IOI22_prison)C++17
0 / 100
0 ms212 KiB
#include "prison.h"
#include<bits/stdc++.h>

using namespace std;

vector<vector<int>> devise_strategy(int n){
    vector<vector<int>> v(43, vector<int>(n+1));
    for (int i=0; i<43; ++i) v[i][0]=1;
    int mm=1000;
    for (int r=0; r<4; ++r){
        for (int i=10*r+3; i<10*(r+1)+3; ++i){
            for (int j=1; j<=n; ++j){
                int t=j/mm%10;
                if ((i-3)%10<t) v[i][j]=-1;
                if ((i-3)%10>t) v[i][j]=-2;
                if ((i-3)%10==t && r!=3) v[i][j]=40+r;
            }
        }
        mm/=10;
        if (r==3) break;
        for (int j=1; j<=n; ++j){
            v[r][j]=10*r+(j/mm)%10+3;
        }
    }
    return v;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...