結果
| 問題 | No.1713 trick or treat! |
| ユーザー |
 Kanten4205
|
| 提出日時 | 2022-02-21 11:40:05 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 4 ms / 2,000 ms |
| コード長 | 6,405 bytes |
| コンパイル時間 | 1,646 ms |
| コンパイル使用メモリ | 174,048 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-06-29 15:56:18 |
| 合計ジャッジ時間 | 2,170 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 5 |
ソースコード
#include <bits/stdc++.h>using namespace std;const long long MOD1 = 1000000007;const long long MOD2 = 998244353;typedef long long ll;typedef pair<ll, ll> P;const long long INF = 1e17;template <typename T>void input_arr(vector<T>& A, ll N) {for (ll i = 0; i < N; i++) {cin >> A[i];}}template <typename T, typename Q>void input_arr(vector<pair<T, Q>>& A, ll N) {for (ll i = 0; i < N; i++) {cin >> A[i].first >> A[i].second;}}template <typename T>void input_arr(vector<vector<T>>& A, ll H, ll W) {for (ll i = 0; i < H; i++) {for (ll j = 0; j < W; j++) {cin >> A[i][j];}}}vector<bool>seen(200010, false);vector<P>kukan(200010, {INF, -INF});vector<ll>B;ll num = -1;void dfs(vector<vector<ll>>&G, ll v) {seen[v] = true;kukan[v].first = (ll)B.size() - 1;for (auto nv : G[v]) {if (!seen[nv]) {if (num != nv) {B.push_back(nv); num = nv;}dfs(G, nv);}}kukan[v].second = B.size();}struct SuccinctIndexableDictionary {size_t length;size_t blocks;vector< unsigned > bit, sum;SuccinctIndexableDictionary() = default;SuccinctIndexableDictionary(size_t length) : length(length), blocks((length + 31) >> 5) {bit.assign(blocks, 0U);sum.assign(blocks, 0U);}void set(int k) {bit[k >> 5] |= 1U << (k & 31);}void build() {sum[0] = 0U;for(int i = 1; i < blocks; i++) {sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);}}bool operator[](int k) {return (bool((bit[k >> 5] >> (k & 31)) & 1));}int rank(int k) {return (sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));}int rank(bool val, int k) {return (val ? rank(k) : k - rank(k));}};template< typename T, int MAXLOG >struct WaveletMatrix {size_t length;SuccinctIndexableDictionary matrix[MAXLOG];int mid[MAXLOG];WaveletMatrix() = default;WaveletMatrix(vector< T > v) : length(v.size()) {vector< T > l(length), r(length);for(int level = MAXLOG - 1; level >= 0; level--) {matrix[level] = SuccinctIndexableDictionary(length + 1);int left = 0, right = 0;for(int i = 0; i < length; i++) {if(((v[i] >> level) & 1)) {matrix[level].set(i);r[right++] = v[i];} else {l[left++] = v[i];}}mid[level] = left;matrix[level].build();v.swap(l);for(int i = 0; i < right; i++) {v[left + i] = r[i];}}}pair< int, int > succ(bool f, int l, int r, int level) {return {matrix[level].rank(f, l) + mid[level] * f, matrix[level].rank(f, r) + mid[level] * f};}// v[k]T access(int k) {T ret = 0;for(int level = MAXLOG - 1; level >= 0; level--) {bool f = matrix[level][k];if(f) ret |= T(1) << level;k = matrix[level].rank(f, k) + mid[level] * f;}return ret;}T operator[](const int &k) {return access(k);}// count i s.t. (0 <= i < r) && v[i] == xint rank(const T &x, int r) {int l = 0;for(int level = MAXLOG - 1; level >= 0; level--) {tie(l, r) = succ((x >> level) & 1, l, r, level);}return r - l;}// k-th(0-indexed) smallest number in v[l,r)T kth_smallest(int l, int r, int k) {assert(0 <= k && k < r - l);T ret = 0;for(int level = MAXLOG - 1; level >= 0; level--) {int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);bool f = cnt <= k;if(f) {ret |= T(1) << level;k -= cnt;}tie(l, r) = succ(f, l, r, level);}return ret;}// k-th(0-indexed) largest number in v[l,r)T kth_largest(int l, int r, int k) {return kth_smallest(l, r, r - l - k - 1);}// count i s.t. (l <= i < r) && (v[i] < upper)int range_freq(int l, int r, T upper) {int ret = 0;for(int level = MAXLOG - 1; level >= 0; level--) {bool f = ((upper >> level) & 1);if(f) ret += matrix[level].rank(false, r) - matrix[level].rank(false, l);tie(l, r) = succ(f, l, r, level);}return ret;}// count i s.t. (l <= i < r) && (lower <= v[i] < upper)int range_freq(int l, int r, T lower, T upper) {return range_freq(l, r, upper) - range_freq(l, r, lower);}// max v[i] s.t. (l <= i < r) && (v[i] < upper)T prev_value(int l, int r, T upper) {int cnt = range_freq(l, r, upper);return cnt == 0 ? T(-1) : kth_smallest(l, r, cnt - 1);}// min v[i] s.t. (l <= i < r) && (lower <= v[i])T next_value(int l, int r, T lower) {int cnt = range_freq(l, r, lower);return cnt == r - l ? T(-1) : kth_smallest(l, r, cnt);}};template< typename T, int MAXLOG >struct CompressedWaveletMatrix {WaveletMatrix< int, MAXLOG > mat;vector< T > ys;CompressedWaveletMatrix(const vector< T > &v) : ys(v) {sort(begin(ys), end(ys));ys.erase(unique(begin(ys), end(ys)), end(ys));vector< int > t(v.size());for(int i = 0; i < v.size(); i++) t[i] = get(v[i]);mat = WaveletMatrix< int, MAXLOG >(t);}inline int get(const T& x) {return lower_bound(begin(ys), end(ys), x) - begin(ys);}T access(int k) {return ys[mat.access(k)];}T operator[](const int &k) {return access(k);}int rank(const T &x, int r) {auto pos = get(x);if(pos == ys.size() || ys[pos] != x) return 0;return mat.rank(pos, r);}T kth_smallest(int l, int r, int k) {return ys[mat.kth_smallest(l, r, k)];}T kth_largest(int l, int r, int k) {return ys[mat.kth_largest(l, r, k)];}int range_freq(int l, int r, T upper) {return mat.range_freq(l, r, get(upper));}int range_freq(int l, int r, T lower, T upper) {return mat.range_freq(l, r, get(lower), get(upper));}T prev_value(int l, int r, T upper) {auto ret = mat.prev_value(l, r, get(upper));return ret == -1 ? T(-1) : ys[ret];}T next_value(int l, int r, T lower) {auto ret = mat.next_value(l, r, get(lower));return ret == -1 ? T(-1) : ys[ret];}};void solve() {ll a, b; cin >> a >> b;ll num = (a | b);ll ans = 1;for (ll i = 2; i <= num; i++) {ans *= i;}cout << ans << endl;}int main() {ll T=1;//cin>>T;while(T--)solve();}