Submission #772132

#	Time	Username	Problem	Language	Result	Execution time	Memory
772132		bachhoangxuan	Worst Reporter 3 (JOI18_worst_reporter3)	C++17	100 / 100	265 ms	25288 KiB

worst_reporter3

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1e9;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,q;cin >> n >> q;
    vector<int> d(n+1);
    for(int i=1;i<=n;i++) cin >> d[i];
    int cur=d[1],l=1,r=0;
    vector<tuple<int,int,int>> p;
    while(l<=n){
        while(r+1<=n && d[r+1]<=cur) r++;
        p.push_back({cur,l,r});l=r+1;
        if(l==n+1) break;
        cur*=((d[l]-1)/cur+1);
    }
    for(int i=1;i<=q;i++){
        int t,ans=0;cin >> t >> l >> r;
        ans+=(l<=t && t<=r);
        for(auto &[x,lt,rt]:p){
            int add=(t/x)*x;
            ans+=max(0LL,min(r,-lt+add)-max(l,-rt+add)+1);
            cur*=2;
        }
        cout << ans << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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