oj.uz

답안 #702391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
702391 2023-02-23T22:22:07 Z urosk Worst Reporter 3 (JOI18_worst_reporter3) C++14
0 / 100
 422 ms 23080 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;

#define maxn 500005
ll n,q;
ll d[maxn];
ll get(ll x,ll t){
    ll l = 1,r = n,mid,rez = 0;
    while(l<=r){
        mid = (l+r)/2;
        if((t/d[mid])*d[mid]-mid>=x) rez = mid,l = mid+1;
        else r = mid-1;
    }
    return rez;
}
void tc(){
    cin >> n >> q;
    for(ll i = 1;i<=n;i++) cin >> d[i];
    for(ll i = 2;i<=n;i++) d[i] = ((d[i]+d[i-1]-1)/d[i-1])*d[i-1];
    while(q--){
        ll l,r,t;
        cin >> l >> r >> t;
        ll L = get(l,t),R = get(r+1,t);
        cout<<L-R<<endl;
    }
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 81.0

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