結果
問題 | No.2834 Work to Play |
ユーザー |
👑 ![]() |
提出日時 | 2024-08-02 22:55:20 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 4,281 bytes |
コンパイル時間 | 2,019 ms |
コンパイル使用メモリ | 204,484 KB |
最終ジャッジ日時 | 2025-02-23 20:17:03 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 89 |
ソースコード
#include <bits/stdc++.h>using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (ll i=(ll)(a);i<(ll)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}#include <atcoder/modint>using mint = atcoder::modint998244353;mint solve2(ll K, vector<ll> B, int out = 1){int N = B.size();mint res = 0;rep(i, 0, N){res += (mint)(i + 1) * (mint)(B[i] / K);B[i] %= K;}if (out) cout << res.val() << " ";ll tmp = K;for (int i = N - 1; i >= 0; i--){if (B[i] == 0) continue;ll n_tmp = tmp + B[i];if (n_tmp > K){res += i + 1;n_tmp -= K;}tmp = n_tmp;}return res;}mint solve(ll N, ll A, ll K){mint ans = 0;vector<ll> p = {A};vector<ll> q;while (p.back() != 0) p.push_back((p.back() + A) % K);rep(i, 0, p.size()) q.push_back((A * (i + 1)) / K);ll L = p.size();// 最初の回収ll X = N / L, Y = N % L;mint base1 = 0;mint base2 = 0;mint tmp;rep(i, 0, L) base1 += (mint)(i + 1) * q[i];rep(i, 0, L) base2 += (mint)(L) * q[i];ans += base1 * X;ans += base2 * (mint)(X) * (mint)(X - 1) / 2;rep(i, 0, Y){ans += (mint)(i + 1 + X * L) * q[i];ans += (mint)(i + 1 + X * L) * (mint)(X) * (mint)(A * L / K);}tmp = ((mint)(L + 1) * (mint)(L)) / 2;tmp *= ((mint)(X) * (mint)(X - 1)) / 2;ans += tmp * (mint)(A * L / K);tmp = (mint)(L) * (mint)(A * L / K) * (mint)(L);tmp *= ((mint)(X - 1) * (mint)(X) * (mint)(2 * X - 1)) / 6;ans += tmp;// cout << ans.val() << " ";// 最後の回収// 2 * (K - 1) * K 台回収するループになるはず// 2 * K 個は流石に連続なので、そこで区切って残りを愚直// 2 * K 個の置き場にあるカートの総和は、2 * K * K * (L - 1) / 2L = K * ((L - 1) * K / L)vector<ll> r;rep(i, 0, 2 * K){r.push_back(abs((N - i) % K) * A % K);}reverse(all(r));base1 = solve2(K, r, 0);r.clear();rep(i, 0, N % (2 * K)) r.push_back((i + 1) * A % K);ans += solve2(K, r, 0);// cout << ans.val() << " " << base1.val() << " ";X = N / (K * 2);ans += base1 * X;tmp = (mint)(L - 1) * (mint)(K / L);ans += tmp * (mint)(X) * (N % (2 * K));ans += (mint)(X) * (mint)(X - 1) * (mint)(tmp) * (mint)(K);// 出力return ans;}// CYAN / FREDERICint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;// cin >> t;rep(i, 0, t){ll N, A, K;cin >> N >> A >> K;// cout << (solve2(K, B) * 2).val() << "\n";cout << (solve(N, A, K) * 2).val() << "\n";}}