#1161424 (C++17) No.3516 Very Large Range Mod

• 問題: No.3516 Very Large Range Mod
• ユーザー: 👑 potato167
• 提出日時: 2026-04-24 22:23:01
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 184 ms / 2,000 ms
• コード長: 3,222 bytes
• コンパイル時間: 1,296 ms
• コンパイル使用メモリ: 220,548 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-04-24 22:23:14
• 合計ジャッジ時間: 8,261 ms
• ジャッジサーバーID （参考情報）: judge4_1 / judge2_1

ファイルパターン	結果
sample	AC * 3
other	AC * 30

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int 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(b<a){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=false){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+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include<atcoder/modint>
using mint = atcoder::modint;
#include<atcoder/math>

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, K, M;
    cin >> N >> K >> M;
    mint::set_mod(M);
    vector<int> B(N), C(N);
    rep(i, 0, N) cin >> B[i];
    rep(i, 0, N) cin >> C[i];
    ll ans = 0;
    mint sum = 0;
    int l_ind = 0, l_val = 0;
    int r_ind = 0, r_val = 0;
    {
        int tmp = K;
        while (tmp) {
            if (tmp >= B[r_ind]) {
                sum += (mint(C[r_ind])) * B[r_ind];
                tmp -= B[r_ind];
                r_ind++;
            }
            else {
                sum += (mint(C[r_ind])) * tmp;
                r_val = tmp;
                break;
            }
        }
    }
    auto f = [&](int base, int dif, int len) -> void {
        ans += atcoder::floor_sum(len, M, dif, base);
        ans -= atcoder::floor_sum(len, M, dif, base - 1);
    };
    while (r_ind != N) {
        // cout << l_ind << " " << l_val << " " << r_ind << " " << r_val << endl;
        int ad = min(B[l_ind] - l_val, B[r_ind] - r_val);
        f(sum.val(), (mint(C[r_ind] - C[l_ind])).val(), ad);
        l_val += ad;
        r_val += ad;
        sum += (mint(C[r_ind] - C[l_ind])) * ad;
        if (B[l_ind] == l_val) {
            l_ind++;
            l_val = 0;
        }
        if (B[r_ind] == r_val) {
            r_ind++;
            r_val = 0;
        }
    }
    if (sum.val() == 0) ans++;
    cout << ans << "\n";
}