# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47456 | Just_Solve_The_Problem | Worst Reporter 3 (JOI18_worst_reporter3) | C++11 | 1380 ms | 262144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random rand() ^ (rand() << 5)
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
int n, q;
ll d[N];
pair < ll, ll > ar[N];
ll pos[N];
bool fl = 1;
void solve1() {
while (q--) {
int t, l, r;
scanf("%d %d %d", &t, &l, &r);
int tl = -n + t;
int tr = t;
int ans = 0;
if (tl <= l && r <= tr) {
ans = r - l + 1;
} else if (l <= tl && tr <= r) {
ans = tr - tl + 1;
} else if (tr >= l && l > tl) {
ans = tr - l + 1;
} else if (tl <= r && tr > r) {
ans = r - tl + 1;
}
printf("%d\n", ans);
}
}
void solve2() {
ar[0] = {1, 1};
for (int i = 1; i <= n; i++) {
ar[i].sc = (d[i] + ar[i - 1].sc - 1) / ar[i - 1].sc * ar[i - 1].fr;
ar[i].fr = (ar[i].sc / ar[i - 1].fr * ar[i - 1].sc + (-(i - 1))) - 1 - (-i);
}
while (q--) {
int t, l, r;
scanf("%d %d %d", &t, &l, &r);
for (int i = 0; i <= n; i++) {
pos[i] = t / ar[i].sc * ar[i].fr + (-i);
}
int ans = 0;
for (int i = 0; i <= n; i++) {
if (pos[i] >= l && pos[i] <= r) {
ans++;
}
}
printf("%d\n", ans);
}
}
ll getpos(int in, ll t) {
return t / ar[in].sc * ar[in].fr + (-in);
}
int getans(ll t, ll L, ll R) {
int l = 0;
int r = n;
int tl, tr;
if (getpos(0, t) < L) return 0;
if (getpos(n, t) > R) return 0;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (getpos(mid, t) <= R) {
r = mid;
} else {
l = mid;
}
}
if (getpos(l, t) <= R) {
r = l;
}
if (getpos(r, t) < L) {
return 0;
}
tl = r;
l = 0;
r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (getpos(mid, t) >= L) {
l = mid;
} else {
r = mid;
}
}
if (getpos(r, t) >= L) {
l = r;
}
if (getpos(l, t) > R) {
return 0;
}
tr = l;
return abs(tr - tl) + 1;
}
void solve3() {
ar[0] = {1, 1};
for (int i = 1; i <= n; i++) {
ar[i].sc = (d[i] + ar[i - 1].sc - 1) / ar[i - 1].sc * ar[i - 1].fr;
ar[i].fr = (ar[i].sc / ar[i - 1].fr * ar[i - 1].sc + (-(i - 1))) - 1 - (-i);
}
while (q--) {
ll t, l, r;
scanf("%lld %lld %lld", &t, &l, &r);
printf("%d\n", getans(t, l, r));
}
}
main() {
scanf("%d %d", &n, &q);
for (int i = 1; i <= n; i++) {
scanf("%lld", &d[i]);
fl &= (d[i] == 1);
}
if (fl) {
solve1();
} else if (n <= 1000) {
solve2();
} else {
solve3();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |