結果
| 問題 | No.3404 形式群法則 |
| コンテスト | |
| ユーザー |
 Taiki0715
|
| 提出日時 | 2026-10-08 16:21:55 |
| 言語 | C++23 (gcc 15.3.0 + boost 1.92.0 + ACL) |
| 結果 |
TLE
不安定
|
| 実行時間 | - |
| コード長 | 16,408 bytes |
| 記録 | |
| コンパイル時間 | 3,207 ms |
| コンパイル使用メモリ | 354,972 KB |
| 実行使用メモリ | 9,932 KB |
| 最終ジャッジ日時 | 2026-10-08 16:22:07 |
| 合計ジャッジ時間 | 9,402 ms |
|
ジャッジサーバーID （参考情報） |
judge2_1 / judge4_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 20 TLE * 1 -- * 4 |
ソースコード
#include<cassert>
#include <bits/stdc++.h>
#ifndef IO_HPP
#define IO_HPP
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<array>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
using namespace std;
template<typename T1,typename T2>istream &operator>>(istream&,pair<T1,T2>&);
template<typename...Args>istream &operator>>(istream&,tuple<Args...>&a);
template<typename T>istream &operator>>(istream&is,vector<T>&a);
template<typename T,size_t N>istream &operator>>(istream&is,array<T,N>&a);
template<typename T1,typename T2>
istream &operator>>(istream&is,pair<T1,T2>&a){
is>>a.first>>a.second;
return is;
}
template<size_t pos,typename...Args>
void read_tuple(istream&is,tuple<Args...>&a){
if constexpr(pos<tuple_size<tuple<Args...>>::value){
is>>get<pos>(a);
read_tuple<pos+1>(is,a);
}
}
template<typename...Args>
istream &operator>>(istream&is,tuple<Args...>&a){
read_tuple<0>(is,a);
return is;
}
template<typename T>
istream &operator>>(istream&is,vector<T>&a){
for(T&x:a)is>>x;
return is;
}
template<typename T,size_t N>
istream &operator>>(istream&is,array<T,N>&a){
for(T&x:a)is>>x;
return is;
}
template<typename T1,typename T2>ostream &operator<<(ostream&os,const pair<T1,T2>&);
template<typename...Args>ostream &operator<<(ostream&os,const tuple<Args...>&);
template<typename T>ostream &operator<<(ostream&os,const vector<T>&);
template<typename T,typename Seq,typename Comp>ostream &operator<<(ostream&os,priority_queue<T,Seq,Comp>);
template<typename T>ostream &operator<<(ostream&os,queue<T>);
template<typename T>ostream &operator<<(ostream&os,deque<T>);
template<typename T>ostream &operator<<(ostream&os,stack<T>);
template<typename T,size_t N>ostream &operator<<(ostream&os,const array<T,N>&);
template<typename Key,typename Val,typename Comp>ostream &operator<<(ostream&os,const map<Key,Val,Comp>&);
template<typename Key,typename Val,typename Hash>ostream &operator<<(ostream&os,const unordered_map<Key,Val,Hash>&);
template<typename T,typename Comp>ostream &operator<<(ostream&os,const set<T,Comp>&);
template<typename T,typename Comp>ostream &operator<<(ostream&os,const multiset<T,Comp>&);
template<typename T,typename Hash>ostream &operator<<(ostream&os,const unordered_set<T,Hash>&);
template<typename T1,typename T2>
ostream &operator<<(ostream&os,const pair<T1,T2>&a){
os<<a.first<<' '<<a.second;
return os;
}
template<size_t pos,typename...Args>
void write_tuple(ostream&os,const tuple<Args...>&a){
if constexpr(pos<tuple_size<tuple<Args...>>::value){
if constexpr(pos>0)os<<' ';
os<<get<pos>(a);
write_tuple<pos+1>(os,a);
}
}
template<typename...Args>
ostream &operator<<(ostream&os,const tuple<Args...>&a){
write_tuple<0>(os,a);
return os;
}
template<typename T>
ostream &operator<<(ostream&os,const vector<T>&a){
os<<'{';
for(int i=0;i<(int)a.size();i++){
os<<a[i];
if(i+1!=a.size())os<<',';
}
os<<'}';
return os;
}
template<typename T,typename Seq,typename Comp>
ostream &operator<<(ostream&os,priority_queue<T,Seq,Comp>a){
os<<'{';
if(!a.empty()){
os<<a.top();a.pop();
while(!a.empty()){
os<<',';
os<<a.top();
a.pop();
}
}
os<<'}';
return os;
}
template<typename T>
ostream &operator<<(ostream&os,queue<T>a){
os<<'{';
if(!a.empty()){
os<<a.front();a.pop();
while(!a.empty()){
os<<',';
os<<a.front();
a.pop();
}
}
os<<'}';
return os;
}
template<typename T>
ostream &operator<<(ostream&os,deque<T>a){
os<<'{';
if(!a.empty()){
os<<a.front();a.pop_front();
while(!a.empty()){
os<<',';
os<<a.front();
a.pop_front();
}
}
os<<'}';
return os;
}
template<typename T>
ostream &operator<<(ostream&os,stack<T>a){
os<<'{';
if(!a.empty()){
os<<a.top();a.pop();
while(!a.empty()){
os<<',';
os<<a.top();
a.pop();
}
}
os<<'}';
return os;
}
template<typename T,size_t N>
ostream &operator<<(ostream&os,const array<T,N>&a){
os<<'{';
for(int i=0;i<(int)a.size();i++){
os<<a[i];
if(i+1!=a.size())os<<',';
}
os<<'}';
return os;
}
template<typename Key,typename Val,typename Comp>
ostream &operator<<(ostream&os,const map<Key,Val,Comp>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<"{["<<itr->first<<","<<itr->second<<']';
while(++itr!=a.end())os<<",["<<itr->first<<','<<itr->second<<']';
os<<'}';
return os;
}
template<typename Key,typename Val,typename Hash>
ostream &operator<<(ostream&os,const unordered_map<Key,Val,Hash>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<"{["<<itr->first<<","<<itr->second<<']';
while(++itr!=a.end())os<<",["<<itr->first<<','<<itr->second<<']';
os<<'}';
return os;
}
template<typename T,typename Comp>
ostream &operator<<(ostream&os,const set<T,Comp>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<'{'<<*itr;
while(++itr!=a.end())os<<','<<*itr;
os<<'}';
return os;
}
template<typename T,typename Comp>
ostream &operator<<(ostream&os,const multiset<T,Comp>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<'{'<<*itr;
while(++itr!=a.end())os<<','<<*itr;
os<<'}';
return os;
}
template<typename T,typename Hash>
ostream &operator<<(ostream&os,const unordered_set<T,Hash>&a){
if(a.empty()){
os<<"{}";
return os;
}
auto itr=a.begin();
os<<'{'<<*itr;
while(++itr!=a.end())os<<','<<*itr;
os<<'}';
return os;
}
#endif
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int){for(auto &i:a)i--;}
using vref=typename vector<bool>::reference;
vref operator|=(vref a,bool b){a=a|b;return a;}
vref operator&=(vref a,bool b){a=a&b;return a;}
vref operator^=(vref a,bool b){a=a^b;return a;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
#endif
struct Timer{
clock_t start;
Timer(){
start=clock();
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(16);
}
inline double now(){return (double)(clock()-start)/1000;}
#ifdef LOCAL
~Timer(){
cerr<<"time:";
cerr<<now();
cerr<<"ms\n";
}
#endif
}timer;
void SOLVE();
int main(){
int testcase=1;
//cin>>testcase;
for(int i=0;i<testcase;i++){
SOLVE();
}
}
#include<type_traits>
#include<optional>
#include<variant>
struct BarrettReduction{
private:
using i64=long long;
using u64=unsigned long long;
using u32=unsigned int;
using u128=__uint128_t;
u32 m;
u64 im;
public:
BarrettReduction():m(0),im(0){}
BarrettReduction(u32 n):m(n),im(u64(-1)/n+1){}
inline i64 quo(u64 x)const{
if(m==1)return x;
u64 y=u64((u128(x)*im)>>64);
u32 r=x-y*m;
return m<=r?y-1:y;
}
inline u32 rem(u64 x)const{
if(m==1)return 0;
u64 y=u64((u128(x)*im)>>64);
u32 r=x-y*m;
return m<=r?r+m:r;
}
inline std::pair<u64,u32>quo_rem(u64 x)const{
if(m==0)return std::make_pair(x,0);
u64 y=u64((u128(x)*im)>>64);
u32 r=x-y*m;
return m<=r?std::make_pair(y-1,r+m):std::make_pair(y,r);
}
inline u32 pow(u32 a,u64 p)const{
u32 res=m!=1;
while(p){
if(p&1)res=rem(u64(res)*a);
a=rem(u64(a)*a);
p>>=1;
}
return res;
}
};
constexpr std::pair<long long,long long>ext_gcd(long long a,long long b){
if(b==0)return std::make_pair(1,0);
auto [x,y]=ext_gcd(b,a%b);
std::swap(x,y);
return std::make_pair(x,y-a/b*x);
}
template<std::signed_integral T>
constexpr std::pair<T,T> inv_mod(T a,T b){
a%=b;
if(a<0)a+=b;
if(a==0)return std::make_pair(b,0);
T s=b,t=a;
T m0=0,m1=1;
while(t){
T u=s/t;
s-=t*u;
m0-=m1*u;
std::swap(s,t);
std::swap(m0,m1);
}
if(m0<0)m0+=b/s;
return std::make_pair(s,m0);
}
template<typename T,int id>
struct arbitrary_modint{
using value_type=std::make_unsigned_t<T>;
using mul_type=std::conditional_t<(std::numeric_limits<T>::digits<=32),uint64_t,__uint128_t>;
private:
using mint=arbitrary_modint;
value_type v;
static value_type umod;
static std::conditional_t<(std::numeric_limits<T>::digits<=32),BarrettReduction,std::monostate>br;
mint sqrt_impl()const{
if(this->val()<=1)return *this;
if(umod%8==1){
mint b=2;
while(b.pow((umod-1)/2).val()==1)b++;
value_type m2=umod-1;
int e=0;
while(m2%2==0)m2>>=1,e++;
mint x=this->pow((m2-1)/2);
mint y=(*this)*x*x;
x*=*this;
mint z=b.pow(m2);
while(y.val()!=1){
int j=0;
mint t=y;
while(t.val()!=1)t*=t,j++;
z=z.pow((value_type(1))<<(e-j-1));
x*=z;
z*=z;
y*=z;
e=j;
}
return x;
}
else if(umod%8==5){
mint res=this->pow((umod+3)/8);
if((res*res).val()==this->val())return res;
else return res*mint(2).pow((umod-1)/4);
}
else return this->pow((umod+1)/4);
}
public:
arbitrary_modint():v(0){}
template<typename U,std::enable_if_t<std::signed_integral<U>||std::is_same_v<U,__int128_t>,std::nullptr_t> =nullptr>
arbitrary_modint(U x){
x%=std::make_signed_t<value_type>(umod);
v=x>=0?x:x+umod;
}
template<typename U,std::enable_if_t<std::unsigned_integral<U>||std::is_same_v<U,__uint128_t>,std::nullptr_t> =nullptr>
arbitrary_modint(U x):v(x%umod){}
static void set_mod(T m){
assert(1<=m);
umod=m;
if constexpr(std::numeric_limits<T>::digits<=32)br=BarrettReduction(umod);
}
static void read_mod(){
std::cin>>umod;
if constexpr(std::numeric_limits<T>::digits<=32)br=BarrettReduction(umod);
}
static T mod(){return umod;}
static mint raw(T x){
mint res;
res.v=x;
return res;
}
inline T val()const{return v;}
inline mint &operator+=(const mint&b){
this->v+=b.v;
if(this->v>=umod)this->v-=umod;
return *this;
}
inline mint &operator-=(const mint&b){
this->v-=b.v;
if(this->v>=umod)this->v+=umod;
return *this;
}
inline mint &operator*=(const mint&b){
mul_type v=mul_type(this->v)*mul_type(b.v);
if constexpr(std::numeric_limits<T>::digits<=32)this->v=br.rem(v);
else this->v=v%umod;
return *this;
}
inline mint &operator/=(const mint&b){return *this*=b.inv();}
inline mint operator+()const{return *this;}
inline mint operator-()const{return mint()-*this;}
friend inline mint operator+(const mint&a,const mint&b){return mint(a)+=b;}
friend inline mint operator-(const mint&a,const mint&b){return mint(a)-=b;}
friend inline mint operator*(const mint&a,const mint&b){return mint(a)*=b;}
friend inline mint operator/(const mint&a,const mint&b){return mint(a)/=b;}
auto operator<=>(const mint&)const=default;
inline mint operator++(int){
mint res=*this;
this->v++;
if(this->v==umod)this->v=0;
return res;
}
inline mint operator--(int){
mint res=*this;
if(this->v==0)this->v=umod;
this->v--;
return res;
}
template<std::integral U>
mint pow(U k)const{
if constexpr(std::is_signed_v<U>){
assert(0<=k);
}
mint res=1,a(*this);
while(k){
if(k&1)res*=a;
a*=a;
k>>=1;
}
return res;
}
mint inv()const{
mint res;
auto [g,x]=inv_mod<std::make_signed_t<value_type>>(this->v,umod);
assert(g==1);
res.v=x;
return res;
}
std::optional<mint>sqrt()const{
if(this->val()<=1||this->pow((umod-1)/2)==1)return std::make_optional(this->sqrt_impl());
else return std::nullopt;
}
friend std::istream &operator>>(std::istream&is,mint&b){
long long a;
is>>a;
b=mint(a);
return is;
}
friend std::ostream &operator<<(std::ostream&os,const mint&b){
os<<b.val();
return os;
}
};
template<typename T,int id>typename arbitrary_modint<T,id>::value_type arbitrary_modint<T,id>::umod=2;
template<typename T,int id>std::conditional_t<(std::numeric_limits<T>::digits<=32),BarrettReduction,std::monostate>arbitrary_modint<T,id>::br;
template<typename T,int id>
struct std::hash<arbitrary_modint<T,id>>{
std::size_t operator()(arbitrary_modint<T,id>x)const{
return std::hash<unsigned int>()(x.val());
}
};
#include<concepts>
template<typename T>
constexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>msb(T n){return n==0?-1:31-__builtin_clz(n);}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>msb(T n){return n==0?-1:63-__builtin_clzll(n);}
template<typename T>
constexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>lsb(T n){return n==0?-1:__builtin_ctz(n);}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>lsb(T n){return n==0?-1:__builtin_ctzll(n);}
template<typename T>
constexpr std::enable_if_t<std::is_integral_v<T>,T>floor_pow2(T n){return n==0?0:T(1)<<msb(n);}
template<typename T>
constexpr std::enable_if_t<std::is_integral_v<T>,T>ceil_pow2(T n){return n<=1?1:T(1)<<(msb(n-1)+1);}
template<std::integral T>
constexpr T safe_div(T a,T b){return a/b-(a%b&&(a^b)<0);}
template<std::integral T>
constexpr T safe_ceil(T a,T b){return a/b+(a%b&&(a^b)>0);}
template<typename T,typename U,typename Func>
T semigroup_pow(T a,U k,const Func&f){
static_assert(std::is_convertible_v<Func,std::function<T(T,T)>>);
assert(k>0);
if(k<=8){
if(k==1)return a;
else if(k==2)return f(a,a);
else if(k==3)return f(a,f(a,a));
else if(k==4){
a=f(a,a);
return f(a,a);
}
else if(k==5){
T a2=f(a,a);
return f(a,f(a2,a2));
}
else if(k==6){
a=f(a,f(a,a));
return f(a,a);
}
else if(k==7){
T a3=f(a,f(a,a));
return f(a,f(a3,a3));
}
else{
a=f(a,a);
a=f(a,a);
return f(a,a);
}
}
int m=msb(k)/3;
T a2=f(a,a);
T a3=f(a,a2);
T a5=f(a2,a3);
T a7=f(a2,a5);
T res=[&]()->T {
switch(k>>(m*3)&7){
case 1:return a;
case 2:return a2;
case 3:return a3;
case 4:return f(a2,a2);
case 5:return a5;
case 6:return f(a3,a3);
case 7:return a7;
}
__builtin_unreachable();
}();
while(m--){
int x=k>>(m*3)&7;
if(x==4){
res=f(res,res);
res=f(res,a);
res=f(res,res);
res=f(res,res);
}
else if(x==6){
res=f(res,res);
res=f(res,res);
res=f(res,a3);
res=f(res,res);
}
else{
res=f(res,res);
res=f(res,res);
res=f(res,res);
if(x==1)res=f(res,a);
else if(x==2)res=f(res,a2);
else if(x==3)res=f(res,a3);
else if(x==5)res=f(res,a5);
else if(x==7)res=f(res,a7);
}
}
return res;
}
using mint=arbitrary_modint<int,1>;
void SOLVE(){
int n;
ll m;
cin>>n>>m;
mint::read_mod();
vector<mint>a(n+1);
rep(i,1,n+1)cin>>a[i];
a=semigroup_pow(a,m,[&](vector<mint>a,vector<mint>b){
vector<mint>c(n+1);
rep(i,1,n+1){
c[i]=a[i]+b[i];
rep(j,1,i+1)rep(k,1,i+1)if(j+k<i)c[i]+=a[j]*b[k]*c[i-j-k];
}
return c;
});
rep(i,1,n+1)cout<<a[i]<<" \n"[i==n];
}