結果
問題 | No.2345 max(l,r) |
ユーザー | woodywoody |
提出日時 | 2023-06-10 01:25:39 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 428 ms / 2,000 ms |
コード長 | 5,320 bytes |
コンパイル時間 | 4,416 ms |
コンパイル使用メモリ | 231,220 KB |
実行使用メモリ | 84,596 KB |
最終ジャッジ日時 | 2023-08-30 16:04:14 |
合計ジャッジ時間 | 18,166 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 117 ms
81,160 KB |
testcase_01 | AC | 182 ms
81,052 KB |
testcase_02 | AC | 162 ms
81,108 KB |
testcase_03 | AC | 161 ms
80,928 KB |
testcase_04 | AC | 161 ms
81,128 KB |
testcase_05 | AC | 164 ms
81,044 KB |
testcase_06 | AC | 162 ms
80,928 KB |
testcase_07 | AC | 159 ms
81,108 KB |
testcase_08 | AC | 167 ms
80,928 KB |
testcase_09 | AC | 162 ms
81,132 KB |
testcase_10 | AC | 168 ms
81,044 KB |
testcase_11 | AC | 162 ms
80,932 KB |
testcase_12 | AC | 165 ms
81,168 KB |
testcase_13 | AC | 162 ms
80,976 KB |
testcase_14 | AC | 165 ms
80,932 KB |
testcase_15 | AC | 164 ms
80,924 KB |
testcase_16 | AC | 169 ms
81,184 KB |
testcase_17 | AC | 164 ms
81,164 KB |
testcase_18 | AC | 164 ms
80,928 KB |
testcase_19 | AC | 163 ms
81,124 KB |
testcase_20 | AC | 162 ms
81,196 KB |
testcase_21 | AC | 158 ms
81,048 KB |
testcase_22 | AC | 132 ms
83,392 KB |
testcase_23 | AC | 132 ms
83,504 KB |
testcase_24 | AC | 120 ms
82,016 KB |
testcase_25 | AC | 123 ms
81,112 KB |
testcase_26 | AC | 123 ms
81,056 KB |
testcase_27 | AC | 125 ms
81,156 KB |
testcase_28 | AC | 122 ms
82,860 KB |
testcase_29 | AC | 127 ms
83,360 KB |
testcase_30 | AC | 120 ms
81,924 KB |
testcase_31 | AC | 134 ms
84,024 KB |
testcase_32 | AC | 122 ms
82,324 KB |
testcase_33 | AC | 125 ms
82,868 KB |
testcase_34 | AC | 116 ms
81,260 KB |
testcase_35 | AC | 118 ms
81,896 KB |
testcase_36 | AC | 125 ms
82,080 KB |
testcase_37 | AC | 125 ms
82,412 KB |
testcase_38 | AC | 142 ms
84,180 KB |
testcase_39 | AC | 142 ms
84,392 KB |
testcase_40 | AC | 136 ms
84,276 KB |
testcase_41 | AC | 138 ms
84,328 KB |
testcase_42 | AC | 143 ms
84,176 KB |
testcase_43 | AC | 136 ms
84,412 KB |
testcase_44 | AC | 138 ms
84,328 KB |
testcase_45 | AC | 142 ms
84,260 KB |
testcase_46 | AC | 140 ms
84,596 KB |
testcase_47 | AC | 140 ms
84,596 KB |
testcase_48 | AC | 127 ms
81,284 KB |
testcase_49 | AC | 124 ms
81,128 KB |
testcase_50 | AC | 125 ms
81,152 KB |
testcase_51 | AC | 127 ms
81,156 KB |
testcase_52 | AC | 126 ms
81,188 KB |
testcase_53 | AC | 126 ms
81,124 KB |
testcase_54 | AC | 127 ms
81,192 KB |
testcase_55 | AC | 125 ms
81,048 KB |
testcase_56 | AC | 129 ms
81,044 KB |
testcase_57 | AC | 135 ms
80,928 KB |
testcase_58 | AC | 139 ms
80,976 KB |
testcase_59 | AC | 134 ms
81,252 KB |
testcase_60 | AC | 135 ms
80,932 KB |
testcase_61 | AC | 130 ms
81,256 KB |
testcase_62 | AC | 132 ms
81,392 KB |
testcase_63 | AC | 129 ms
81,264 KB |
testcase_64 | AC | 132 ms
81,360 KB |
testcase_65 | AC | 132 ms
81,192 KB |
testcase_66 | AC | 130 ms
81,040 KB |
testcase_67 | AC | 128 ms
81,340 KB |
testcase_68 | AC | 428 ms
81,284 KB |
ソースコード
#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); show2(n,m); 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]; bool okl = (max(r+res,l)==i); bool okr = (max(r,l+res)==i); if (okl && okr){ l += cnt[i]; if (res) ans *= 2; kind++; c++; continue; }else if(okl){ l += cnt[i]; c++; kind++; continue; }else if(okr){ r += cnt[i]; c++; kind++; continue; }else{ if (abs(cnt[i]+r-l)%2==1){ ok = false; } } ll x = (cnt[i]+r-l)/2; ll y = (cnt[i]-r+l)/2; 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 (x!=y){ ok2 = true; }else{ if (c) ok2 = true; } } if (!ok) ans = 0; ans *= com(m,kind); if (c>=2) ok2 = true; if (ok2) ans *= 1; // if (!ok2) ans *= 1; outm; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; cin>>t; rep(i,t){ solve(); } return 0; }