Submission #57672

#	Time	Username	Problem	Language	Result	Execution time	Memory
57672		Benq	Worst Reporter 3 (JOI18_worst_reporter3)	C++14	19 / 100	1585 ms	263168 KiB

worst_reporter3

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 500005;

ll N,Q, D[MX];

void input() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> Q;
    D[0] = 1;
    FOR(i,1,N+1) {
        cin >> D[i];
        D[i] = ((D[i]+D[i-1]-1)/D[i-1])*D[i-1];
        // cout << D[i] << "\n";
    }
}

ll getPos(ll T, ll M) {
    return (T/D[M])*D[M]-M;
}

ll get(int T, int hi) {
    int L = -1, R = N;
    while (L < R) {
        int M = (L+R+1)/2;
        if (getPos(T,M) >= hi) L = M;
        else R = M-1;
    }
    return L;
    // how many reporters >= position hi 
    // last reporter >= position hi 
}

int main() {
    input();
    F0R(i,Q) {
        int T,L,R; cin >> T >> L >> R;
        cout << get(T,L)-get(T,R+1) << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

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