This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "lockpicking.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
void construct_card(int N, vector<int>A, vector<vector<int>>S) {
vector<int>B=A;
vector<vector<int>>T=S;
int k=1;
vector<int>odw(N);
for(int i=1; i<N; ++i) {
int p=i, s=0;
int ile=0;
while(p!=s%N && ile<1000000) {
++ile;
if(A[p]!=B[s] && !odw[s]) {
rep(j, N) {
B.pb(A[j]);
T.pb({S[j][0]+k*N, S[j][1]+k*N});
}
T[s][A[p]]=S[p][B[s]]+k*N;
++k;
}
int x=A[p], y=B[s];
p=S[p][y];
s=T[s][x];
if(x!=y) ile=0;
}
}
define_states(N*k, B, T, 0);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |