Submission #972358

#	Time	Username	Problem	Language	Result	Execution time	Memory
972358		LCJLY	Worst Reporter 3 (JOI18_worst_reporter3)	C++14	100 / 100	459 ms	25620 KiB

worst_reporter3

#include <bits/stdc++.h>
using namespace std;
	
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
 
void solve(){
	int n,q;
	cin >> n >> q;
	int arr[n+5];
	for(int x=1;x<=n;x++){
		cin >> arr[x];
	}
	
	for(int x=2;x<=n;x++){
		int multi=(arr[x]+arr[x-1]-1)/arr[x-1];
		arr[x]=min((int)INT_MAX,arr[x-1]*multi);
	}
	arr[0]=1;
	
	int temp,temp2,temp3;
	for(int x=0;x<q;x++){
		cin >> temp >> temp2 >> temp3;
		//find temp2
		int l=0;
		int r=n;
		int best=-1;
		int mid;
		while(l<=r){
			mid=(l+r)/2;
			int pos=-mid+(temp/arr[mid])*arr[mid];
			if(pos>=temp2){
				best=mid;
				l=mid+1;
			}
			else{
				r=mid-1;
			}
		}
		//show(best,best);
		
		l=0;
		r=n;
		int best2=-1;
		while(l<=r){
			mid=(l+r)/2;
			int pos=-mid+(temp/arr[mid])*arr[mid];
			if(pos>temp3){
				best2=mid;
				l=mid+1;
			}
			else r=mid-1;
		}
		//show2(best,best,best2,best2);
		
		cout << max(0LL,(best-best2)) << "\n";
		
	}
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//freopen("in.txt","r",stdin);
	//cin >> t;
	while(t--){
		solve();
	}
}

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