Submission #629882

#	Time	Username	Problem	Language	Result	Execution time	Memory
629882		TimDee	Prisoner Challenge (IOI22_prison)	C++17	41 / 100	25 ms	1500 KiB

prison

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

void fill(vector<vector<int>>&a, int n, int sz, int ind) {

  //cout<<"fill "<<sz<<' '<<ind<<'\n'; int x; cin>>x;

  if (sz==2) {
    for (int i=1; i<=n; ++i) a[ind][i]=-(2-(i&1));
    return;
  }

  for (int i=1; i<=n; ++i) {
    if ((i-1)%sz<sz/2) a[ind][i]=ind+1;
    else a[ind][i]=ind+2;
  }
  a[ind+1][0]=1;
  for (int i=1; i<=n; ++i) {
    if ((i-1)%sz<sz/2) a[ind+1][i]=ind+3;
    else a[ind+1][i]=-1;
  }
  a[ind+2][0]=1;
  for (int i=1; i<=n; ++i) {
    if ((i-1)%sz<sz/2) a[ind+2][i]=-2;
    else a[ind+2][i]=ind+3;
  }
  sz>>=1;

  fill(a,n,sz,ind+3);

}

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

  vector<vector<int>> a(37,vector<int>(n+1,0));
  
  int sz=1<<13;

  fill(a,n,sz,0);

  for (int i=0; i<37; ++i) {
    //auto x=a[i];
    //cout<<i<<": ";
    //if (x[0]==0) cout<<"A "; else cout<<"B ";
    //for (auto y:x) cout<<y<<' '; cout<<'\n';
  }
  
  return a;

}

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