oj.uz

Submission #1046315

# Submission time Handle Problem Language Result Execution time Memory
1046315 2024-08-06T12:52:08 Z GrindMachine Worst Reporter 3 (JOI18_worst_reporter3) C++17
100 / 100
 820 ms 117384 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
read some solutions a long time ago, dont really remember the key ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct sparse_table {
    /*============================*/

    T merge(T a, T b) {
        return max(a,b);
    }

    /*============================*/

    vector<vector<T>> table;
    vector<int> bin_log;
    int LOG = 0;

    sparse_table() {

    }

    sparse_table(vector<T> &a, int n) {
        while ((1 << LOG) <= n) LOG++;

        table = vector<vector<T>>(n, vector<T>(LOG));
        bin_log = vector<int>(n + 1);

        rep(i, n) table[i][0] = a[i];

        rep1(j, LOG - 1) {
            rep(i, n) {
                int jump = 1 << (j - 1);
                if (i + jump >= n) {
                    break;
                }

                table[i][j] = merge(table[i][j - 1], table[i + jump][j - 1]);
            }
        }

        bin_log[1] = 0;
        for (int i = 2; i <= n; ++i) {
            bin_log[i] = bin_log[i / 2] + 1;
        }
    }

    T query(int l, int r) {
        int len = r - l + 1;
        int k = bin_log[len];

        T val1 = table[l][k];
        T val2 = table[r - (1 << k) + 1][k];

        return merge(val1, val2);
    }
};

void solve(int test_case)
{
    ll n,q; cin >> n >> q;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    sparse_table<ll> st(a,n+1);

    while(q--){
        ll t,l,r; cin >> t >> l >> r;
        ll ans = (l <= t and t <= r);
        ll mul = 1;
        ll pos = 0;

        while(pos <= n){
            ll lo = pos+1, hi = n;
            ll first = n+1;

            while(lo <= hi){
                ll mid = (lo+hi) >> 1;
                if(st.query(pos+1,mid) > mul){
                    first = mid;
                    hi = mid-1;
                }
                else{
                    lo = mid+1;
                }
            }

            ll val = (t/mul)*mul;
            ll rx = val-(pos+1);
            ll lx = val-(first-1);
            amax(lx,l);
            amin(rx,r);
            ans += max(rx-lx+1,0ll);

            if(first == n+1) break;
            
            ll k = ceil2(a[first],mul);
            mul *= k;
            ll p = (t/mul)*mul-first;
            ans += (l <= p and p <= r);
            
            pos = first;
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 113492 KB Output is correct
2 Correct 223 ms 114696 KB Output is correct
3 Correct 224 ms 114680 KB Output is correct
4 Correct 221 ms 114772 KB Output is correct
5 Correct 221 ms 114768 KB Output is correct
6 Correct 226 ms 114756 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 113492 KB Output is correct
2 Correct 223 ms 114696 KB Output is correct
3 Correct 224 ms 114680 KB Output is correct
4 Correct 221 ms 114772 KB Output is correct
5 Correct 221 ms 114768 KB Output is correct
6 Correct 226 ms 114756 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 283 ms 113164 KB Output is correct
14 Correct 278 ms 113788 KB Output is correct
15 Correct 260 ms 112468 KB Output is correct
16 Correct 282 ms 113088 KB Output is correct
17 Correct 721 ms 117384 KB Output is correct
18 Correct 703 ms 117328 KB Output is correct
19 Correct 748 ms 117328 KB Output is correct
20 Correct 777 ms 117372 KB Output is correct
21 Correct 715 ms 117204 KB Output is correct
22 Correct 777 ms 117332 KB Output is correct
23 Correct 691 ms 117200 KB Output is correct
24 Correct 690 ms 117336 KB Output is correct
25 Correct 246 ms 114768 KB Output is correct
26 Correct 240 ms 114768 KB Output is correct
27 Correct 704 ms 116824 KB Output is correct
28 Correct 792 ms 117076 KB Output is correct
29 Correct 820 ms 116564 KB Output is correct
30 Correct 812 ms 116820 KB Output is correct
31 Correct 817 ms 116972 KB Output is correct
32 Correct 239 ms 113236 KB Output is correct
33 Correct 0 ms 344 KB Output is correct