#937715 (C++17) No.2575 Almost Increasing Sequence

提出ソース

結果

問題	No.2575 Almost Increasing Sequence
ユーザー	sigma425
提出日時	2023-12-10 02:39:00
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	8,766 ms / 10,000 ms
コード長	6,932 bytes
コンパイル時間	2,299 ms
コンパイル使用メモリ	213,632 KB
実行使用メモリ	6,676 KB
スコア	500,000
最終ジャッジ日時	2023-12-10 02:42:09
合計ジャッジ時間	187,277 ms
ジャッジサーバーID （参考情報）	judge14 / judge12
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8,739 ms 6,676 KB
testcase_01	AC	8,766 ms 6,676 KB
testcase_02	AC	8,748 ms 6,676 KB
testcase_03	AC	8,717 ms 6,676 KB
testcase_04	AC	8,693 ms 6,676 KB
testcase_05	AC	8,666 ms 6,676 KB
testcase_06	AC	8,679 ms 6,676 KB
testcase_07	AC	8,663 ms 6,676 KB
testcase_08	AC	8,693 ms 6,676 KB
testcase_09	AC	8,677 ms 6,676 KB
testcase_10	AC	8,667 ms 6,676 KB
testcase_11	AC	8,702 ms 6,676 KB
testcase_12	AC	8,682 ms 6,676 KB
testcase_13	AC	8,677 ms 6,676 KB
testcase_14	AC	8,689 ms 6,676 KB
testcase_15	AC	8,667 ms 6,676 KB
testcase_16	AC	8,676 ms 6,676 KB
testcase_17	AC	8,676 ms 6,676 KB
testcase_18	AC	8,676 ms 6,676 KB
testcase_19	AC	8,668 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// #pragma GCC target("avx,avx2")
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
template<class T>
T rnd(T l,T r){	//[l,r)
	using D = uniform_int_distribution<T>;
	static random_device rd;
	static mt19937 gen(rd());
	return D(l,r-1)(gen);
}
template<class T>
T rnd(T n){	//[0,n)
	return rnd(T(0),n);
}

template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	template<class T> friend ModInt operator+(T a, const ModInt& b){ return (ModInt(a) += b);}
	template<class T> friend ModInt operator-(T a, const ModInt& b){ return (ModInt(a) -= b);}
	template<class T> friend ModInt operator*(T a, const ModInt& b){ return (ModInt(a) *= b);}
	template<class T> friend ModInt operator/(T a, const ModInt& b){ return (ModInt(a) /= b);}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	ModInt inv() const {		// should be prime
		return pow(mod-2);
	}
	// ll extgcd(ll a,ll b,ll &x,ll &y) const{
	// 	ll p[]={a,1,0},q[]={b,0,1};
	// 	while(*q){
	// 		ll t=*p/ *q;
	// 		rep(i,3) swap(p[i]-=t*q[i],q[i]);
	// 	}
	// 	if(p[0]<0) rep(i,3) p[i]=-p[i];
	// 	x=p[1],y=p[2];
	// 	return p[0];
	// }
	// ModInt inv() const {
	// 	ll x,y;
	// 	extgcd(v,mod,x,y);
	// 	return make(normS(x+mod));
	// }

	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	bool operator<(const ModInt& b) const { return v<b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;
//using mint = ModInt<1000000007>;

V<mint> fact,ifact,invs;
mint Choose(int a,int b){
	if(b<0 || a<b) return 0;
	return fact[a] * ifact[b] * ifact[a-b];
}
void InitFact(int N){	//[0,N]
	N++;
	fact.resize(N);
	ifact.resize(N);
	invs.resize(N);
	fact[0] = 1;
	rep1(i,N-1) fact[i] = fact[i-1] * i;
	ifact[N-1] = fact[N-1].inv();
	for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
	rep1(i,N-1) invs[i] = fact[i-1] * ifact[i];
}
V<mint> brute(int N, int K){
	V<mint> res(N+1);
	V<mint> pK(N+1); rep(i,N+1) pK[i] = mint(i).pow(K);
	rep1(a,N) rep1(b,min(a,N-a)) rep1(c,min(b,N-a-b)){
		mint hook = mint(b-c+1)*(a-b+1)*(a-c+2) * ifact[c]*ifact[b+1]*ifact[a+2];
		res[a+b+c] += pK[a] * hook*hook;
	}
	rep1(i,N) res[i] *= fact[i]*fact[i];
	return res;
}
V<mint> solve(int N, int K){
	/*
		a' = a+2, b' = b+1, c' = c
		for a'>b'>c'>0:
			res[a'+b'+c'-3] += (a'-2)^K * ( (b'-c')(a'-b')(a'-c')/a'!b'!c'! )^2
	*/
	V<mint> res(N+1);
	V<mint> pK(N+5); rep(i,N+5) pK[i] = mint(i).pow(K);
	VV<mint> ai(5,V<mint>(N+5));
	for(int a=3;a<=N+2;a++){
		for(int bc=3;bc<=min(N+3-a,a+a-3);bc++){
			ll b = a-1, c = bc-b;
			if(b > c && c > 0){
				shows("add: ",a,b,c);
				mint com = ifact[b]*ifact[b]*ifact[c]*ifact[c]*(b-c)*(b-c);
				ai[4][bc] += com;
				ai[3][bc] += com * (-b-b-c-c);
				ai[2][bc] += com * (b*b+4*b*c+c*c);
				ai[1][bc] += com * (-2*b*c*(b+c));
				ai[0][bc] += com * (b*b*c*c);
			}
			mint com = pK[a-2] * ifact[a]*ifact[a];
			res[a+bc-3] += com * ai[4][bc] * a*a*a*a;
			res[a+bc-3] += com * ai[3][bc] * a*a*a;
			res[a+bc-3] += com * ai[2][bc] * a*a;
			res[a+bc-3] += com * ai[1][bc] * a;
			res[a+bc-3] += com * ai[0][bc];
		}
	}
	rep1(i,N) res[i] *= fact[i]*fact[i];
	return res;
}

void TEST(){
	int N; cin >> N;
	cout << si(solve(N,TEN(9))) << endl;
	exit(0);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);
	InitFact(100000);

	// TEST();

	int N = 25000; int K; cin >> K;
	auto f = solve(N,K);
	cout << N << endl;
	rep1(i,N) cout << f[i] << (i==N ? '\n' : ' ');
}

yukicoder

結果

テストケース

ソースコード