結果

問題 No.2045 Two Reflections
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2022-08-19 23:00:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,496 bytes
コンパイル時間 2,591 ms
コンパイル使用メモリ 222,700 KB
実行使用メモリ 25,324 KB
最終ジャッジ日時 2024-10-08 10:20:29
合計ジャッジ時間 4,323 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
11,788 KB
testcase_01 AC 5 ms
11,896 KB
testcase_02 AC 28 ms
24,400 KB
testcase_03 AC 19 ms
20,388 KB
testcase_04 AC 21 ms
22,040 KB
testcase_05 AC 9 ms
13,840 KB
testcase_06 AC 11 ms
15,404 KB
testcase_07 AC 20 ms
21,672 KB
testcase_08 AC 30 ms
23,260 KB
testcase_09 AC 23 ms
23,372 KB
testcase_10 AC 17 ms
19,844 KB
testcase_11 AC 8 ms
13,876 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 6 ms
11,884 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 28 ms
25,280 KB
testcase_21 AC 42 ms
24,468 KB
testcase_22 AC 41 ms
24,256 KB
testcase_23 AC 44 ms
24,408 KB
testcase_24 AC 39 ms
24,368 KB
testcase_25 AC 47 ms
24,280 KB
testcase_26 AC 36 ms
24,252 KB
testcase_27 AC 34 ms
24,436 KB
testcase_28 AC 36 ms
24,280 KB
testcase_29 AC 30 ms
24,468 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/segtree>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int MAXN = 555555;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
    if (p < 0) {
        x = mod_pow(x, M - 2, M);
        p = -p;
    }
    x %= M;
    ll a = 1;
    while (p) {
        if (p % 2)
            a = a * x % M;
        x = x * x % M;
        p /= 2;
    }
    return a;
}

ll mod_inverse(ll a, ll M = MOD) {
    return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
    fact[0] = 1;
    for (ll i = 1; i <= n; i++) {
        fact[i] = i * fact[i - 1] % M;
    }
    rfact[n] = mod_inverse(fact[n], M);
    for (ll i = n - 1; i >= 0; i--) {
        rfact[i] = (i + 1) * rfact[i + 1] % M;
    }
}

//http://drken1215.hatenablog.com/entry/2018/06/08/210000
//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ‚��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
    if (r > n) return 0;
    assert(fact[2] == 2);
    ll ret = fact[n];
    if (rfact[r] == 0) {
        rfact[r] = mod_inverse(fact[r], M);
    }
    ret = (ret * rfact[r]) % M;
    if (rfact[n - r] == 0) {
        rfact[n - r] = mod_inverse(fact[n - r], M);
    }
    ret = (ret * rfact[n - r]) % M;
    return ret;
}

ll nHr(ll n, ll r) {
    return nCr(n + r - 1, r);
}

ll gcd(ll a, ll b) {
    if (b > a) {
        swap(a, b);
    }
    if (b == 0) return a;
    ll r = a % b;
    while (r != 0) {
        a = b;
        b = r;
        r = a % b;
    }
    return b;
}

ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

int dfs(int now, vii &G, vi &used) {
    used[now] = true;
    if (used[G[now][0]]) {
        return 1;
    } else {
        return dfs(G[now][0], G, used) + 1;
    }
}

signed main() {
    int n, p, q;
    cin >> n >> p >> q;

    vii to(2, vi(n));
    rep(i, 2) {
        rep(j, n) {
            if (i == 0) {
                if (j < p) {
                    to[i][j] = p - 1 - j;
                } else {
                    to[i][j] = j;
                }
            } else {
                if (j < n - q) {
                    to[i][j] = j;
                } else {
                    int re = n - 1 - j;
                    re = q - 1 - re;
                    to[i][j] = n - 1 - re;
                }
            }
        }
    }

    int V = 2 * n;
    vii G(V);
    rep(i, 2) {
        rep(j, n) {
            int u = i * n + j;
            int v = (1 - i) * n + to[i][j];
            G[u].push_back(v);
        }
    }

    vi used(V);
    vi g;
    rep(i, V) {
        if (used[i]) {
            continue;
        }
        g.push_back(dfs(i, G, used));
    }

    sort(all(g));
    UNIQUE(g);

    map<int, int> mp;

    for (int x : g) {
        for (int p = 2; p <= x; p++) {
            int cnt = 0;
            while (x % p == 0) {
                x /= p;
                cnt++;
            }
            if (cnt > 0) {
                chmax(mp[p], cnt);
            }
        }
    }

    ll ans = 1;
    for (auto [p, c] : mp) {
        (ans *= mod_pow(p, c)) %= MOD;
    }
    cout << ans % MOD << endl;
}
0