結果
| 問題 | No.2045 Two Reflections |
| ユーザー |
 hitonanode
|
| 提出日時 | 2022-08-08 22:11:01 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 13 ms / 2,000 ms |
| コード長 | 14,058 bytes |
| コンパイル時間 | 2,185 ms |
| コンパイル使用メモリ | 195,424 KB |
| 実行使用メモリ | 10,152 KB |
| 最終ジャッジ日時 | 2024-09-19 06:31:57 |
| 合計ジャッジ時間 | 3,151 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 27 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <deque>#include <forward_list>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iostream>#include <limits>#include <list>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T, typename V>void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end());return vec; }template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']';return os; }#if __cplusplus >= 201703Ltemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); returnis; }template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }#endiftemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ',';os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp)os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET <<endl#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ <<COLOR_RESET << endl : cerr)#else#define dbg(x) 0#define dbgif(cond, x) 0#endiftemplate <int md> struct ModInt {#if __cplusplus >= 201402L#define MDCONST constexpr#else#define MDCONST#endifusing lint = long long;MDCONST static int mod() { return md; }static int get_primitive_root() {static int primitive_root = 0;if (!primitive_root) {primitive_root = [&]() {std::set<int> fac;int v = md - 1;for (lint i = 2; i * i <= v; i++)while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < md; g++) {bool ok = true;for (auto i : fac)if (ModInt(g).pow((md - 1) / i) == 1) {ok = false;break;}if (ok) return g;}return -1;}();}return primitive_root;}int val_;int val() const noexcept { return val_; }MDCONST ModInt() : val_(0) {}MDCONST ModInt &_setval(lint v) { return val_ = (v >= md ? v - md : v), *this; }MDCONST ModInt(lint v) { _setval(v % md + md); }MDCONST explicit operator bool() const { return val_ != 0; }MDCONST ModInt operator+(const ModInt &x) const {return ModInt()._setval((lint)val_ + x.val_);}MDCONST ModInt operator-(const ModInt &x) const {return ModInt()._setval((lint)val_ - x.val_ + md);}MDCONST ModInt operator*(const ModInt &x) const {return ModInt()._setval((lint)val_ * x.val_ % md);}MDCONST ModInt operator/(const ModInt &x) const {return ModInt()._setval((lint)val_ * x.inv().val() % md);}MDCONST ModInt operator-() const { return ModInt()._setval(md - val_); }MDCONST ModInt &operator+=(const ModInt &x) { return *this = *this + x; }MDCONST ModInt &operator-=(const ModInt &x) { return *this = *this - x; }MDCONST ModInt &operator*=(const ModInt &x) { return *this = *this * x; }MDCONST ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend MDCONST ModInt operator+(lint a, const ModInt &x) {return ModInt()._setval(a % md + x.val_);}friend MDCONST ModInt operator-(lint a, const ModInt &x) {return ModInt()._setval(a % md - x.val_ + md);}friend MDCONST ModInt operator*(lint a, const ModInt &x) {return ModInt()._setval(a % md * x.val_ % md);}friend MDCONST ModInt operator/(lint a, const ModInt &x) {return ModInt()._setval(a % md * x.inv().val() % md);}MDCONST bool operator==(const ModInt &x) const { return val_ == x.val_; }MDCONST bool operator!=(const ModInt &x) const { return val_ != x.val_; }MDCONST bool operator<(const ModInt &x) const {return val_ < x.val_;} // To use std::map<ModInt, T>friend std::istream &operator>>(std::istream &is, ModInt &x) {lint t;return is >> t, x = ModInt(t), is;}MDCONST friend std::ostream &operator<<(std::ostream &os, const ModInt &x) {return os << x.val_;}MDCONST ModInt pow(lint n) const {ModInt ans = 1, tmp = *this;while (n) {if (n & 1) ans *= tmp;tmp *= tmp, n >>= 1;}return ans;}static std::vector<ModInt> facs, facinvs, invs;MDCONST static void _precalculation(int N) {int l0 = facs.size();if (N > md) N = md;if (N <= l0) return;facs.resize(N), facinvs.resize(N), invs.resize(N);for (int i = l0; i < N; i++) facs[i] = facs[i - 1] * i;facinvs[N - 1] = facs.back().pow(md - 2);for (int i = N - 2; i >= l0; i--) facinvs[i] = facinvs[i + 1] * (i + 1);for (int i = N - 1; i >= l0; i--) invs[i] = facinvs[i] * facs[i - 1];}MDCONST ModInt inv() const {if (this->val_ < std::min(md >> 1, 1 << 21)) {if (facs.empty()) facs = {1}, facinvs = {1}, invs = {0};while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);return invs[this->val_];} else {return this->pow(md - 2);}}MDCONST ModInt fac() const {while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);return facs[this->val_];}MDCONST ModInt facinv() const {while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);return facinvs[this->val_];}MDCONST ModInt doublefac() const {lint k = (this->val_ + 1) / 2;return (this->val_ & 1) ? ModInt(k * 2).fac() / (ModInt(2).pow(k) * ModInt(k).fac()): ModInt(k).fac() * ModInt(2).pow(k);}MDCONST ModInt nCr(const ModInt &r) const {return (this->val_ < r.val_) ? 0 : this->fac() * (*this - r).facinv() * r.facinv();}MDCONST ModInt nPr(const ModInt &r) const {return (this->val_ < r.val_) ? 0 : this->fac() * (*this - r).facinv();}ModInt sqrt() const {if (val_ == 0) return 0;if (md == 2) return val_;if (pow((md - 1) / 2) != 1) return 0;ModInt b = 1;while (b.pow((md - 1) / 2) == 1) b += 1;int e = 0, m = md - 1;while (m % 2 == 0) m >>= 1, e++;ModInt x = pow((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModInt z = b.pow(m);while (y != 1) {int j = 0;ModInt t = y;while (t != 1) j++, t *= t;z = z.pow(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModInt(std::min(x.val_, md - x.val_));}};template <int md> std::vector<ModInt<md>> ModInt<md>::facs = {1};template <int md> std::vector<ModInt<md>> ModInt<md>::facinvs = {1};template <int md> std::vector<ModInt<md>> ModInt<md>::invs = {0};using mint = ModInt<998244353>;// UnionFind Tree (0-indexed), based on size of each disjoint setstruct UnionFind {std::vector<int> par, cou;UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }bool unite(int x, int y) {x = find(x), y = find(y);if (x == y) return false;if (cou[x] < cou[y]) std::swap(x, y);par[y] = x, cou[x] += cou[y];return true;}int count(int x) { return cou[find(x)]; }bool same(int x, int y) { return find(x) == find(y); }std::vector<std::vector<int>> groups() {std::vector<std::vector<int>> ret(par.size());for (int i = 0; i < int(par.size()); ++i) ret[find(i)].push_back(i);ret.erase(std::remove_if(ret.begin(), ret.end(),[&](const std::vector<int> &v) { return v.empty(); }),ret.end());return ret;}};vector<int> solve(int N, int P, int Q) {vector<int> fg(N);REP(i, N) fg[i] = i;auto gf = fg;reverse(fg.begin(), fg.begin() + P);reverse(fg.end() - Q, fg.end());reverse(gf.end() - Q, gf.end());reverse(gf.begin(), gf.begin() + P);UnionFind uf_fg(N);REP(i, N) uf_fg.unite(fg[i], i);set<int> sizes;for (auto g : uf_fg.groups()) { sizes.insert(g.size()); }return {sizes.begin(), sizes.end()};}int main() {int N, P, Q;cin >> N >> P >> Q;if (P + Q <= N or P == 1 or Q == 1) {set<vector<int>> ret;vector<int> A(N);REP(i, N) A[i] = i;REP(t1, 2) {REP(t2, 2) {ret.insert(A);reverse(A.begin(), A.begin() + P);}reverse(A.end() - Q, A.end());}cout << ret.size() << endl;return 0;}vector<int> fg(N);REP(i, N) fg[i] = i;auto gf = fg;reverse(fg.begin(), fg.begin() + P);reverse(fg.end() - Q, fg.end());reverse(gf.end() - Q, gf.end());reverse(gf.begin(), gf.begin() + P);UnionFind uf_fg(N);REP(i, N) uf_fg.unite(fg[i], i);set<int> sizes;for (auto g : uf_fg.groups()) {sizes.insert(g.size());}dbg(sizes);// vector<int> large;// FOR(n, 1, 100) {// FOR(p, 1, n + 1) {// FOR(q, 1, n + 1) {// vector<int> s = solve(n, p, q);// if (s.size() > large.size()) {// large = s;// dbg(make_tuple(n, p, q));// dbg(s);// }// if (s.size() == large.size()) large = s;// }// }// }// dbg(large);lint g = 1;for (auto x : sizes) g = lcm<lint>(g, x);dbg(lint(g));cout << lint(g * 2 % mint::mod()) << endl;}