Submission #628173

#	Time	Username	Problem	Language	Result	Execution time	Memory
628173		TheQuantiX	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	13 ms	10324 KiB

prison

// Made by TheQuantiX
#include <bits/stdc++.h>
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,sse4.2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

using ll = long long;

constexpr ll MAXN = 1e5;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000000000000000LL;

ll tt, n, m, k, x, y, a, b, c, d;

vector< vector<int> > devise_strategy(int n) {
    vector< vector<int> > ans(1, vector<int>(n + 1));
    queue< pair< pair<int, int>, pair<int, int> > > q;
    q.push({{0, 0}, {1, n}});
    while (!q.empty()) {
        auto p = q.front();
        q.pop();
        ll l = p.second.first;
        ll r = p.second.second;
        ll x = p.first.first;
//        cout << x << ' ' << l << ' ' << r << endl;
        ans[x].resize(n + 1);
        ans[x][0] = p.first.second;
        for (int i = 1; i <= l; i++) {
            if (p.first.second == 0) {
                ans[x][i] = -1;
            }
            else {
                ans[x][i] = -2;
            }
        }
//        cout << "DEBUG" << endl;
        for (int i = r; i <= n; i++) {
            if (p.first.second == 0) {
                ans[x][i] = -2;
            }
            else {
                ans[x][i] = -1;
            }
        }
        l++;
        r--;
//        cout << "DEBUG" << endl;
        if (l > r) {
            continue;
        }
        int mid = (r + l) / 2;
        for (int i = l; i <= mid; i++) {
            ans[x][i] = ans.size();
        }
        for (int i = mid + 1; i <= r; i++) {
            ans[x][i] = ans.size() + 1;
        }
        q.push({{ans.size(), 1 - p.first.second}, {l, mid}});
        ans.resize(ans.size() + 1);
//        cout << "DEBUG" << endl;
        if (l != r) {
            q.push({{ans.size(), 1 - p.first.second}, {mid + 1, r}});
            ans.resize(ans.size() + 1);
        }
    }
    return ans;
}

//void solve() {
//    cin >> n;
//    auto x = devise_strategy(n);
//    for (auto &i : x) {
//        for (auto j : i) {
//            cout << j << ' ';
//        }
//        cout << '\n';
//    }
//}
//
//int main() {
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    cout.tie(0);
//    cout << fixed;
//    cout << setprecision(10);
//    tt = 1;
////    cin >> tt;
//    while (tt --> 0) {
//        solve();
//    }
//}

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