結果
問題 | No.2299 Antitypoglycemia |
ユーザー | OnjoujiToki |
提出日時 | 2023-09-16 11:08:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 7,634 bytes |
コンパイル時間 | 1,333 ms |
コンパイル使用メモリ | 140,692 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-03 11:58:56 |
合計ジャッジ時間 | 2,364 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 4 ms
6,940 KB |
testcase_05 | AC | 3 ms
6,940 KB |
testcase_06 | AC | 3 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 4 ms
6,944 KB |
testcase_09 | AC | 4 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 4 ms
6,940 KB |
testcase_13 | AC | 4 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 3 ms
6,940 KB |
testcase_19 | AC | 4 ms
6,944 KB |
testcase_20 | AC | 5 ms
6,944 KB |
testcase_21 | AC | 5 ms
6,940 KB |
testcase_22 | AC | 4 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,944 KB |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,944 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 1 ms
6,944 KB |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <cstdint>#include <cstring>#include <ctime>#include <deque>#include <iomanip>#include <iostream>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <unordered_map>#include <unordered_set>using namespace std;template <int mod>struct ModInt {int x;ModInt() : x(0) {}ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if ((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if ((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int)(1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt &operator^=(long long p) { // quick_pow here:3ModInt res = 1;for (; p; p >>= 1) {if (p & 1) res *= *this;*this *= *this;}return *this = res;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }ModInt operator^(long long p) const { return ModInt(*this) ^= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }explicit operator int() const { return x; } // added by QCFiumModInt operator=(const int p) {x = p;return ModInt(*this);} // added by QCFiumModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;a -= t * b;std::swap(a, b);u -= t * v;std::swap(u, v);}return ModInt(u);}friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {return os << p.x;}friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {long long x;is >> x;a = ModInt<mod>(x);return (is);}};template <typename T>struct SegmentTree {using Monoid = typename T::Monoid;explicit SegmentTree(int n) : SegmentTree(std::vector<Monoid>(n, T::id())) {}explicit SegmentTree(const std::vector<Monoid> &a) : n(a.size()), sz(1) {while (sz < n) sz <<= 1;data.assign(sz << 1, T::id());std::copy(a.begin(), a.end(), data.begin() + sz);for (int i = sz - 1; i > 0; --i) {data[i] = T::merge(data[i << 1], data[(i << 1) + 1]);}}void set(int idx, const Monoid val) {idx += sz;data[idx] = val;while (idx >>= 1)data[idx] = T::merge(data[idx << 1], data[(idx << 1) + 1]);}Monoid get(int left, int right) const {Monoid res_l = T::id(), res_r = T::id();for (left += sz, right += sz; left < right; left >>= 1, right >>= 1) {if (left & 1) res_l = T::merge(res_l, data[left++]);if (right & 1) res_r = T::merge(data[--right], res_r);}return T::merge(res_l, res_r);}Monoid operator[](const int idx) const { return data[idx + sz]; }private:const int n;int sz; // sz + 原数组坐标 = 线段树里的编号,1 basedstd::vector<Monoid> data;};namespace monoid {template <typename T>struct RangeMinimumQuery {using Monoid = T;static constexpr Monoid id() { return std::numeric_limits<Monoid>::max(); }static Monoid merge(const Monoid &a, const Monoid &b) {return std::min(a, b);}};template <typename T>struct RangeMaximumQuery {using Monoid = T;static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); }static Monoid merge(const Monoid &a, const Monoid &b) {return std::max(a, b);}};template <typename T>struct RangeSumQuery {using Monoid = T;static constexpr Monoid id() { return 0; }static Monoid merge(const Monoid &a, const Monoid &b) { return a + b; }};template <typename T>struct RangeOrQuery {using Monoid = T;static constexpr Monoid id() { return 0; }static Monoid merge(const Monoid &a, const Monoid &b) { return a | b; }};} // namespace monoidtemplate <typename T>struct DSU {std::vector<T> f, siz;DSU(int n) : f(n), siz(n, 1) { std::iota(f.begin(), f.end(), 0); }T leader(T x) {while (x != f[x]) x = f[x] = f[f[x]];return x;}bool same(T x, T y) { return leader(x) == leader(y); }bool merge(T x, T y) {x = leader(x);y = leader(y);if (x == y) return false;siz[x] += siz[y];f[y] = x;return true;}T size(int x) { return siz[leader(x)]; }};bool isPrime(long long number) {if (number != 2) {if (number < 2 || number % 2 == 0) {return false;}for (int i = 3; (i * i) <= number; i += 2) {if (number % i == 0) {return false;}}}return true;}std::pair<std::vector<int>, std::vector<int>> get_prime_factor_with_kinds(int n) {std::vector<int> prime_factors;std::vector<int> cnt; // number of i_th factorfor (int i = 2; i <= sqrt(n); i++) {if (n % i == 0) {prime_factors.push_back(i);cnt.push_back(0);while (n % i == 0) n /= i, cnt[(int)prime_factors.size() - 1]++;}}if (n > 1) prime_factors.push_back(n), cnt.push_back(1);assert(prime_factors.size() == cnt.size());return {prime_factors, cnt};}template <typename T>struct FenwickTree {std::vector<T> bit;int n;FenwickTree(int _n) : n(_n), bit(_n) {}T sum(int r) {int ret = 0;for (; r >= 0; r = (r & (r + 1)) - 1) ret += bit[r];return ret;}T sum(int l, int r) {assert(l <= r);return sum(r) - sum(l - 1);} // [l, r]void add(int idx, int delta) {for (; idx < n; idx = idx | (idx + 1)) bit[idx] += delta;}};std::string solution(std::vector<std::string> &a) {int n = a.size(), k = a[0].size();std::vector<std::vector<int>> cnt(26, std::vector(k, 0));for (int i = 0; i < k; i++) {for (int j = 0; j < n; j++) {char cur = a[j][i];cnt[cur - 'a'][i] += 1;}}std::string ans(k, 'a');for (int i = 0; i < k / 2; i++) { // aacd, bbstd::vector<int> mp(26, 0);for (int j = 0; j < 26; j++) {mp[j] += cnt[j][i];mp[j] += cnt[j][k - i - 1];}for (int y = 0; y < 26; y++) {for (int x = 0; x < mp[y]; x++) {std::cout << y << ' ';}}std::cout << '\n';// aba, cbd -> acint p = 0;int cur = 0;while (p < n) {p += mp[cur];if (p >= n) {ans[i] += cur;ans[k - i - 1] += cur;break;}cur++;}}if (k & 1) {std::vector<int> mp(26, 0);// [n / 2]for (int j = 0; j < 26; j++) {mp[j] += cnt[j][k / 2];}int p = 0, cur = 0;while (p < n / 2) {p += mp[cur];if (p >= n / 2) {ans[k / 2] += cur;break;}cur++;}}return ans;}void solve() {int n, l, r;std::cin >> n >> l >> r;using mint = ModInt<998244353>;mint ans = 1;for (int i = 1; i <= n; i++) ans *= i;mint k = 1;for (int i = 1; i <= n - 1; i++) k *= i;ans -= k * 2;if (l != r) {mint t = 1;for (int i = 1; i <= n - 2; i++) {t *= i;}ans += t;}std::cout << ans << '\n';}int main() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);int t = 1;while (t--) solve();return 0;}