#include "squares.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
const int INF = 2e9, M = 1e9+7, LOG = 16;
const ll LINF = 1e18;
int len, N;
string res;
unordered_map<string, bool> vis;
void dfs(string node) {
for(int i = 0; i < 2; i++) {
string to = node + char('0' + i);
if(!vis[to]) {
vis[to] = true;
dfs(to.substr(1));
res += to.back();
}
}
}
string seq[15];
void deBruijn () {
vis.clear();
res.clear();
string s = string(len-1, '0');
dfs(s);
res += s;
seq[len] = res;
}
vector<int> paint(int n) {
N = n;
vector<int> labels(n);
len = min(10, n);
if(seq[len].empty()) deBruijn();
else res = seq[len];
for(int i = 0; i < n; ++i)
labels[i] = res[i]-'0';
labels.push_back(len);
return labels;
}
int find_location(int n, vector<int> c) {
N = n;
vector<int> labels(n);
len = min(10, n);
if(seq[len].empty()) deBruijn();
else res = seq[len];
for(int i = 0; i < n; ++i)
labels[i] = res[i]-'0';
for(int i = 0; i < len; i++) labels.push_back(-1);
for(int i = 0; i < n; i++) {
if(equal(all(c), labels.begin()+i, labels.begin()+i+len))
return i;
}
return -1;
}
