#607331 (C++14) No.1348 Split Tile

• 問題: No.1348 Split Tile
• ユーザー: kotatsugame
• 提出日時: 2021-01-19 11:35:54
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 41 ms / 2,000 ms
• コード長: 2,594 bytes
• コンパイル時間: 626 ms
• コンパイル使用メモリ: 66,748 KB
• 実行使用メモリ: 11,716 KB
• 最終ジャッジ日時: 2023-08-22 09:00:44
• 合計ジャッジ時間: 2,397 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,504 KB
testcase_01	AC	2 ms; 5,412 KB
testcase_02	AC	4 ms; 5,656 KB
testcase_03	AC	37 ms; 11,524 KB
testcase_04	AC	28 ms; 11,588 KB
testcase_05	AC	9 ms; 6,160 KB
testcase_06	AC	5 ms; 5,740 KB
testcase_07	AC	40 ms; 11,560 KB
testcase_08	AC	29 ms; 11,524 KB
testcase_09	AC	26 ms; 11,580 KB
testcase_10	AC	37 ms; 11,716 KB
testcase_11	AC	6 ms; 6,036 KB
testcase_12	AC	21 ms; 7,312 KB
testcase_13	AC	30 ms; 11,584 KB
testcase_14	AC	22 ms; 7,440 KB
testcase_15	AC	33 ms; 11,640 KB
testcase_16	AC	20 ms; 7,232 KB
testcase_17	AC	12 ms; 6,384 KB
testcase_18	AC	28 ms; 11,536 KB
testcase_19	AC	18 ms; 7,172 KB
testcase_20	AC	19 ms; 7,208 KB
testcase_21	AC	16 ms; 7,000 KB
testcase_22	AC	37 ms; 11,540 KB
testcase_23	AC	39 ms; 11,584 KB
testcase_24	AC	37 ms; 11,528 KB
testcase_25	AC	40 ms; 11,620 KB
testcase_26	AC	38 ms; 11,576 KB
testcase_27	AC	41 ms; 11,644 KB

コンパイルメッセージ

a.cpp:8:1: 警告: ISO C++ では型の無い ‘main’ の宣言を禁止しています [-Wreturn-type]

ソースコード

#line 1 "a.cpp"
#include<iostream>
using namespace std;
#line 3 "/home/kotatsugame/library/math/modint.cpp"
#include<utility>
template<int m>
struct modint{
	unsigned int x;
	constexpr modint()noexcept:x(){}
	template<typename T>
	constexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}
	constexpr unsigned int val()const noexcept{return x;}
	constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}
	constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}
	constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}
	constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}
	constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}
	constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}
	constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}
	constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}
	constexpr modint operator+()const noexcept{return*this;}
	constexpr modint operator-()const noexcept{return modint()-*this;}
	constexpr modint pow(long long n)const noexcept
	{
		if(n<0)return pow(-n).inv();
		modint x=*this,r=1;
		for(;n;x*=x,n>>=1)if(n&1)r*=x;
		return r;
	}
	constexpr modint inv()const noexcept
	{
		int s=x,t=m,x=1,u=0;
		while(t)
		{
			int k=s/t;
			s-=k*t;
			swap(s,t);
			x-=k*u;
			swap(x,u);
		}
		return modint(x);
	}
	friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
	friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
	friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
	friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
	friend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}
	friend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}
	friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}
	friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}
};
#line 4 "a.cpp"
using mint=modint<998244353>;
int N;
mint fac[1<<20],inv[1<<20];
mint C(int a,int b){return fac[a]*inv[b]*inv[a-b];}
main()
{
	cin>>N;
	fac[0]=1;
	for(int i=1;i<=N;i++)fac[i]=fac[i-1]*i;
	inv[N]=1/fac[N];
	for(int i=N;i--;)inv[i]=inv[i+1]*(i+1);
	mint ans=fac[N]*N;
	for(int i=0;i<N;i++)
	{
		mint t=fac[N-i-1]*(N-i);
		if(i>=1)ans-=C(N-2,i-1)*fac[i]*2*t;
		if(N-3>=i)ans+=C(N-3,i)*fac[i]*(N-2)*t;
		if(i>=2)ans-=C(N-3,i-2)*fac[i]*(N-2)*t;
	}
	cout<<ans<<endl;
}