Submission #127997

#TimeUsernameProblemLanguageResultExecution timeMemory
127997RockyBWorst Reporter 3 (JOI18_worst_reporter3)C++17
7 / 100
1933 ms95240 KiB
#include <bits/stdc++.h> #define f first #define s second #define pb push_back #define pp pop_back #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() #define rep(a, b, c) for (int a = (b); (a) <= (c); ++a) #define per(a, b, c) for (int a = (b); (a) >= (c); --a) #define nl '\n' #define ioi exit(0); using namespace std; typedef long long ll; const int MAX_N = (int)5e5 + 7; int n, q; int d[MAX_N], l[MAX_N], r[MAX_N], t[MAX_N], ans[MAX_N]; map <int, vector <int> > off; vector <int> d1; struct fenwick { pair <ll, int> f[MAX_N]; void upd(int p, ll df, int t) { for (; p < MAX_N; p |= p + 1) { f[p].f += df; f[p].s += t; } } pair <ll, int> get(int p) { pair <ll, int> res = {0, 0}; for (; p >= 0; p = (p & (p + 1)) - 1) { res.f += f[p].f; res.s += f[p].s; } return res; } } F; pair <ll, int> pref[MAX_N]; pair <int, int> inter(pair <int, int> x, pair <int, int> y) { return {max(x.f, y.f), min(x.s, y.s)}; } ll get_val(int p, int T) { pair <ll, int> cur = F.get(p); //cerr << cur.f << ' ' << T << nl; int one = p - cur.s; /* if (S != -1) { pair <int, int> rng = inter({1, p}, {S, E}); if (rng.f <= rng.s) { // cerr << cur.f << ' ' << one << nl; one -= pref[rng.s].s - pref[rng.f - 1].s; cur.f += pref[rng.s].f - pref[rng.f - 1].f; } } */ return T - (cur.f + one); } int nxt[MAX_N], lst[MAX_N]; void prep() { int last = 1; rep(i, 1, n) { int df = (d[i] + last - 1) / last; lst[i] = df; last *= df; } per(i, n, 1) { if (lst[i] != lst[i + 1]) nxt[i] = i + 1; else nxt[i] = nxt[i + 1]; } } void solve(int T, vector <int> &qr) { int add = T; vector < pair <int, ll > > del; int last = 1; for (int i = 1; i <= n; i = nxt[i]) { int df = (d[i] + last - 1) / last; del.pb({i, 1 + last * (add % df)}); F.upd(i, 1 + last * (add % df), 1); //cerr << 1 + last * (add % df) << ' '; //sum += 1 + last * (add % df); last *= df; add /= df; if (!add) break; } for (auto it : qr) { int L = 0, R = n + 1; int lo = 1, hi = n; while (lo <= hi) { int mid = lo + hi >> 1; if (get_val(mid, T) >= l[it]) L = mid, lo = mid + 1; else hi = mid - 1; } lo = 1, hi = n; while (lo <= hi) { int mid = lo + hi >> 1; if (get_val(mid, T) <= r[it]) R = mid, hi = mid - 1; else lo = mid + 1; } //cerr << R << ' ' << L << nl; if (R <= L) ans[it] += L - R + 1; if (l[it] <= T && T <= r[it]) ans[it]++; //cerr << ans[it] << nl; //ans[it] = upper_bound(all(a), r[it]) - lower_bound(all(a), l[it]); } // cout << ans[2] << nl; for (auto it : del) { F.upd(it.f, -it.s, -1); } } int main() { #ifdef IOI freopen ("in.txt", "r", stdin); freopen ("C.out", "w", stdout); #endif ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> q; d[0] = 1; rep(i, 1, n) { cin >> d[i]; if (d[i] > 1) d1.pb(i); int df = (d[i] + d[i - 1] - 1) / d[i - 1]; pref[i] = pref[i - 1]; if (df > 1) pref[i].f += 1 + d[i - 1], pref[i].s++; } rep(i, 1, q) { cin >> t[i] >> l[i] >> r[i]; off[t[i]].pb(i); } prep(); /* solve(4, off[4]); ioi */ for (auto it : off) { solve(it.f, it.s); } rep(i, 1, q) { cout << ans[i] << nl; } ioi }

Compilation message (stderr)

worst_reporter3.cpp: In function 'void solve(int, std::vector<int>&)':
worst_reporter3.cpp:106:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
       int mid = lo + hi >> 1;
                 ~~~^~~~
worst_reporter3.cpp:112:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
       int mid = lo + hi >> 1;
                 ~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...