oj.uz

Submission #237104

# Submission time Handle Problem Language Result Execution time Memory
237104 2020-06-04T16:11:55 Z rqi Worst Reporter 3 (JOI18_worst_reporter3) C++14
100 / 100
 687 ms 41100 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		int mid = (lo+hi)/2; 
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 500005;
ll D[mx];
ll T[mx];
ll L[mx];
ll R[mx];
ll ans[mx];

ll getpos(ll ind, ll t){
	return -ind+t/D[ind]*D[ind];
}

int main() {
	setIO();
	int N, Q;
	cin >> N >> Q;
	for(int i = 1; i <= N; i++){
		cin >> D[i];
	}
	for(int i = 1; i <= Q; i++){
		cin >> T[i] >> L[i] >> R[i];
	}
	D[0] = 1;

	for(int i = 1; i <= N; i++){
		if(D[i-1] >= MOD){
			D[i] = MOD;
			continue;
		}
		D[i] = D[i-1]*((D[i]+D[i-1]-1)/D[i-1]);
	}

	/*for(int i = 0; i <= N; i++){
		dbg(i, D[i]);
	}*/

	for(int i = 1; i <= Q; i++){
		ll hipos = getpos(0, T[i]);
		ll lopos = getpos(N, T[i]);
		//dbg(i, hipos, lopos);
		if(lopos > R[i] || hipos < L[i]){
			ans[i] = 0;
			continue;
		}
		int rval, lval;
		int lo = 0;
		int hi = N;

		while(lo < hi){
			int mid = (lo+hi)/2;
			if(getpos(mid, T[i]) <= R[i]){
				hi = mid;
			}
			else lo = mid+1;
		}
		rval = lo;

		lo = 0;
		hi = N;
		while(lo < hi){
			int mid = (lo+hi)/2+1;
			if(getpos(mid, T[i]) >= L[i]){
				lo = mid;
			}
			else hi = mid-1;
		}

		lval = lo;

		//dbg(i, rval, lval);
		if(rval > lval){
			ans[i] = 0;
			continue;
		}
		ans[i] = lval-rval+1;
	}

	for(int i = 1; i <= Q; i++){
		ps(ans[i]);
	}
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/

Compilation message

worst_reporter3.cpp: In function 'void setIn(std::__cxx11::string)':
worst_reporter3.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
worst_reporter3.cpp: In function 'void setOut(std::__cxx11::string)':
worst_reporter3.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 672 ms 38392 KB Output is correct
2 Correct 672 ms 38392 KB Output is correct
3 Correct 677 ms 38576 KB Output is correct
4 Correct 674 ms 38524 KB Output is correct
5 Correct 680 ms 38520 KB Output is correct
6 Correct 680 ms 38520 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 672 ms 38392 KB Output is correct
2 Correct 672 ms 38392 KB Output is correct
3 Correct 677 ms 38576 KB Output is correct
4 Correct 674 ms 38524 KB Output is correct
5 Correct 680 ms 38520 KB Output is correct
6 Correct 680 ms 38520 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 457 ms 36984 KB Output is correct
14 Correct 471 ms 37496 KB Output is correct
15 Correct 445 ms 36336 KB Output is correct
16 Correct 458 ms 36728 KB Output is correct
17 Correct 572 ms 41080 KB Output is correct
18 Correct 553 ms 41080 KB Output is correct
19 Correct 565 ms 40952 KB Output is correct
20 Correct 560 ms 40952 KB Output is correct
21 Correct 559 ms 40952 KB Output is correct
22 Correct 565 ms 40952 KB Output is correct
23 Correct 568 ms 41100 KB Output is correct
24 Correct 581 ms 40952 KB Output is correct
25 Correct 687 ms 38408 KB Output is correct
26 Correct 670 ms 38392 KB Output is correct
27 Correct 594 ms 40568 KB Output is correct
28 Correct 596 ms 40952 KB Output is correct
29 Correct 580 ms 40440 KB Output is correct
30 Correct 587 ms 40568 KB Output is correct
31 Correct 604 ms 40700 KB Output is correct
32 Correct 589 ms 36984 KB Output is correct
33 Correct 5 ms 384 KB Output is correct