結果
問題 | No.2857 Div Array |
ユーザー |
👑 ![]() |
提出日時 | 2024-08-26 17:22:35 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 4,259 bytes |
コンパイル時間 | 5,527 ms |
コンパイル使用メモリ | 232,272 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-08-26 17:22:42 |
合計ジャッジ時間 | 6,567 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}vector<vector<ll>> m_mul(vector<vector<ll>> &a, vector<vector<ll>> &b) {ll n = a.size();vector<vector<ll>> ret(n, vector<ll>(n, 0));for (ll i = 0; i < n; i++) {for (ll j = 0; j < n; j++) {for (ll k = 0; k < n; k++) {ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % mod2;}}}return ret;}vector<vector<ll>> p_mul(vector<vector<ll>> a, ll k) {ll n = a.size();vector<vector<ll>> ret(n, vector<ll>(n, 0));for (ll i = 0; i < n; i++) {ret[i][i] = 1;}while (k > 0) {if (k % 2 == 1) {ret = m_mul(a, ret);}a = m_mul(a, a);k /= 2;}return ret;}int main() {ll N, M, K;cin >> N >> M >> K;map<ll, ll> mp;for (ll i = 1; i <= M; i++) {mp[M / i]++;}ll now = 0;for (auto itr = mp.begin(); itr != mp.end(); itr++) {itr->second = now;now++;}vector<vector<ll>> mat(now, vector<ll>(now, 0));for (auto itr = mp.begin(); itr != mp.end(); itr++) {ll idx = itr->second;ll val = itr->first;for (ll j = 1; j <= M; j++) {if (abs(val - M / j) <= K) {mat[idx][mp[M / j]]++;}}}// debug(mat);vector<ll> first(now, 0);for (ll i = 1; i <= M; i++) {first[mp[M / i]]++;}// debug(first);vector<vector<ll>> m_mat = p_mul(mat, N - 1);ll ans = 0;for (ll i = 0; i < now; i++) {for (ll j = 0; j < now; j++) {ans += m_mat[j][i] * first[j];ans %= mod2;}}cout << ans << endl;}