Submission #1026406

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026406		Mardonbekhazratov	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	19 ms	37956 KiB

prison

#include "prison.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>>ans;

std::vector<std::vector<int>> devise_strategy(int N) {
    ans.assign(N,vector<int>(N+1));
    iota(ans[0].begin(),ans[0].end(),0);
    ans[0][N]=N-1;
    for(int i=1;i<N;i++){
        ans[i][0]=1;
        for(int j=1;j<=N;j++){
            if(j<=i) ans[i][j]=-2;
            else ans[i][j]=-1;
        }
    }
    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90