Submission #1214744

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214744		dosts	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	0 ms	332 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

std::vector<std::vector<int>> devise_strategy(int N) {
  const int x = 25;
  vector<vi> ans(x+1,vi(N+1,0));
  ans[0][0] = 0;
  for (int j = 1;j<=N;j++) {
    ans[0][j] = 2*12+!!(j&(1<<12));
  }
  for (int i=25;i>=1;i--) {
    int idx = i/2;
    int v = (i-2*idx);
    ans[i][0] = 1-idx%2;
    for (int j = 1;j<=N;j++) {
      if (!!(j&(1<<idx)) != v) {
        if (!!(j&(1<<idx)) < v) ans[i][j] = -(3-(idx%2+1));
        else ans[i][j] = -(idx%2+1);
      }
      else ans[i][j] = 2*(idx-1)+!!(j&(1<<(idx-1)));
    }
  }
  return ans;
}

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