oj.uz

답안 #796668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796668 2023-07-28T15:30:08 Z Kahou Worst Reporter 3 (JOI18_worst_reporter3) C++14
19 / 100
 199 ms 20764 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 5e5 +50, LG = 33;
int n, q, m, d[N];
pii P[LG];

int get(int x, int t) {
        int out = 0;
        for (int i = 1; i <= m; i++) {
                int v = t-t%P[i].F;
                if (P[i].S + v < x) break;
                out += min(P[i].S+v-x+1, P[i].S-P[i+1].S);
        }
        return out;
}
void solve() {
        cin >> n >> q;
        d[0] = 1;
        P[++m] = {1, 0};
        for (int i = 1; i <= n; i++) {
                cin >> d[i];
                d[i] = ((d[i]+d[i-1]-1)/d[i-1])*d[i-1];
                if (d[i] != d[i-1]) {
                        P[++m] = {d[i], -i};
                }
        }
        P[m+1].S = -(n+1);
        for (int i = 1; i <= q; i++) {
                int t, l, r;
                cin >> t >> l >> r;
                cout << get(l, t) - get(r+1, t) << endl;
        }
}

int main() {
        ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        solve();
        return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 20764 KB Output is correct
2 Correct 199 ms 20732 KB Output is correct
3 Correct 179 ms 20712 KB Output is correct
4 Correct 179 ms 20696 KB Output is correct
5 Correct 185 ms 20684 KB Output is correct
6 Correct 190 ms 20656 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 20764 KB Output is correct
2 Correct 199 ms 20732 KB Output is correct
3 Correct 179 ms 20712 KB Output is correct
4 Correct 179 ms 20696 KB Output is correct
5 Correct 185 ms 20684 KB Output is correct
6 Correct 190 ms 20656 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Runtime error 1 ms 472 KB Execution killed with signal 8
14 Halted 0 ms 0 KB -