#886533 (C++17) No.2345 max(l,r)

提出ソース

結果

問題	No.2345 max(l,r)
ユーザー	sigma425
提出日時	2023-07-01 12:01:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	307 ms / 2,000 ms
コード長	6,014 bytes
コンパイル時間	2,245 ms
コンパイル使用メモリ	205,860 KB
実行使用メモリ	6,400 KB
最終ジャッジ日時	2024-07-07 22:32:46
合計ジャッジ時間	8,018 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 5,632 KB
testcase_01	AC	66 ms 5,632 KB
testcase_02	AC	48 ms 5,632 KB
testcase_03	AC	48 ms 5,632 KB
testcase_04	AC	48 ms 5,632 KB
testcase_05	AC	48 ms 5,504 KB
testcase_06	AC	47 ms 5,632 KB
testcase_07	AC	49 ms 5,632 KB
testcase_08	AC	47 ms 5,632 KB
testcase_09	AC	47 ms 5,632 KB
testcase_10	AC	50 ms 5,632 KB
testcase_11	AC	47 ms 5,632 KB
testcase_12	AC	47 ms 5,632 KB
testcase_13	AC	46 ms 5,504 KB
testcase_14	AC	46 ms 5,632 KB
testcase_15	AC	49 ms 5,504 KB
testcase_16	AC	48 ms 5,504 KB
testcase_17	AC	48 ms 5,632 KB
testcase_18	AC	48 ms 5,632 KB
testcase_19	AC	49 ms 5,632 KB
testcase_20	AC	49 ms 5,632 KB
testcase_21	AC	47 ms 5,632 KB
testcase_22	AC	19 ms 6,144 KB
testcase_23	AC	19 ms 6,144 KB
testcase_24	AC	10 ms 5,632 KB
testcase_25	AC	13 ms 5,632 KB
testcase_26	AC	14 ms 5,632 KB
testcase_27	AC	13 ms 5,504 KB
testcase_28	AC	12 ms 6,016 KB
testcase_29	AC	17 ms 6,016 KB
testcase_30	AC	9 ms 5,760 KB
testcase_31	AC	23 ms 6,272 KB
testcase_32	AC	12 ms 5,888 KB
testcase_33	AC	15 ms 5,888 KB
testcase_34	AC	6 ms 5,760 KB
testcase_35	AC	8 ms 5,760 KB
testcase_36	AC	11 ms 5,760 KB
testcase_37	AC	13 ms 5,888 KB
testcase_38	AC	25 ms 6,272 KB
testcase_39	AC	25 ms 6,272 KB
testcase_40	AC	25 ms 6,400 KB
testcase_41	AC	24 ms 6,272 KB
testcase_42	AC	25 ms 6,400 KB
testcase_43	AC	24 ms 6,272 KB
testcase_44	AC	24 ms 6,272 KB
testcase_45	AC	25 ms 6,272 KB
testcase_46	AC	25 ms 6,272 KB
testcase_47	AC	24 ms 6,272 KB
testcase_48	AC	13 ms 5,504 KB
testcase_49	AC	13 ms 5,632 KB
testcase_50	AC	13 ms 5,760 KB
testcase_51	AC	13 ms 5,632 KB
testcase_52	AC	13 ms 5,632 KB
testcase_53	AC	11 ms 5,632 KB
testcase_54	AC	14 ms 5,632 KB
testcase_55	AC	13 ms 5,504 KB
testcase_56	AC	15 ms 5,632 KB
testcase_57	AC	13 ms 5,632 KB
testcase_58	AC	21 ms 5,632 KB
testcase_59	AC	21 ms 5,632 KB
testcase_60	AC	21 ms 5,504 KB
testcase_61	AC	22 ms 5,632 KB
testcase_62	AC	21 ms 5,632 KB
testcase_63	AC	21 ms 5,632 KB
testcase_64	AC	20 ms 5,632 KB
testcase_65	AC	21 ms 5,632 KB
testcase_66	AC	21 ms 5,504 KB
testcase_67	AC	22 ms 5,760 KB
testcase_68	AC	307 ms 5,632 KB

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

ソースコード

raw source code

#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<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];
}

mint solve(){
	int N,M; cin >> N >> M;
	V<int> cnt(N);
	rep(i,N){
		int a; cin >> a; cnt[a]++;
	}
	if(cnt[0] == N) return M;
	mint way = 1; int con = 0;
	int l=0,r=0;
	per(i,N) if(cnt[i]){
		int dl = (N-i)-l;
		int dr = (N-i)-r;
		if(dl <= 0) dl = -1000000;
		if(dr <= 0) dr = -1000000;
		show("-------------");
		show(i);show(l);show(r);show(dl);show(dr);
		if(dl == cnt[i]){
			if(max(l,N-l-dl) != i) return 0;
			if(l == r && (l+r+dl != N)) way *= 2;
			l += dl; con++;
		}else if(dr == cnt[i]){
			if(max(r,N-r-dr) != i) return 0;
			r += dr; con++;
		}else if(dl + dr == cnt[i]){
			if(max(l,N-l-dl) != i) return 0;
			if(max(r,N-r-dr) != i) return 0;
			l += dl, r += dr; con+=2;
			way *= Choose(cnt[i],dl);
		}else{
			return 0;
		}
	}
	show(way); show(con);
	return way * Choose(M,con);
}

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

	int T; cin >> T;
	while(T--) cout << solve() << endl;
}

yukicoder

結果

テストケース

ソースコード