Submission #558670

#	Time	Username	Problem	Language	Result	Execution time	Memory
558670		kym	Worst Reporter 3 (JOI18_worst_reporter3)	C++14	100 / 100	574 ms	29252 KiB

worst_reporter3

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = 500005;
int n,q;
int A[MAXN];
int D[MAXN];

int query(int x, int ti) {
	int rep = ti / D[x];
	return rep * D[x];
}

int32_t main() 
{
	IAMSPEED
	cin >> n >> q;
	FOR(i,1,n) {
		cin >> A[i];
		//A[i] ++ ;
	}
	D[0]=1;
	FOR(i,1,n) {
		D[i] = ((A[i]+D[i-1]-1) / D[i-1]) * D[i-1];
	}
	FOR(i,1,n) {
		db2(i,query(i,4)-i);
	}
	dba(D,1,n);
	while(q--) {
		int t,l,r; cin >> t >> l >> r;
		int lo = 0, hi=n+1;
		while(lo<hi-1) {
			int mid=lo+((hi-lo)>>1);
			if(query(mid,t) - mid >= l)lo=mid;
			else hi=mid;
		}
		int lft = lo;
		lo=0,hi=n+1;
		while(lo<hi-1) {
			int mid=lo+((hi-lo)>>1);
			if(query(mid,t) - mid <= r)hi=mid;
			else lo=mid;
		}
		int rgt=hi;
		db2(rgt,lft);
		bool ioichan = 0;
		if(t >=l && t<=r)ioichan=1;
		cout << lft-rgt+1+ioichan << '\n';
	}
}

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