oj.uz

답안 #203265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203265 2020-02-20T02:18:07 Z tri Worst Reporter 3 (JOI18_worst_reporter3) C++14
12 / 100
 2000 ms 23544 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 5e5 + 10;
ll d[MAXN], c[MAXN];

int N, Q;

ll fPos(int i, ll t) {
    ll step = t / c[i];
    return -i + step * c[i];
}

// returns number of people with position >= lBound
ll searchAfter(ll lBound, ll t) {
    int low = 0;
    int hi = N + 1;

    while (low != hi) {
        int mid = (low + hi) / 2;

        if (fPos(mid, t) >= lBound) {
            low = mid + 1;
        } else {
            hi = mid;
        }
    }
    return low;
}


int main() {
    cin >> N >> Q;

    for (int i = 1; i <= N; i++) {
        cin >> d[i];
    }
    c[0] = 1;
    for (int i = 1; i <= N; i++) {
        ll step = (d[i] + c[i - 1] - 1) / c[i - 1];
        c[i] = step * c[i - 1];
    }

    for (int q = 0; q < Q; q++) {
        ll t, l, r;
        cin >> t >> l >> r;

        ll lCnt = searchAfter(l, t);
        ll rCnt = searchAfter(r + 1, t);

        ll cnt = lCnt - rCnt;
        cout << cnt << endl;
    }
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2027 ms 23544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 11 ms 376 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 11 ms 408 KB Output is correct
6 Correct 8 ms 380 KB Output is correct

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2027 ms 23544 KB Time limit exceeded
2 Halted 0 ms 0 KB -