oj.uz

답안 #679102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679102 2023-01-07T13:13:17 Z Ronin13 Worst Reporter 3 (JOI18_worst_reporter3) C++14
0 / 100
 601 ms 32476 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<ll,ll>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
const int nmax = 2e5 + 1;


int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int q; cin >> q;
    ll t[n + 1], d[n + 1], x[n + 1];
    t[0] = 1, x[0] = 1;
    for(int i = 1; i <= n; i++)
        cin >> d[i];
    for(int i = 1; i <= n; i++){
        if(d[i] < x[i - 1]) x[i] = x[i - 1], t[i] = t[i - 1];
        else{
            ll v = (d[i] + x[i - 1] - 1) / x[i - 1];
            t[i] = t[i - 1] * v;
            x[i] = v * x[i - 1];
        }
    }
    for(int i= 1; i <= n; i++){
        cout << x[i] << ' '  << t[i] << "\n";
    }
    while(q--){
        ll T, L, R; cin >> T >> L >> R;
        ll l = -1, r = n + 1;
        while(l + 1 < r){
            ll mid = (l + r) / 2;
            ll u = T / t[mid];
            if(-mid + x[mid] * u >=L) l = mid;
            else r = mid;
        }
        int X = l;
        l = -1, r = n + 1;
        while(l + 1 < r){
            ll mid = (l + r) / 2;
            ll u = T / t[mid];
            if(-mid + x[mid] * u <= R) r = mid;
            else l = mid;
        }
        cout << max((int)X - (int)r + 1, 0) << "\n";
    }
    return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 601 ms 32476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 601 ms 32476 KB Output isn't correct
2 Halted 0 ms 0 KB -