oj.uz

Submission #672024

# Submission time Handle Problem Language Result Execution time Memory
672024 2022-12-14T15:53:43 Z ghostwriter Worst Reporter 3 (JOI18_worst_reporter3) C++17
100 / 100
 564 ms 23372 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int oo = 1e9 + 5;
const int N = 5e5 + 5;
int n, q, d[N];
void input(int test_id) {
	cin >> n >> q;
	FOR(i, 1, n) cin >> d[i];
}
int getp(int i, int t) {
	int times = t / d[i];
	return min(-i + 1LL * d[i] * times, 1LL * oo);
}
void solve(int test_id) {
	d[0] = 1;
	FOR(i, 1, n)
		if (d[i - 1] >= d[i]) d[i] = d[i - 1];
		else d[i] = (d[i] + d[i - 1] - 1) / d[i - 1] * d[i - 1];
	WHILE(q--) {
		int t, l, r;
		cin >> t >> l >> r;
		int lp = 0, rp = n, ansl = -1, ansr = -2;
		WHILE(lp <= rp) {
			int mid = lp + (rp - lp) / 2, npos = getp(mid, t);
			if (npos < l) rp = mid - 1;
			else if (npos > r) lp = mid + 1;
			else {
				ansl = mid;
				rp = mid - 1;
			}
		}
		lp = 0; rp = n;
		WHILE(lp <= rp) {
			int mid = lp + (rp - lp) / 2, npos = getp(mid, t);
			if (npos < l) rp = mid - 1;
			else if (npos > r) lp = mid + 1;
			else {
				ansr = mid;
				lp = mid + 1;
			}
		}
		cout << ansr - ansl + 1 << '\n';
	}
}
void reinit(int test_id) {

}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
3 1
2
5
3
2 2 4
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 512 ms 20760 KB Output is correct
2 Correct 492 ms 20720 KB Output is correct
3 Correct 551 ms 20676 KB Output is correct
4 Correct 554 ms 20796 KB Output is correct
5 Correct 499 ms 20880 KB Output is correct
6 Correct 525 ms 20756 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 340 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 512 ms 20760 KB Output is correct
2 Correct 492 ms 20720 KB Output is correct
3 Correct 551 ms 20676 KB Output is correct
4 Correct 554 ms 20796 KB Output is correct
5 Correct 499 ms 20880 KB Output is correct
6 Correct 525 ms 20756 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 307 ms 19132 KB Output is correct
14 Correct 300 ms 19808 KB Output is correct
15 Correct 298 ms 18572 KB Output is correct
16 Correct 379 ms 19020 KB Output is correct
17 Correct 420 ms 23300 KB Output is correct
18 Correct 414 ms 23304 KB Output is correct
19 Correct 377 ms 23296 KB Output is correct
20 Correct 381 ms 23244 KB Output is correct
21 Correct 443 ms 23256 KB Output is correct
22 Correct 384 ms 23372 KB Output is correct
23 Correct 391 ms 23256 KB Output is correct
24 Correct 404 ms 23368 KB Output is correct
25 Correct 555 ms 20744 KB Output is correct
26 Correct 564 ms 20852 KB Output is correct
27 Correct 429 ms 22868 KB Output is correct
28 Correct 410 ms 23176 KB Output is correct
29 Correct 457 ms 22692 KB Output is correct
30 Correct 519 ms 22784 KB Output is correct
31 Correct 469 ms 23132 KB Output is correct
32 Correct 441 ms 19316 KB Output is correct
33 Correct 1 ms 212 KB Output is correct