제출 #361820

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
361820		dolphingarlic	Worst Reporter 3 (JOI18_worst_reporter3)	C++14	100 / 100	380 ms	25512 KiB

worst_reporter3

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

struct Group {
    int l, r;
    ll period;
};

ll d[500001];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    cin >> n >> q;
    vector<Group> groups = {{0, 0, 1}};
    for (int i = 1; i <= n; i++) {
        cin >> d[i];
        ll p = groups.back().period;
        if (d[i] <= p) groups.back().l--;
        else groups.push_back({-i, -i, (d[i] + p - 1) / p * p});
    }
    while (q--) {
        ll l, r, t;
        cin >> t >> l >> r;
        int ans = 0;
        for (Group i : groups) {
            ll mv = t / i.period * i.period;
            ans += max(0ll, min(r, i.r + mv) - max(l, i.l + mv) + 1);
        }
        cout << ans << '\n';
    }
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 81 / 81