結果
問題 | No.2045 Two Reflections |
ユーザー | heno239 |
提出日時 | 2022-08-19 21:49:11 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 23 ms / 2,000 ms |
コード長 | 6,912 bytes |
コンパイル時間 | 2,051 ms |
コンパイル使用メモリ | 156,644 KB |
実行使用メモリ | 12,416 KB |
最終ジャッジ日時 | 2024-10-08 08:14:12 |
合計ジャッジ時間 | 3,737 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
12,032 KB |
testcase_01 | AC | 21 ms
12,160 KB |
testcase_02 | AC | 23 ms
12,288 KB |
testcase_03 | AC | 22 ms
12,364 KB |
testcase_04 | AC | 22 ms
12,288 KB |
testcase_05 | AC | 21 ms
12,160 KB |
testcase_06 | AC | 21 ms
12,288 KB |
testcase_07 | AC | 23 ms
12,228 KB |
testcase_08 | AC | 21 ms
12,288 KB |
testcase_09 | AC | 23 ms
12,416 KB |
testcase_10 | AC | 23 ms
12,416 KB |
testcase_11 | AC | 21 ms
12,032 KB |
testcase_12 | AC | 22 ms
12,032 KB |
testcase_13 | AC | 21 ms
12,032 KB |
testcase_14 | AC | 21 ms
12,108 KB |
testcase_15 | AC | 21 ms
12,032 KB |
testcase_16 | AC | 21 ms
12,160 KB |
testcase_17 | AC | 21 ms
12,160 KB |
testcase_18 | AC | 21 ms
12,032 KB |
testcase_19 | AC | 21 ms
12,032 KB |
testcase_20 | AC | 21 ms
12,160 KB |
testcase_21 | AC | 22 ms
12,160 KB |
testcase_22 | AC | 22 ms
12,160 KB |
testcase_23 | AC | 23 ms
12,160 KB |
testcase_24 | AC | 22 ms
12,160 KB |
testcase_25 | AC | 23 ms
12,288 KB |
testcase_26 | AC | 22 ms
12,160 KB |
testcase_27 | AC | 22 ms
12,372 KB |
testcase_28 | AC | 22 ms
12,288 KB |
testcase_29 | AC | 22 ms
12,288 KB |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>#include<chrono>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 998244353;//constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;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);}template<typename T>void cinarray(vector<T>& v) {rep(i, v.size())cin >> v[i];}template<typename T>void coutarray(vector<T>& v) {rep(i, v.size()) {if (i > 0)cout << " "; cout << v[i];}cout << "\n";}ll mod_pow(ll x, ll n, ll m = mod) {if (n < 0) {ll res = mod_pow(x, -n, m);return mod_pow(res, m - 2, m);}if (abs(x) >= m)x %= m;if (x < 0)x += m;//if (x == 0)return 0;ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {int n;modint() :n(0) { ; }modint(ll m) {if (m < 0 || mod <= m) {m %= mod; if (m < 0)m += mod;}n = m;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }bool operator<(modint a, modint b) { return a.n < b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }modint operator/=(modint& a, modint b) { a = a / b; return a; }const int max_n = 1 << 20;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}modint combP(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[a - b];}ll gcd(ll a, ll b) {a = abs(a); b = abs(b);if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}using ld = long double;//typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-10;const ld pi = acosl(-1.0);template<typename T>void addv(vector<T>& v, int loc, T val) {if (loc >= v.size())v.resize(loc + 1, 0);v[loc] += val;}/*const int mn = 2000005;bool isp[mn];vector<int> ps;void init() {fill(isp + 2, isp + mn, true);for (int i = 2; i < mn; i++) {if (!isp[i])continue;ps.push_back(i);for (int j = 2 * i; j < mn; j += i) {isp[j] = false;}}}*///[,val)template<typename T>auto prev_itr(set<T>& st, T val) {auto res = st.lower_bound(val);if (res == st.begin())return st.end();res--; return res;}//[val,)template<typename T>auto next_itr(set<T>& st, T val) {auto res = st.lower_bound(val);return res;}using mP = pair<modint, modint>;mP operator+(mP a, mP b) {return { a.first + b.first,a.second + b.second };}mP operator+=(mP& a, mP b) {a = a + b; return a;}mP operator-(mP a, mP b) {return { a.first - b.first,a.second - b.second };}mP operator-=(mP& a, mP b) {a = a - b; return a;}LP operator+(LP a, LP b) {return { a.first + b.first,a.second + b.second };}LP operator+=(LP& a, LP b) {a = a + b; return a;}LP operator-(LP a, LP b) {return { a.first - b.first,a.second - b.second };}LP operator-=(LP& a, LP b) {a = a - b; return a;}mt19937 mt(time(0));const string drul = "DRUL";string senw = "SENW";//DRUL,or SENWint dx[4] = { 1,0,-1,0 };int dy[4] = { 0,1,0,-1 };//-----------------------------------------struct uf {private:vector<int> par, ran;public:uf(int n) {par.resize(n, 0);ran.resize(n, 0);rep(i, n) {par[i] = i;}}int find(int x) {if (par[x] == x)return x;else return par[x] = find(par[x]);}void unite(int x, int y) {x = find(x), y = find(y);if (x == y)return;if (ran[x] < ran[y]) {par[x] = y;}else {par[y] = x;if (ran[x] == ran[y])ran[x]++;}}bool same(int x, int y) {return find(x) == find(y);}};const int mn = 200005;bool isp[mn];vector<int> ps;void init() {fill(isp + 2, isp + mn, true);for (int i = 2; i < mn; i++) {if (!isp[i])continue;ps.push_back(i);for (int j = 2 * i; j < mn; j += i) {isp[j] = false;}}}void solve() {int n, p, q; cin >> n >> p >> q;if (n == 1) {cout << 1 << "\n"; return;}else if (p == n && q == n) {cout << 2 << "\n"; return;}else {if (p == 1 && q == 1) {cout << 1 << "\n"; return;}if (p == 1 || q == 1) {cout << 2 << "\n"; return;}}/*if (p + q <= n) {cout << 4 << "\n"; return;}*/vector<int> nex(n);rep(i, n)nex[i] = i;rep(i, p) {if(i<p-1-i)swap(nex[i], nex[p - 1 - i]);}rep(i, q) {if(n-q+i<n-1-i)swap(nex[n - q + i], nex[n - 1 - i]);}vector<bool> used(n);vector<int> hs;rep(i, n) {if (used[i])continue;int cur = i;int cnt = 0;while (!used[cur]) {used[cur] = true;cur = nex[cur];cnt++;}hs.push_back(cnt);}vector<bool> exi(n + 1);for (int h : hs)exi[h] = true;modint ans = 1;for (int p : ps) {int ma = 0;for (int j = p; j <= n; j += p) {if (exi[j]) {int cnt = 0;int cop = j;while (cop % p == 0) {cop /= p; cnt++;}chmax(ma, cnt);}}rep(j, ma)ans *= p;}ans *= 2;cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);init_f();init();//expr();//while(true)//int t; cin >> t; rep(i, t)solve();return 0;}