結果
問題 | No.2149 Vanitas Vanitatum |
ユーザー | noya2 |
提出日時 | 2022-12-14 18:14:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 5,968 bytes |
コンパイル時間 | 4,946 ms |
コンパイル使用メモリ | 264,860 KB |
実行使用メモリ | 8,408 KB |
最終ジャッジ日時 | 2024-04-25 21:58:54 |
合計ジャッジ時間 | 6,402 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
6,816 KB |
testcase_01 | AC | 6 ms
6,944 KB |
testcase_02 | AC | 7 ms
6,944 KB |
testcase_03 | AC | 7 ms
6,940 KB |
testcase_04 | AC | 6 ms
6,940 KB |
testcase_05 | AC | 6 ms
6,940 KB |
testcase_06 | AC | 6 ms
6,944 KB |
testcase_07 | AC | 7 ms
6,940 KB |
testcase_08 | AC | 7 ms
6,940 KB |
testcase_09 | AC | 6 ms
6,944 KB |
testcase_10 | AC | 6 ms
6,940 KB |
testcase_11 | AC | 6 ms
6,940 KB |
testcase_12 | AC | 37 ms
6,940 KB |
testcase_13 | AC | 13 ms
6,944 KB |
testcase_14 | AC | 43 ms
6,940 KB |
testcase_15 | AC | 32 ms
6,944 KB |
testcase_16 | AC | 15 ms
6,940 KB |
testcase_17 | AC | 23 ms
6,940 KB |
testcase_18 | AC | 39 ms
6,944 KB |
testcase_19 | AC | 31 ms
6,944 KB |
testcase_20 | AC | 45 ms
6,940 KB |
testcase_21 | AC | 14 ms
6,944 KB |
testcase_22 | AC | 44 ms
6,940 KB |
testcase_23 | AC | 38 ms
6,940 KB |
testcase_24 | AC | 27 ms
6,940 KB |
testcase_25 | AC | 26 ms
6,940 KB |
testcase_26 | AC | 87 ms
8,408 KB |
ソースコード
#line 1 "c.cpp" #include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for (int i = 0; i < int(n); ++i) #define repp(i,n,m) for (int i = m; i < int(n); ++i) #define reb(i,n) for (int i = int(n)-1; i >= 0; --i) #define all(v) v.begin(),v.end() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair<int, int>; using PL = pair<long long, long long>; using pdd = pair<long double, long double>; using pil = pair<int,ll>; using pli = pair<ll,int>; template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;} template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);} template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));} template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());} void revs(string &s) {reverse(s.begin(),s.end());} template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);} template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());} template<typename T1, typename T2>void print(pair<T1,T2> a); template<typename T>void print(vector<T> v); template<typename T>void print(vector<vector<T>> v); void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } void print(unsigned int a){ printf("%u", a); } void print(unsigned long long a) { printf("%llu", a); } template<class T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);} template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}} template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}} void yes(){out("Yes");} void no (){out("No");} void yn (bool t){if(t)yes();else no();} void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);} void o(){out("!?");} namespace noya2{ const int INF = 1001001007; const long long mod1 = 998244353; const long long mod2 = 1000000007; const long long inf = 2e18; const long double pi = 3.14159265358979323; const long double eps = 1e-7; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; } // namespace noya2 using namespace noya2; using mint = modint998244353; //using mint = modint; //using mint = modint1000000007; void out(mint a){out(a.val());} void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);} void out(vector<vector<mint>> a){for (auto v : a) out(v);} istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;} #line 2 "binom.hpp" #line 4 "binom.hpp" namespace noya2{ template<typename T> struct MINT{ MINT(int lim = -1){init(lim);} static T fact(int x) {init(x); return kaijo[x];} static T ifact(int x){init(x); return kainv[x];} static T ncr(int n, int r){ if (n < r || r < 0) return T(0); init(n); return kaijo[n] * kainv[r] * kainv[n-r]; } static T npr(int n, int r){ if (n < r || r < 0) return T(0); init(n); return kaijo[n] * kainv[n-r]; } private: static std::vector<T> kaijo, kainv; static void init(int lim){ if (lim <= -1) lim = 300000; if ((int)kaijo.size() > lim) return ; int siz = kaijo.size(); kaijo.resize(lim+1), kainv.resize(lim+1); for (int i = siz; i <= lim; i++) kaijo[i] = kaijo[i-1] * T(i); kainv[lim] = kaijo[lim].inv(); for (int i = lim-1; i >= siz; i--) kainv[i] = kainv[i+1] * T(i+1); } }; template<typename T> std::vector<T>MINT<T>::kaijo = vector<T>(2,T(1)); template<typename T> std::vector<T>MINT<T>::kainv = vector<T>(2,T(1)); } // namespace noya2 #line 80 "c.cpp" void solve(){ int n; cin >> n; vector<int> a(n); cin >> a; vector<int> b; int sum = 0, ima = 0; rep(i,n){ sum += a[i]; rep(j,a[i]-ima) b.emplace_back(1); ima = a[i]; b.emplace_back(0); } vector<int> c0, c1; rep(i,(int)b.size()) (i % 2 == 0 ? c0 : c1).emplace_back(b[i]); MINT<mint> bnm; mint ans = 1; auto box = [&](vector<int> c){ int res = 0, cnt = 0; vector<int> d; for (auto x : c){ if (x == 0){ if (cnt != 0) d.emplace_back(cnt), res += cnt; } else cnt++; } vector<int> le(1010,1000); int ma = -1; int m = d.size(); rep(i,m){ while (ma < d[i]) le[++ma] = i; } rep(i,m){ repp(j,d[i]+1,1){ int h = d[i] - j + 1 + i - le[j]; ans *= mint(h).inv(); } } return res; }; int siz = box(c0) + box(c1); ans *= bnm.fact(siz); out(2*siz == sum ? ans.val() : (unsigned int)0); } int main(){ fast_io(); int t = 1; //cin >> t; while(t--) solve(); }