結果
問題 | No.2898 Update Max |
ユーザー | 👑 binap |
提出日時 | 2024-09-20 23:21:22 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 65 ms / 2,000 ms |
コード長 | 3,732 bytes |
コンパイル時間 | 5,179 ms |
コンパイル使用メモリ | 266,548 KB |
実行使用メモリ | 8,828 KB |
最終ジャッジ日時 | 2024-09-20 23:21:30 |
合計ジャッジ時間 | 7,822 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 3 ms
5,248 KB |
testcase_04 | AC | 3 ms
5,248 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 64 ms
5,504 KB |
testcase_09 | AC | 64 ms
5,504 KB |
testcase_10 | AC | 64 ms
5,632 KB |
testcase_11 | AC | 64 ms
5,632 KB |
testcase_12 | AC | 64 ms
5,632 KB |
testcase_13 | AC | 65 ms
6,144 KB |
testcase_14 | AC | 65 ms
6,016 KB |
testcase_15 | AC | 65 ms
6,144 KB |
testcase_16 | AC | 65 ms
6,144 KB |
testcase_17 | AC | 65 ms
6,144 KB |
testcase_18 | AC | 65 ms
7,416 KB |
testcase_19 | AC | 65 ms
7,420 KB |
testcase_20 | AC | 64 ms
7,420 KB |
testcase_21 | AC | 64 ms
7,292 KB |
testcase_22 | AC | 63 ms
7,424 KB |
testcase_23 | AC | 57 ms
8,696 KB |
testcase_24 | AC | 57 ms
8,700 KB |
testcase_25 | AC | 57 ms
8,700 KB |
testcase_26 | AC | 57 ms
8,828 KB |
testcase_27 | AC | 56 ms
8,828 KB |
testcase_28 | AC | 53 ms
8,824 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} using mint = modint998244353; // combination mod prime // https://youtu.be/8uowVvQ_-Mo?t=6002 // https://youtu.be/Tgd_zLfRZOQ?t=9928 struct modinv { int n; vector<mint> d; modinv(): n(2), d({0,1}) {} mint operator()(int i) { while (n <= i) d.push_back(-d[mint::mod()%n]*(mint::mod()/n)), ++n; return d[i]; } mint operator[](int i) const { return d[i];} } invs; struct modfact { int n; vector<mint> d; modfact(): n(2), d({1,1}) {} mint operator()(int i) { while (n <= i) d.push_back(d.back()*n), ++n; return d[i]; } mint operator[](int i) const { return d[i];} } facts; struct modfactinv { int n; vector<mint> d; modfactinv(): n(2), d({1,1}) {} mint operator()(int i) { while (n <= i) d.push_back(d.back()*invs(n)), ++n; return d[i]; } mint operator[](int i) const { return d[i];} } ifacts; mint comb(int n, int k) { if (n < k || k < 0) return 0; return facts(n)*ifacts(k)*ifacts(n-k); } int main(){ int n; cin >> n; vector<int> a(n); cin >> a; int f = 0, g = 0; vector<int> vacant(n + 1); rep(i, n){ if(a[i] > 0) vacant[a[i]]++; else g++; } for(int x = 1; x <= n; x++){ vacant[x] = 1 - vacant[x]; } vector<int> small(n + 1); for(int x = 1; x <= n; x++){ small[x] = vacant[x] + small[x - 1]; } mint ans = 0; int MAX = 0; rep(i, n){ if(a[i] > 0){ if(small[a[i]] < f) continue; if(a[i] < MAX) continue; ans += comb(small[a[i]], f) * facts(f) * facts(g); chmax(MAX, a[i]); }else{ f++; g--; ans += (comb(f + g, f) - (comb(small[MAX], f))) * facts(f - 1) * facts(g); } } cout << ans << "\n"; return 0; }