oj.uz

Submission #972358

# Submission time Handle Problem Language Result Execution time Memory
972358 2024-04-30T11:26:40 Z LCJLY Worst Reporter 3 (JOI18_worst_reporter3) C++14
100 / 100
 459 ms 25620 KB 
#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.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 22228 KB Output is correct
2 Correct 436 ms 22712 KB Output is correct
3 Correct 444 ms 22772 KB Output is correct
4 Correct 440 ms 22864 KB Output is correct
5 Correct 432 ms 22636 KB Output is correct
6 Correct 459 ms 22916 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 22228 KB Output is correct
2 Correct 436 ms 22712 KB Output is correct
3 Correct 444 ms 22772 KB Output is correct
4 Correct 440 ms 22864 KB Output is correct
5 Correct 432 ms 22636 KB Output is correct
6 Correct 459 ms 22916 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 255 ms 21308 KB Output is correct
14 Correct 259 ms 21868 KB Output is correct
15 Correct 249 ms 20720 KB Output is correct
16 Correct 278 ms 21148 KB Output is correct
17 Correct 328 ms 25472 KB Output is correct
18 Correct 329 ms 25172 KB Output is correct
19 Correct 323 ms 25244 KB Output is correct
20 Correct 321 ms 25212 KB Output is correct
21 Correct 329 ms 25360 KB Output is correct
22 Correct 347 ms 25352 KB Output is correct
23 Correct 337 ms 25168 KB Output is correct
24 Correct 337 ms 25360 KB Output is correct
25 Correct 436 ms 22872 KB Output is correct
26 Correct 439 ms 22676 KB Output is correct
27 Correct 356 ms 24916 KB Output is correct
28 Correct 354 ms 25212 KB Output is correct
29 Correct 360 ms 24660 KB Output is correct
30 Correct 372 ms 24888 KB Output is correct
31 Correct 362 ms 25620 KB Output is correct
32 Correct 336 ms 21412 KB Output is correct
33 Correct 0 ms 348 KB Output is correct