제출 #628699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628699		tutis	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	7 ms	724 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<std::vector<int>> devise_strategy(int N) {
    vector<vector<int>>ret;
    vector<pair<int, int>>S = {{1, N}};
    vector<pair<int, int>>S_;
    while (!S.empty())
    {
        S_ = {};
        int x = (int)ret.size();
        // int mx = 0;
        // for (int i = 0; i < (int)S.size(); i++)
        // {
        //     int lo = S[i].first;
        //     int hi = S[i].second;
        //     lo++;
        //     hi--;
        //     mx = max(mx, hi - lo + 1);
        // }
        ret.push_back(vector<int>(N + 1, 0));
        for (int t = 0; t < 4; t++)
            ret.push_back(vector<int>(N + 1, 0));
        for (int t = 0; t < 4; t++)
            ret[x + 1 + t][0] = 1;
        vector<int>&v = ret[x];
        v[0] = 0;
        for (int i = 0; i < (int)S.size(); i++)
        {
            int lo = S[i].first;
            int hi = S[i].second;
            v[lo] = -1;
            v[hi] = -2;
            lo++;
            hi--;
            int sz = hi - lo + 1;
            if (sz >= 1)
            {
                int k = sz / 4;
                k = max(k, 2);
                for (int t = 0; t < 4; t++)
                {
                    int l = lo + t * k;
                    int r = lo + (t + 1) * k;
                    r = min(r, hi);
                    if (l <= r)
                    {
                        for (int i = l; i <= r; i++)
                        {
                            ret[(x + 1) + t][i] = x + 5;
                            v[i] = x + 1 + t;
                        }
                        for (int i = lo - 1; i <= l; i++)
                        {
                            ret[(x + 1) + t][i] = -2;
                        }
                        for (int i = r; i <= hi + 1; i++)
                        {
                            ret[(x + 1) + t][i] = -1;
                        }
                        if (r - l + 1 > 2)
                        {
                            S_.push_back({l, r});
                        }
                    }
                }
            }
        }
        S = S_;
    }
    int mx = (int)ret.size() - 1;
    for (vector<int> &i : ret)
        for (int &j : i)
            j = min(j, mx);
    return ret;
}

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