Submission #856465

#	Time	Username	Problem	Language	Result	Execution time	Memory
856465		samek08	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 ms	348 KiB

prison

#include "prison.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

const int MAXN = 5005;
vector<vector<int>> wyn;

vector<vector<int>> devise_strategy(int N)
{
  wyn.assign(N+1,{});
  rep(i,N+1) wyn[i].assign(N+1,-1);

  wyn[0][0] = 0;
  for(int i = 1; i <= N; ++i) wyn[0][i] = i;

  for(int i = 1; i <= N; ++i)
  {
    wyn[i][0] = 1;
    for(int j = 0; j <= N; ++j)
    {
      if(i < j) wyn[i][j] = -1;
      else wyn[i][j] = -2;
    }
  }
  return wyn;
}

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