Submission #774079

#	Time	Username	Problem	Language	Result	Execution time	Memory
774079		jasmin	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	19 ms	19116 KiB

prison

#include "prison.h"
#include<bits/stdc++.h>
using namespace std;

std::vector<std::vector<int>> devise_strategy(int n) {

    vector<vector<int> > ans(n+1, vector<int> (n+1, -1));
    
    ans[0][0]=0;
    for(int i=1; i<=n; i++){
        ans[i][0]=1;
    }

    for(int i=1; i<=n; i++){
        ans[0][i]=i;
    }

    for(int i=1; i<=n; i++){
        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