Submission #1078737

#TimeUsernameProblemLanguageResultExecution timeMemory
1078737LittleOrangePrisoner Challenge (IOI22_prison)C++17
5 / 100
18 ms19292 KiB
#include "prison.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = int;

std::vector<std::vector<int>> devise_strategy(int N) {
  ll n = N;
  vector<vector<ll>> ret;
  {
    vector<ll> a(n+1);
    iota(a.begin(),a.end(),0);
    ret.push_back(a);
  }
  for(ll i = 1;i<=n;i++){
    vector<ll> a(n+1,1);
    for(ll j = 1;j<=n;j++){
      a[j] = i<j?-1:-2;
    }
    ret.push_back(a);
  }
  return ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...