# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127972 | BThero | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 21 ms | 1912 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.
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int MAXN = (int)1e5 + 5;
const ll INF = (ll)1e10;
ll trf[MAXN], lim[MAXN], need[MAXN];
int n, q;
void solve() {
scanf("%d %d", &n, &q);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &lim[i]);
}
trf[0] = 1;
for (int i = 0; i < n; ++i) {
trf[i + 1] = (lim[i + 1] + trf[i] - 1) / trf[i] * trf[i];
}
for (int i = 1; i <= n; ++i) {
need[i] = trf[i] / trf[i - 1];
}
for (int i = 1; i <= q; ++i) {
ll l, r, t, sum = 0;
scanf("%lld %lld %lld", &t, &l, &r);
l -= t;
r -= t;
int ans = 0;
if (l <= sum && sum <= r) {
++ans;
}
for (int j = 1; j <= n; ++j) {
ll cur = trf[j - 1] * (t % need[j]) + 1;
t /= need[j];
sum -= cur;
if (l <= sum && sum <= r) {
++ans;
}
}
printf("%d\n", ans);
}
}
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int tt = 1;
while (tt--) {
solve();
}
return 0;
}
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... |