제출 #839583

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

lockpicking

// correct/subtask2.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(N*M);
    t.assign(N*M, vector<int>(2));
    for (int c=0; c<N; ++c) {
        int i = c;
        vector<int> last(N);
        for (int j=c*M; j<(c+1)*M; ++j) {
            b[j] = a[i];
            t[j][a[i]] = j+1;
            t[j][1-a[i]] = (c+1<N ? j+M+1 : j+1);
            last[i] = j;
            i = s[i][a[i]];
        }
        t[c*M+M-1][0] = t[c*M+M-1][1] = last[i];
    }
    
	define_states(N*M, b, t, 0);
}

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