Submission #56859

#TimeUsernameProblemLanguageResultExecution timeMemory
56859ksun48Worst Reporter 3 (JOI18_worst_reporter3)C++14
12 / 100
2053 ms11392 KiB
#include <bits/stdc++.h> using namespace std; typedef long long LL; vector<LL> d; vector<LL> jump; LL where(LL t, LL m){ LL r = t % jump[m]; LL curpos = t - r - m - 1; return curpos; } LL get(LL t, LL pos){ // at time t how many people are >= pos; LL s = -1; // yes LL e = d.size(); // no while(s + 1 < e){ LL m = (s + e) / 2; // where is person m at certain time. if(where(t,m) >= pos){ s = m; } else { e = m; } } return e + (t >= pos); } int main(){ cin.sync_with_stdio(0); LL n; LL q; cin >> n >> q; d.resize(n); jump.resize(n); LL prev = 1; for(int i = 0; i < n; i++){ cin >> d[i]; LL numc = (d[i] + prev - 1) / prev; jump[i] = prev * numc; prev = jump[i]; } for(int i = 0; i < q; i++){ LL t, l, r; cin >> t >> l >> r; cout << get(t,l) - get(t,r+1) << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...