oj.uz

Submission #718414

# Submission time Handle Problem Language Result Execution time Memory
718414 2023-04-04T03:40:55 Z pavement Worst Reporter 3 (JOI18_worst_reporter3) C++17
100 / 100
 564 ms 29280 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, Q, D[500005], A[500005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> Q;
	for (int i = 1; i <= N; i++) {
		cin >> D[i];
	}
	A[1] = D[1];
	for (int i = 2; i <= N; i++) {
		A[i] = A[i - 1] * ((D[i] + A[i - 1] - 1) / A[i - 1]);
	}
	for (int i = 1, T, L, R; i <= Q; i++) {
		cin >> T >> L >> R;
		int lo = 1, hi = N, lb = -1;
		while (lo <= hi) {
			int mid = (lo + hi) / 2;
			// find max k s.t. k * A[mid] <= T
			// k = floor(T / A[mid])
			int k = T / A[mid];
			if (k * A[mid] - mid >= L) {
				lb = mid;
				lo = mid + 1;
			} else {
				hi = mid - 1;
			}
		}
		lo = 1, hi = N;
		int rb = -1;
		while (lo <= hi) {
			int mid = (lo + hi) / 2;
			// find max k s.t. k * A[mid] <= T
			// k = floor(T / A[mid])
			int k = T / A[mid];
			if (k * A[mid] - mid <= R) {
				rb = mid;
				hi = mid - 1;
			} else {
				lo = mid + 1;
			}
		}
		if (lb == -1 || rb == -1) cout << (L <= T && T <= R) << "\n";
		else cout << lb - rb + 1 + (L <= T && T <= R) << '\n';
	}
}

Compilation message

worst_reporter3.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main() {
      | ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 26780 KB Output is correct
2 Correct 525 ms 26620 KB Output is correct
3 Correct 554 ms 26572 KB Output is correct
4 Correct 516 ms 26572 KB Output is correct
5 Correct 505 ms 26780 KB Output is correct
6 Correct 564 ms 26824 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 26780 KB Output is correct
2 Correct 525 ms 26620 KB Output is correct
3 Correct 554 ms 26572 KB Output is correct
4 Correct 516 ms 26572 KB Output is correct
5 Correct 505 ms 26780 KB Output is correct
6 Correct 564 ms 26824 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 343 ms 25004 KB Output is correct
14 Correct 310 ms 25744 KB Output is correct
15 Correct 300 ms 24280 KB Output is correct
16 Correct 328 ms 24892 KB Output is correct
17 Correct 390 ms 29176 KB Output is correct
18 Correct 413 ms 29228 KB Output is correct
19 Correct 381 ms 29148 KB Output is correct
20 Correct 390 ms 29088 KB Output is correct
21 Correct 379 ms 29092 KB Output is correct
22 Correct 402 ms 29280 KB Output is correct
23 Correct 386 ms 29124 KB Output is correct
24 Correct 372 ms 29204 KB Output is correct
25 Correct 517 ms 26660 KB Output is correct
26 Correct 523 ms 26588 KB Output is correct
27 Correct 444 ms 28848 KB Output is correct
28 Correct 428 ms 29064 KB Output is correct
29 Correct 418 ms 28696 KB Output is correct
30 Correct 425 ms 28756 KB Output is correct
31 Correct 442 ms 28928 KB Output is correct
32 Correct 402 ms 25136 KB Output is correct
33 Correct 1 ms 340 KB Output is correct