結果
| 問題 | No.2893 Minahoshi (Hard) |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2024-09-13 22:28:36 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 15,600 bytes |
| コンパイル時間 | 3,632 ms |
| コンパイル使用メモリ | 252,880 KB |
| 実行使用メモリ | 36,444 KB |
| 最終ジャッジ日時 | 2024-09-13 22:29:09 |
| 合計ジャッジ時間 | 27,316 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
| testcase_45 | WA | - |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | WA | - |
ソースコード
//#define _GLIBCXX_DEBUG
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug_print.hpp>
#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define OUT(...) (static_cast<void>(0))
#endif
#define endl '\n'
#define lfs cout<<fixed<<setprecision(15)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
namespace template_tute{
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max<ll>({a,b,c})-min<ll>({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << "(" << p.first << "," << p.second << ")";}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
auto tmp = v;
for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
rearrange(ord, head);
rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
vector<T>inv(ord.size());
for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
namespace converter{
int dict[500];
const string lower="abcdefghijklmnopqrstuvwxyz";
const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string digit="0123456789";
const string digit1="123456789";
void regi_str(const string &t){
for(int i=0;i<t.size();i++){
dict[t[i]]=i;
}
}
void regi_int(const string &t){
for(int i=0;i<t.size();i++){
dict[i]=t[i];
}
}
vector<int>to_int(const string &s,const string &t){
regi_str(t);
vector<int>ret(s.size());
for(int i=0;i<s.size();i++){
ret[i]=dict[s[i]];
}
return ret;
}
vector<int>to_int(const string &s){
auto t=s;
sort(t.begin(),t.end());
t.erase(unique(t.begin(),t.end()),t.end());
return to_int(s,t);
}
vector<vector<int>>to_int(const vector<string>&s,const string &t){
regi_str(t);
vector<vector<int>>ret(s.size(),vector<int>(s[0].size()));
for(int i=0;i<s.size();i++){
for(int j=0;j<s[0].size();j++){
ret[i][j]=dict[s[i][j]];
}
}
return ret;
}
vector<vector<int>>to_int(const vector<string>&s){
string t;
for(int i=0;i<s.size();i++){
t+=s[i];
}
sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());
return to_int(s,t);
}
string to_str(const vector<int>&s,const string &t){
regi_int(t);
string ret;
for(auto z:s)ret+=dict[z];
return ret;
}
vector<string> to_str(const vector<vector<int>>&s,const string &t){
regi_int(t);
vector<string>ret(s.size());
for(int i=0;i<s.size();i++){
for(auto z:s[i])ret[i]+=dict[z];
}
return ret;
}
}
template< typename T = int >
struct edge {
int to;
T cost;
int id;
edge():to(-1),id(-1){};
edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
operator int() const { return to; }
};
template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
Graph<T>ret(g.size());
for(int i=0;i<g.size();i++){
for(auto e:g[i]){
int to = e.to;
e.to = i;
ret[to].push_back(e);
}
}
return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
Graph<T> ret(n);
for(int es = 0; es < m; es++){
int u,v;
T w=1;
cin>>u>>v;u-=indexed,v-=indexed;
if(weighted)cin>>w;
ret[u].emplace_back(v,w,es);
if(!directed)ret[v].emplace_back(u,w,es);
}
return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
Graph<T>ret(n);
for(int i=1;i<n;i++){
int p;cin>>p;
p-=indexed;
ret[p].emplace_back(i);
if(!directed)ret[i].emplace_back(p);
}
return ret;
}
}
using namespace template_tute;
struct SuffixArray{
ll size;
string str;
vector<ll>data, rank;
SuffixArray(string S):size(S.size()),str(S){
str += '!';//数列の場合は最小値-1,str[i]を+最小値してからinputに代入,必要なら座圧,kindも調整
vector<ll>input(str.size());
for(ll i=0;i<str.size();i++)input[i] = str[i];
data = induced_sort(input, 200);
data.erase(data.begin()); data.push_back(size);
str.pop_back();
rank.assign(size,0);
for(ll i=0;i<size;i++){
rank[data[i]] = i;
}
}
vector<ll> induced_sort(vector<ll>t, ll kind){
ll sz = t.size();
vector<bool>ls(sz);//trueはL型,falseはS型
for(ll i = sz-1;i>=0;i--){
if(i==sz-1)ls[i] = false;
else{
if(t[i]!=t[i+1])ls[i] = (t[i] > t[i+1]);
else ls[i] = ls[i+1];
}
}
vector<ll>cnt(kind);
for(ll i=0;i<sz;i++)cnt[t[i]]++;
vector<P>lr(kind,MP(-1,-1));
for(ll i=1;i<kind;i++){
if(cnt[i]==0)lr[i] = lr[i-1];
else lr[i] = make_pair(lr[i-1].se + 1, lr[i-1].se + cnt[i]);
}
vector<ll>lmsidx,ret(sz,-1);
for(ll i=0;i<sz-1;i++){
if(ls[i]&&!ls[i+1]){
ret[lr[t[i+1]].fi+cnt[t[i+1]]-1]=i+1;
cnt[t[i+1]]--;
lmsidx.push_back(i+1);
}
}
fill(ALL(cnt),0);
for(ll i=0;i<sz;i++){
if(ret[i]>=1&&ls[ret[i]-1]){
ret[lr[t[ret[i]-1]].fi+cnt[t[ret[i]-1]]]=ret[i]-1;
cnt[t[ret[i]-1]]++;
if(i!=0&&!ls[ret[i]])ret[i]=-1;
}
}
fill(ALL(cnt),0);
for(ll i=sz-1;i>=1;i--){
if(ret[i]>=1&&!ls[ret[i]-1]){
ret[lr[t[ret[i]-1]].se-cnt[t[ret[i]-1]]]=ret[i]-1;
cnt[t[ret[i]-1]]++;
}
}
vector<ll>rev_lmsidx(sz,-1),lmsinput(lmsidx.size(),-1);
for(ll i=0;i<lmsidx.size();i++)rev_lmsidx[lmsidx[i]] = i;
ll kindnum=1;
lmsinput[rev_lmsidx[ret[0]]] = 1;
vector<ll>comp(t.begin()+ret[0],t.end());
for(ll i=1;i<sz;i++){
if(ret[i]>=1&&ls[ret[i]-1]&&!ls[ret[i]]){
vector<ll>tmp(t.begin()+ret[i],t.begin()+lmsidx[rev_lmsidx[ret[i]]+1]+1);
if(comp != tmp){
kindnum++;
comp = tmp;
}
lmsinput[rev_lmsidx[ret[i]]] = kindnum;
}
}
vector<ll>output;
if(kindnum==lmsidx.size()){
output.assign(kindnum,-1);
for(ll i=0;i<lmsinput.size();i++)output[lmsinput[i]-1]=i;
}
else output = induced_sort(lmsinput,kindnum+1);
fill(ALL(cnt),0), fill(ALL(ret),-1);
for(ll i=output.size()-1;i>=0;i--){
ll tmp=lmsidx[output[i]];
ret[lr[t[tmp]].se - cnt[t[tmp]]]=tmp;
cnt[t[tmp]]++;
}
fill(ALL(cnt),0);
for(ll i=0;i<sz;i++){
if(ret[i]>=1&&ls[ret[i]-1]){
ret[lr[t[ret[i]-1]].fi+cnt[t[ret[i]-1]]]=ret[i]-1;
cnt[t[ret[i]-1]]++;
if(i!=0&&!ls[ret[i]])ret[i]=-1;
}
}
fill(ALL(cnt),0);
for(ll i=sz-1;i>=1;i--){
if(ret[i]>=1&&!ls[ret[i]-1]){
ret[lr[t[ret[i]-1]].se-cnt[t[ret[i]-1]]]=ret[i]-1;
cnt[t[ret[i]-1]]++;
}
}
return ret;
}
ll operator[](ll x) const {
return data[x];
}
ll lower_bound(string x){
ll le=-1,ri=str.size();
while(ri-le>=2){
ll mid=(le+ri)/2;
ll cnt=0;
while(cnt<x.size()&&data[mid]+cnt<str.size()
&&x[cnt]==str[data[mid]+cnt])cnt++;
if(cnt==x.size())ri=mid;
else if(data[mid]+cnt==str.size())le=mid;
else if(x[cnt]<=str[data[mid]+cnt])ri=mid;
else le=mid;
}
return ri;
}
ll upper_bound(string x){
x.back()++;
return lower_bound(x);
}
vector<ll> lcp(){
vector<ll>ret(size);
for(ll i=0,h=0;i<size;i++){
if(rank[i]==0)continue;
for(ll j=data[rank[i]-1];max(i,j)+h<size&&str[i+h]==str[j+h];h++);
ret[rank[i]-1] = h;
if(h>0) h--;
}
return ret;
}
};
string get(int n){
// https://contest.ucup.ac/submission/297206
if (n == 1) {
return "1";
}
if (n == 2) {
return "01";
}
if (n == 3) {
return "010";
}
int k = 0;
while ((1 << k) + k - 1 <= n) {
k += 1;
}
k -= 1;
int mx = (1 << k) - 1;
map<int, bool> was;
vector<int> order;
function<void(int)> Dfs = [&](int x) {
x = (x & mx);
if (was[x]) {
return;
}
was[x] = true;
order.push_back(x);
Dfs(x << 1 | 1);
Dfs(x << 1);
};
Dfs(0);
string ret;
if (n == (1 << k) + k - 1) {
for (int i = 0; i + 1 < k; i++) {
ret+="0";
}
for (int i : order) {
ret+=(i % 2) + '0';
}
return ret;
}
int sz = (int) order.size();
for (int i = 0; i < sz; i++) {
order[i] = order[i] * 2;
if (i + 1 < sz) {
order[i] |= (order[i + 1] % 2);
}
}
map<int, int> go;
for (int i = 0; i < sz; i++) {
go[order[i]] = order[(i + 1) % sz];
}
for (int i = 0; i < (1 << (k + 1)); i++) {
if (!go.count(i)) {
go[i] = go[i ^ (1 << k)] ^ 1;
}
}
Dfs = [&](int x) {
if (was[x]) {
return;
}
was[x] = true;
order.push_back(x);
Dfs(go[x]);
};
was.clear();
for (int i : order) {
was[i] = true;
}
for (int i = 1; i < (1 << (k + 1)); i++) {
if (was[i]) {
continue;
}
Dfs(i);
swap(go[i], go[i ^ (1 << k)]);
if (n <= (int) order.size() + k) {
int f = go[i];
for (int b = k; b > 0; b--) {
ret += (f >> b & 1) + '0';
}
for (int i = 0; i < n - k; i++) {
ret += (f % 2) + '0';
f = go[f];
}
return ret;
}
}
return ret;
}
void solve(){
ll res=0,buf=0;
bool judge = true;
ll n;cin>>n;
string s= get(n);
cout<<s<<endl;
SuffixArray sa(s);
auto lcp = sa.lcp();
OUT(acc(lcp));
}
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
ll res=0,buf=0;
bool judge = true;
int T = 1;
cin>>T;
while(T--){
solve();
}
return 0;
}