// Question(job618): does arithmetic gap order lower the prescribed Charlier energy beyond the gap multiset? #include #include #include #include #include #include #include struct Tile{uint64_t W=1,D=1,first=0;std::vectorg;}; Tile build(int x){Tile t;std::vectorps={2,3,5,7,11,13,17,19,23,29};for(int p:ps)if(p<=x){t.W*=p;if(p>2)t.D*=p-2;}t.g.reserve(t.D); std::vectorrs;for(int r=0;r<210;++r)if(std::gcd(r,210)==1&&std::gcd(r+2,210)==1)rs.push_back(r); struct Mark{int q,i,start;};std::vectormarks;for(int q:ps)if(q>7&&q<=x){int inv=1;while(210*inv%q!=1)++inv;for(int i=0;i<15;++i)for(int h:{0,2})marks.push_back({q,i,((q-(rs[i]+h)%q)*inv)%q});} const uint64_t B=65536,M=t.W/210;uint64_t prev=0,N=0; auto gap=[&](uint64_t d){if(d%6||d/6>255)throw std::runtime_error("gap storage");t.g.push_back(d/6);}; for(uint64_t lo=0;lolive(15*(hi-lo),1); for(auto m:marks){uint64_t k=lo+(m.start+m.q-lo%m.q)%m.q;for(;k uint64_t bounded(std::mt19937_64&r,uint64_t n){uint64_t cut=(-n)%n,x;do{x=r();}while(x&g,int x,int rep){ uint64_t H=6*((uint64_t(x)*x*x+5)/6),M=t.W/6,D=t.D,h=H/6,position=0; if(h>=M)throw std::runtime_error("pilot H must be below period"); std::vectorb;b.reserve(D);for(auto a:g){position+=a;b.push_back(position);}if(position!=M)throw std::runtime_error("gap sum"); uint64_t split=std::upper_bound(b.begin(),b.end(),h)-b.begin(),count=split,oi=0,ii=0,prev=0;std::vectorhist(h+1); auto incoming=[&](uint64_t i)->uint64_t{if(i>=D)return M;uint64_t j=split+i;return jh)throw std::runtime_error("events");hist[count]+=6*(e-prev);if(e==M)break;if(out==e){if(!count)throw std::runtime_error("underflow");--count;++oi;}if(in==e){++count;++ii;}prev=e;} uint64_t mass=0,mean=0;for(uint64_t k=0;kexpected{};for(auto a:t.g)++expected[a]; for(int rep=0;rep<=127;++rep){std::vectorg=t.g;std::mt19937_64 rng(202609130000ULL+1000*x+rep);for(uint64_t i=g.size();i>1;--i)std::swap(g[i-1],g[bounded(rng,i)]);std::arraygot{};for(auto a:g)++got[a];if(got!=expected)throw std::runtime_error("multiset changed");histogram(t,g,x,rep);} std::cerr<<"finished level "<