제출 #839581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839581		model_code	Lockpicking (IOI23_lockpicking)	C++17	100 / 100	23 ms	4204 KiB

lockpicking

// model_solution/solution.cpp

#include "lockpicking.h"

using namespace std;

int M;
vector<int> a, b;
vector<vector<int>> s, t;

void construct_card(int N, std::vector<int> A, std::vector<std::vector<int>> S) {
    a = A, s = S;
	M = N*N;
    b.resize(M);
    t.assign(M, vector<int>(2));
    for (int c=0; c<N; ++c) {
        for (int j=c*N; j<(c+1)*N; ++j) {
            b[j] = a[j%N];
            t[j][b[j]] = c*N + s[j%N][b[j]];
            t[j][1-b[j]] = -1;
        }
    }
    for (int i0=1; i0<N; ++i0) {
        int i = i0, j = 0;
        for (int cnt=0; cnt<M; ++cnt) {
            if (b[j] == a[i]) {
                j = t[j][b[j]];
                i = s[i][a[i]];
            }
            else {
                if (t[j][a[i]] == -1) {
                    int nxti = s[i][b[j]];
                    t[j][a[i]] = i0*N + nxti;
                    break;
                }
                else {
                    j = t[j][a[i]];
                    i = s[i][1-a[i]];
                }
            }
        }
    }
    for (int j=0; j<M; ++j) {
        t[j][0] = max(0, t[j][0]);
        t[j][1] = max(0, t[j][1]);
    }
    
	define_states(M, b, t, 0);
}

• Subtask 1: 21 / 21
• Subtask 2: 30 / 30
• Subtask 3: 20 / 20
• Subtask 4: 29 / 29