Submission #828118

#	Time	Username	Problem	Language	Result	Execution time	Memory
828118		Seb	Prisoner Challenge (IOI22_prison)	C++17	38 / 100	17 ms	1592 KiB

prison

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define f first
#define s second

std::vector<std::vector<int>> devise_strategy(int N) {
    vector <vector<int>> ans;
    vector <int> aux;
    aux.push_back(0);
    for (int i=1;i<=N;i++) {
        if ((i>>12)&1) aux.push_back(26);
        else aux.push_back(13);
    }
    ans.push_back(aux);
    aux.clear();

    for (int k=0;k<=12;k++) {
        aux.push_back(1);
        for (int i=1;i<=N;i++) {
            if ((i>>k)&1) aux.push_back(-1);
            else aux.push_back(26+k);
        }
        ans.push_back(aux);
        aux.clear();
    }

    for (int k=0;k<=12;k++) {
        aux.push_back(1);
        for (int i=1;i<=N;i++) {
            if ((i>>k)&1) aux.push_back(26+k);
            else aux.push_back(-2);
        }
        ans.push_back(aux);
        aux.clear();
    }

    for (int k=0;k<=11;k++) {
        aux.push_back(0);
        for (int i=1;i<=N;i++) {
            if ((i>>k)&1) aux.push_back(14+k);
            else aux.push_back(1+k);
        }
        ans.push_back(aux);
        aux.clear();
    }
    /*
    for (auto it=ans.begin();it!=ans.end();it++) {
        for (auto itr=it->begin();itr!=it->end();itr++) cout<<*itr<<" ";
        cout<<"\n";
    }
    */
    return ans;
}

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