結果
問題 | No.1608 Yet Another Ants Problem |
ユーザー | snow39 |
提出日時 | 2021-07-16 22:53:03 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 110 ms / 2,000 ms |
コード長 | 3,204 bytes |
コンパイル時間 | 1,028 ms |
コンパイル使用メモリ | 107,564 KB |
実行使用メモリ | 27,164 KB |
最終ジャッジ日時 | 2023-09-20 15:18:23 |
合計ジャッジ時間 | 5,523 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
26,980 KB |
testcase_01 | AC | 54 ms
26,820 KB |
testcase_02 | AC | 56 ms
26,760 KB |
testcase_03 | AC | 58 ms
26,772 KB |
testcase_04 | AC | 54 ms
26,904 KB |
testcase_05 | AC | 53 ms
26,832 KB |
testcase_06 | AC | 57 ms
26,760 KB |
testcase_07 | AC | 53 ms
26,864 KB |
testcase_08 | AC | 52 ms
26,808 KB |
testcase_09 | AC | 54 ms
26,984 KB |
testcase_10 | AC | 57 ms
26,840 KB |
testcase_11 | AC | 58 ms
26,908 KB |
testcase_12 | AC | 58 ms
27,068 KB |
testcase_13 | AC | 56 ms
26,760 KB |
testcase_14 | AC | 105 ms
26,884 KB |
testcase_15 | AC | 107 ms
26,980 KB |
testcase_16 | AC | 99 ms
26,900 KB |
testcase_17 | AC | 102 ms
26,856 KB |
testcase_18 | AC | 105 ms
26,896 KB |
testcase_19 | AC | 60 ms
27,000 KB |
testcase_20 | AC | 76 ms
26,900 KB |
testcase_21 | AC | 75 ms
26,956 KB |
testcase_22 | AC | 71 ms
26,812 KB |
testcase_23 | AC | 97 ms
26,968 KB |
testcase_24 | AC | 99 ms
26,900 KB |
testcase_25 | AC | 97 ms
26,872 KB |
testcase_26 | AC | 91 ms
26,904 KB |
testcase_27 | AC | 94 ms
26,932 KB |
testcase_28 | AC | 93 ms
26,976 KB |
testcase_29 | AC | 94 ms
26,832 KB |
testcase_30 | AC | 110 ms
26,816 KB |
testcase_31 | AC | 99 ms
27,032 KB |
testcase_32 | AC | 99 ms
27,164 KB |
testcase_33 | AC | 96 ms
26,892 KB |
testcase_34 | AC | 94 ms
26,876 KB |
ソースコード
#include <algorithm> #include <cmath> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <tuple> #include <vector> #define mkp make_pair #define mkt make_tuple #define rep(i, n) for (int i = 0; i < (n); ++i) #define all(v) v.begin(), v.end() using namespace std; typedef long long ll; // const ll MOD = 1e9 + 7; const ll MOD = 998244353; template <class T> void chmin(T &a, const T &b) { if (a > b) a = b; } template <class T> void chmax(T &a, const T &b) { if (a < b) a = b; } #define MAX_N 1000010 ll inv[MAX_N + 10], fac[MAX_N + 10], ifac[MAX_N + 10]; void setComb() { inv[0] = 1; inv[1] = 1; fac[1] = 1; ifac[1] = 1; fac[0] = 1; ifac[0] = 1; for (int i = 2; i < MAX_N; i++) { inv[i] = (-MOD / i) * inv[MOD % i] % MOD; fac[i] = fac[i - 1] * i % MOD; ifac[i] = ifac[i - 1] * inv[i] % MOD; inv[i] = (inv[i] + MOD) % MOD; fac[i] = (fac[i] + MOD) % MOD; ifac[i] = (ifac[i] + MOD) % MOD; } return; } ll comb(ll n, ll k) { if (n < k || n < 0 || k < 0) return 0; else return ((fac[n] * ifac[k] % MOD * ifac[n - k] % MOD + MOD) % MOD); } ll hcomb(ll n, ll r) { // this size is really ok?? if (n == 0 && r == 0) return 1; else if (n < 0 || r < 0) return 0; else return comb(n + r - 1, r); } ll binom(ll n, ll k) { if (n < k || n < 0 || k < 0) return 0; n %= MOD; ll res = 1; for (ll i = 0; i < k; i++) res = res * ((n - i + MOD) % MOD) % MOD; res = res * ifac[k] % MOD; return res; } ll mod_pow(ll x, ll n) { x %= MOD; ll res = 1; while (n > 0) { if (n & 1) res = res * x % MOD; x = x * x % MOD; n >>= 1; } return res; } ll mod_inverse(ll x) { return mod_pow(x, MOD - 2); } void add(ll &a, ll b) { a = (a + b) % MOD; } void mul(ll &a, ll b) { a %= MOD; b %= MOD; a = a * b % MOD; } void solve() { setComb(); int N; ll L; cin >> N >> L; vector<ll> A(N); rep(i, N) cin >> A[i]; vector<ll> ans(N, 0); for (int i = 0; i < N; i++) { { // to left bool ng = false; for (int j = i + 1; j < N; j++) if (L - A[j] > A[i]) ng = true; if (!ng) { int freedom = 0; for (int j = 0; j < i; j++) if (L - A[j] <= A[i]) freedom++; for (int k = 0; k <= freedom; k++) if (i - k >= 0) add(ans[i - k], comb(freedom, k)); } } { // to right bool ng = false; for (int j = 0; j < i; j++) if (A[j] >= L - A[i]) ng = true; if (!ng) { int freedom = 0; for (int j = i + 1; j < N; j++) if (A[j] < L - A[i]) freedom++; for (int k = 0; k <= freedom; k++) if (i + k < N) add(ans[i + k], comb(freedom, k)); } } } rep(i, N) cout << ans[i] << "\n"; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }