제출 #1140292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1140292		Lemser	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	0 ms	328 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using pii = pair<int,int>;
using pll = pair<ll, ll>;
 
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
 
// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
 
bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"YES\n":"NO\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }

vector<vector<int>> devise_strategy(int N) {
  vector<vector<int>> ans;
  /*
  0 representa el bit 12 de A
  1 representa el bit 12 de B antes 0  
  2 representa el bit 12 de B antes 1

  x mod 3 = 
  0 -> estamos en A
  1 -> estamos en B el anterior fue 0
  2 -> estamos en B el anterior fue 1

  */
  ll b = 13;
  fo (num, 39) {
    vector<int> ar(N+1, 0);
    ll w = num%3;
    ar[0] = (w > 0);
    if (w == 0) b--;
    fore (j, 1, N+1) {
      ll t = (j&(1<<b)) ? 1 : 0;
      if (w == 0) {
        ar[j] = num + 1 + t;
      } else {
        w--;
        if (t > w) ar[j] = -1;
        else if (t < w) ar[j] = -2;
        else {
          ar[j] = num-t+2;
        }
        w++;
      }
    }
  }
  return ans;
}

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