제출 #379271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379271		nafis_shifat	Worst Reporter 3 (JOI18_worst_reporter3)	C++14	12 / 100	641 ms	11372 KiB

worst_reporter3

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;
int main() {
	int n,q;
	cin >> n >> q;

	ll d[n + 1];
	for(int i = 1; i <= n; i++) scanf("%lld",&d[i]);

	ll jump[n + 2];
    jump[0] = 1;

    for(int i = 1; i <= n; i++) {
    	jump[i] = jump[i - 1] * ((d[i] + jump[i - 1] - 1) / jump[i - 1]);
    	
    }


	while(q--) {
		ll t,l,r;
		scanf("%lld %lld %lld",&t,&l,&r);
		int lo = 0;
		int hi  = n;
		int upb = 1,lwb = -1;

		while(lo <= hi) {
			int mid = lo + hi >> 1;
			ll x = t / jump[mid];
			ll p = -mid + x * jump[mid];
			if(p <= r) {
				upb = mid;
				hi = mid - 1;
			} else {
				lo = mid + 1;
			}
		}


		lo = 0;
		hi = n;
		while(lo <= hi) {
			int mid = lo + hi >> 1;
			ll x = t / jump[mid];
			ll p = -mid + x * jump[mid];
			if(p >= l) {
				lwb = mid;
				lo = mid + 1;
			} else {
				hi = mid - 1;
			}
		}
		int ans;
		if(lwb < upb) ans = 0;
		else ans = lwb - upb + 1;

		printf("%d\n",ans );
	}
	
}

컴파일 시 표준 에러 (stderr) 메시지

worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:31:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |    int mid = lo + hi >> 1;
      |              ~~~^~~~
worst_reporter3.cpp:46:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |    int mid = lo + hi >> 1;
      |              ~~~^~~~
worst_reporter3.cpp:12:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |  for(int i = 1; i <= n; i++) scanf("%lld",&d[i]);
      |                              ~~~~~^~~~~~~~~~~~~~
worst_reporter3.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |   scanf("%lld %lld %lld",&t,&l,&r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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