提出 #74619745

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#include <climits>
#define no cout << "No" << endl;
#define yes cout << "Yes" <<endl;
using ll = long long ;
using P=pair<int,int>;
//N×M vector<vector<int>> A(N,vector<int>(M)); A[i][j] A.push_back(data);
//sort (b.begin(),b.end()); if(b.size() >=2);
//int keta = to_string(b).length(); pow(10,keta);
//set<int> a; a.insert(da); a.count(da) for(auto v: a)
//using P=pair<int,int>;vector<P> c;c.emplace_back(da,i) //index保持
//auto dfs =[&](auto f, int i, int j) -> void {};
//b ha kihon zentansaku
//shoujin houhou komentodake nokosite mosha
//set<pair<int,int>> st;st.insert({r,c});st.count({x,y})

int main() {
    int m,s;
    cin >> m >> s;
    vector<int> B(m);
    rep(i,m)cin >> B[i];

    int q = s/m; int r = s%m;

    rep(i,m){
        if(i < r)B[i] +=(q+1);
        else B[i] +=q;
    }
    vector<ll> rui(m+1);
    rep(i,m)rui[i+1] = rui[i] + B[i];


    int n;cin >> n;
    rep(i,n){
        int L,R;
        cin >> L >> R;
        L--;R--;
        cout << rui[R+1] - rui[L] <<'\n';
    }
}

提出情報

ジャッジ結果