Submission #1210868

#	Time	Username	Problem	Language	Result	Execution time	Memory
1210868		steveonalex	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	0 ms	328 KiB

prison

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }


 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#include "prison.h"

vector<vector<int>> devise_strategy(int N) {
    vector<vector<int>> ans(53, vector<int>(N+1));
    for(int i = 1; i <= N; ++i){
        ans[0][i] = 12 * 4 + GETBIT(i, 12) + 1;
    }
    for(int j = 1; j <= 52; ++j){
        int _j = j - 1;
        int current_bit = _j / 4;
        int turn = GETBIT(_j, 1), last_digit = GETBIT(_j, 0);
        if (turn == 0){
            ans[j][0] = 1;
            for(int i = 1; i <= N; ++i){
                if (GETBIT(i, current_bit) > last_digit) ans[j][i] = -2;
                else if (GETBIT(i, current_bit) < last_digit) ans[j][i] = -1;
                else if (current_bit == 0){
                    ans[j][i] = -1;
                }
                else{
                    ans[j][i] = 1 + (current_bit-1) * 4 + 2;
                }
            }
        }
        else{
            ans[j][0] = 0;
            for(int i = 1; i <= N; ++i){
                ans[j][i] = 1 + current_bit * 4 + GETBIT(i, current_bit);
            }
        }
    }
    return ans;
}


// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
 
//     clock_t start = clock();

 
//     cerr << "Time elapsed: " << clock() - start << "ms!\n";
//     return 0;
// }

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