Submission #1032239

#TimeUsernameProblemLanguageResultExecution timeMemory
1032239Mr_HusanboyPrisoner Challenge (IOI22_prison)C++17
5 / 100
16 ms19036 KiB
#include "prison.h"
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long

template<typename T>
int len(T &a){
    return a.size();
}

#define a -1
#define b -2

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

vector<std::vector<int>> devise_strategy(int n) {
    vector ans(n + 1, vector(n + 1, 0));
    for(int i = 1; i <= n; i ++){
      ans[0][i] = i;
    }
    for(int i = 1; i <= n; i ++){
      ans[i][0] = 1;
      for(int j = 1; j <= n; j ++){
        ans[i][j] = (i <= j ? a : b);
      }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...