Submission #1043145

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043145		Marco_Escandon	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	4 ms	1116 KiB

prison

#include<bits/stdc++.h>
using namespace std;
//#include "prison.h"
typedef int ll;
vector<vector<ll>> s;
ll cad[]={2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2};
ll P[20][5588]={ };
void sol(ll p,ll a, ll b)
{
    if(a>=b) return;
    P[p][a]=-1e9;
    P[p][b]=1e9;
    if(a+1==b) return;
    ll t1=(b-a-1)/cad[p];
    ll t2=(b-a-1)%cad[p];
    ll c=0;
    for(int i=a+1; i<b;c++)
    {
        for(int j=0;j<t1+t2; j++)
        {
            P[p][i+j]=c;
        }
        sol(p+1,i,i+t1+t2-1);
        i=i+t1+t2;
        t2--;t2=max(t2,0);
    }
}
ll mv=2;
ll Hash(ll p, ll vp) { return p*mv+vp; }
std::vector<std::vector<int>> devise_strategy(int n) {
    sol(0,1,n);
    s.assign(30,vector<ll>(n+1,0));
    s[0][0]=0;s[0][1]=-1;s[0][n]=-2;
    for(int i=2; i<n; i++)
        s[0][i]=Hash(1,P[0][i]);
    for(int i=1; i<30; i++)
    {
        ll temp=i;
        ll va=temp%mv;
        temp/=mv;
        s[i][0]=max((temp%2),0);
        temp--;
        for(int j=1; j<=n; j++)
        {
            ll vp=P[temp][j];
            if(va==vp)s[i][j]=Hash(temp+2,P[temp+1][i]);
            if((s[i][0]%2==0&&vp<va)||(s[i][0]%2==1&&vp>va)) s[i][j]=-1;
            else s[i][j]=-2;
            if(s[i][j]>30) s[i][j]=0;
        }
    }
    /*for(int i=2; i<30; i++)
    {
        for(int j=1; j<=n; j++)
        {
            cout<<s[i][j]<<P[i/2-1][j]<<" ";
        }
        cout<<"\n";
    }*/
    return s;
}

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