提出 #74619094

---

ソースコード 拡げる

/*
Author:
    interstellar
site:
    AtGuesses.com
*/
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#define ll long long
#define umap unordered_map
#define uset unordered_set
constexpr int inf = (int)1e9 + 5;
constexpr ll  llinf = (ll)1e18 + 5;
// constexpr int mod = ((int)1e9+7);
constexpr int mod = 998244353;

using namespace std;
#define vll vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vvi vector<vi>
#define vvll vector<vll>

void test_case(){
    int m, s;
    cin >> m >> s;
    vll a(m + 1);
    for (int i = 1; i <= m; i++){
        cin >> a[i];
        a[i] += s / m + (s % m >= i);
    }

    for (int i = 1; i <= m; i++)a[i] += a[i - 1];

    int n;
    cin >> n;
    while (n--){
        int l, r;
        cin >> l >> r;
        cout << a[r] - a[l - 1] << "\n";
    }
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    test_case();

    return 0;
}
/*
*/

提出情報

ジャッジ結果