Submission #392065

#	Time	Username	Problem	Language	Result	Execution time	Memory
392065		nathanlee726	Worst Reporter 3 (JOI18_worst_reporter3)	C++14	100 / 100	618 ms	29380 KiB

worst_reporter3

//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
 
//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
 
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod; 
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
int n,q,a[500010],c[500010];
int bs(int l,int r,int x,int ti){
	if(l==r)return l;
	int mi=(l+r+1)/2;
	int tem;
	if(mi!=n+1){
		int tx=ti/c[mi];
		tem=tx*c[mi]-(mi);
		bug(ti,mi,tem);
	}
	else{
		tem=-1e18;
	}
	if(tem>=x)return bs(mi,r,x,ti);
	else return bs(l,mi-1,x,ti);
}
signed main(){
	IOS();
	cin>>n>>q;
	F(n)cin>>a[i];
	int ti=1;
	c[0]=1;
	F(n){
		int x=ceiling(a[i],ti);
		int y=x*ti;
		ti=y;
		c[i+1]=ti; 
		bug(c[i+1]);
	}
	F(q){
		int ti,l,r;
		cin>>ti>>l>>r;
		int cl=bs(-1,n,l,ti),cr=bs(-1,n,r+1,ti);
		bug(cl,cr);
		cout<<cl-cr<<endl;
	}
	return 0;
}

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