結果
問題 | No.1529 Constant Lcm |
ユーザー | Enjapma_kyopro |
提出日時 | 2021-06-04 20:25:20 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,669 ms / 3,000 ms |
コード長 | 4,242 bytes |
コンパイル時間 | 3,753 ms |
コンパイル使用メモリ | 181,092 KB |
実行使用メモリ | 16,116 KB |
最終ジャッジ日時 | 2024-04-29 23:48:20 |
合計ジャッジ時間 | 19,426 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 4 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 1,443 ms
14,816 KB |
testcase_11 | AC | 521 ms
8,024 KB |
testcase_12 | AC | 23 ms
5,376 KB |
testcase_13 | AC | 1,205 ms
13,184 KB |
testcase_14 | AC | 731 ms
9,796 KB |
testcase_15 | AC | 817 ms
10,116 KB |
testcase_16 | AC | 620 ms
8,776 KB |
testcase_17 | AC | 313 ms
6,272 KB |
testcase_18 | AC | 344 ms
6,528 KB |
testcase_19 | AC | 770 ms
9,956 KB |
testcase_20 | AC | 1,645 ms
16,116 KB |
testcase_21 | AC | 1,615 ms
15,872 KB |
testcase_22 | AC | 1,638 ms
16,108 KB |
testcase_23 | AC | 1,669 ms
15,872 KB |
testcase_24 | AC | 1,654 ms
15,872 KB |
testcase_25 | AC | 1,600 ms
15,872 KB |
コンパイルメッセージ
main.cpp: In function 'bool solve()': main.cpp:143:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 143 | for (auto [prime, num] : r1) { | ^ main.cpp:146:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 146 | for (auto [prime, num] : r2) { | ^ main.cpp:149:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 149 | for (auto [prime, num] : mp) { | ^ main.cpp:154:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 154 | for (auto [prime, num] : mpres) { | ^
ソースコード
#include <bits/stdc++.h> using namespace std; // using mint = long double; // using mint = modint998244353; // using mint = modint1000000007; typedef long long ll; typedef pair<ll, ll> P; typedef pair<ll, P> T; typedef pair<ll, vector<ll>> Pd; const ll INF = 1e18; const ll fact_table = 820000; priority_queue<ll> pql; priority_queue<P> pqp; // big priority queue priority_queue<ll, vector<ll>, greater<ll>> pqls; priority_queue<P, vector<P>, greater<P>> pqps; // small priority queue // top pop ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1}; //↓,→,↑,← #define p(x) cout << x << "\n"; #define el cout << "\n"; #define pe(x) cout << x << " "; #define ps(x) cout << fixed << setprecision(25) << x << endl; #define pu(x) cout << (x); #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define pc(x) cout << x << ","; #define rep(i, n) for (ll i = 0; i < (n); i++) #define rep2(i, a, b) for (ll i = a; i <= (b); i++) #define rep3(i, a, b) for (ll i = a; i >= (b); i--) #define all(c) begin(c), end(c) #define sorti(v) sort(all(v)) #define sortd(v) \ sort(all(v)); \ reverse(all(v)); #define SUM(v) accumulate(all(v), 0LL) #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) typedef vector<ll> vec; typedef vector<vector<ll>> mat; // vec v(n) -> 長さnのベクトルを宣言 // mat dp(h, vec(w)) -> h * w の行列を宣言 // const ll mod = 1000000007ll; const ll mod = 998244353ll; ll mypow(ll a, ll b, ll m = mod) { ll x = 1; while (b) { while (!(b & 1)) { (a *= a) %= m; b >>= 1; } (x *= a) %= m; b--; } return x; } vec rv(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res; } /* ll fact[fact_table + 5], rfact[fact_table + 5]; void c3_init() { fact[0] = rfact[0] = 1; for (ll i = 1; i <= fact_table; i++) { fact[i] = (fact[i - 1] * i) % mod; } rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod); for (ll i = fact_table; i >= 1; i--) { rfact[i - 1] = rfact[i] * i; rfact[i - 1] %= mod; } return; } ll c3(ll n, ll r) { return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod; } */ bool icpc = false; bool multicase = false; ll n, m, k; template <typename T> struct PrimeFact { vector<T> spf; PrimeFact(T N) { init(N); } void init(T N) { // 前処理。spf を求める spf.assign(N + 1, 0); for (T i = 0; i <= N; i++) spf[i] = i; for (T i = 2; i * i <= N; i++) { if (spf[i] == i) { for (T j = i * i; j <= N; j += i) { if (spf[j] == j) { spf[j] = i; } } } } } map<T, T> get(T n) { // nの素因数分解を求める map<T, T> m; while (n != 1) { m[spf[n]]++; n /= spf[n]; } return m; } }; bool solve() { ll n; cin >> n; PrimeFact<ll> prime(n); map<ll, ll> mpres; for (int i = 1; i <= n - 1; i++) { ll a = i, b = n - i; map<ll, ll> mp; auto r1 = prime.get(a), r2 = prime.get(b); for (auto [prime, num] : r1) { mp[prime] += num; } for (auto [prime, num] : r2) { mp[prime] += num; } for (auto [prime, num] : mp) { mpres[prime] = max(num, mpres[prime]); } } ll ans = 1ll; for (auto [prime, num] : mpres) { ans *= mypow(prime, num); ans %= mod; } p(ans); return true; } /* */ int main() { // ios::sync_with_stdio(false); // cin.tie(nullptr); if (icpc) { while (solve()) ; return 0; } ll q, testcase = 1; if (multicase) { cin >> q; } else { q = 1; } while (q--) { // cout << "Case #" << testcase << ": "; solve(); testcase++; } // solve(); return 0; }