結果

問題 No.2345 max(l,r)
ユーザー woodywoodywoodywoody
提出日時 2023-06-10 00:50:14
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,292 bytes
コンパイル時間 4,507 ms
コンパイル使用メモリ 232,636 KB
実行使用メモリ 84,640 KB
最終ジャッジ日時 2024-06-10 15:39:46
合計ジャッジ時間 16,139 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 111 ms
81,176 KB
testcase_01 AC 180 ms
81,300 KB
testcase_02 AC 160 ms
81,356 KB
testcase_03 AC 156 ms
81,300 KB
testcase_04 AC 157 ms
81,388 KB
testcase_05 AC 154 ms
81,420 KB
testcase_06 AC 152 ms
81,320 KB
testcase_07 AC 155 ms
81,328 KB
testcase_08 AC 157 ms
81,324 KB
testcase_09 AC 164 ms
81,436 KB
testcase_10 AC 164 ms
81,380 KB
testcase_11 AC 157 ms
81,360 KB
testcase_12 AC 152 ms
81,176 KB
testcase_13 AC 153 ms
81,372 KB
testcase_14 AC 155 ms
81,312 KB
testcase_15 AC 150 ms
81,404 KB
testcase_16 AC 152 ms
81,404 KB
testcase_17 AC 154 ms
81,408 KB
testcase_18 AC 156 ms
81,388 KB
testcase_19 AC 158 ms
81,384 KB
testcase_20 AC 160 ms
81,376 KB
testcase_21 AC 158 ms
81,400 KB
testcase_22 AC 127 ms
83,616 KB
testcase_23 AC 126 ms
83,596 KB
testcase_24 AC 112 ms
82,044 KB
testcase_25 AC 119 ms
81,388 KB
testcase_26 AC 120 ms
81,460 KB
testcase_27 AC 121 ms
81,416 KB
testcase_28 AC 119 ms
83,184 KB
testcase_29 AC 122 ms
83,264 KB
testcase_30 AC 115 ms
82,012 KB
testcase_31 AC 128 ms
84,260 KB
testcase_32 AC 119 ms
82,516 KB
testcase_33 AC 119 ms
83,000 KB
testcase_34 AC 111 ms
81,388 KB
testcase_35 AC 114 ms
82,164 KB
testcase_36 AC 117 ms
82,176 KB
testcase_37 AC 118 ms
82,568 KB
testcase_38 AC 128 ms
84,456 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 AC 130 ms
84,544 KB
testcase_42 AC 128 ms
84,640 KB
testcase_43 AC 129 ms
84,444 KB
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 AC 426 ms
81,316 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
	fact[0] = 1;
	for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
	ifact[n] = fact[n].inv();
	for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
	if (k < 0 || k > n) return 0;
	return fact[n]*ifact[k]*ifact[n-k];
  }
} com(10000005);

void solve(){
	int n,m; cin>>n>>m;
	vl a(n);
	rep(i,n) cin>>a[i];
	vl cnt(n);
	rep(i,n) cnt[a[i]]++;
	ll kind = 0;
	ll l = 0;
	ll r = 0;
	bool ok = true;
	ll res = n;

	mint ans = 1;
	bool ok2 = false;
	ll c = 0;

	rrep(i,n){
		if (cnt[i]==0) continue;
		res -= cnt[i];
		if (abs(cnt[i]+r-l)%2==1){
			kind++;
			if (max(r+res,l)==i){
				l += cnt[i];
				c++;
			}else if(max(r,l+res)==i){
				r += cnt[i];
				c++;
			}else{
				ok = false;
			}
			continue;	
		}
		if (max(r+res,l)==i){
			l += cnt[i];
			c++;
			kind++;
			continue;
		}else if(max(r,l+res)==i){
			r += cnt[i];
			c++;
			kind++;
			continue;
		}
		ll x = (cnt[i]+r-l)/2;
		ll y = (cnt[i]-r+l)/2;
		if (x==0||y==0){
			ok = false;
			continue;
		} 
		if (x < 0) ok = false;
		if (y < 0) ok = false;
		if (max(l,res+y+r)!=i) ok = false;
		if (max(r,res+x+l)!=i) ok = false;
		if (x) kind++;
		if (y) kind++;
		ans *= com(x+y,x);
		l += x;
		r += y;
		if (c) ok2 = true;
	}
	if (!ok) ans = 0;
	ans *= com(m,kind);
	if (c>=2) ok2 = true;
	if (ok2) ans *= 2;
	outm;


	return;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	cin>>t;

	rep(i,t){
		solve();
	}

	return 0;
}
0