# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
379269 | 2021-03-17T19:24:16 Z | nafis_shifat | Worst Reporter 3 (JOI18_worst_reporter3) | C++14 | 2000 ms | 24100 KB |
#include<bits/stdc++.h> #define ll long long #define pii pair<int,int> using namespace std; const int mxn=1e5+5; const int inf=1e9; int main() { int n,q; cin >> n >> q; ll d[n + 1]; for(int i = 1; i <= n; i++) cin >> d[i]; ll jump[n + 2]; jump[0] = 1; for(int i = 1; i <= n; i++) { jump[i] = jump[i - 1] * ((d[i] + jump[i - 1] - 1) / jump[i - 1]); } while(q--) { ll t,l,r; cin >> t >> l >> r; int lo = 0; int hi = n; int upb = 1,lwb = -1; while(lo <= hi) { int mid = lo + hi >> 1; ll x = t / jump[mid]; ll p = -mid + x * jump[mid]; if(p <= r) { upb = mid; hi = mid - 1; } else { lo = mid + 1; } } lo = 0; hi = n; while(lo <= hi) { int mid = lo + hi >> 1; ll x = t / jump[mid]; ll p = -mid + x * jump[mid]; if(p >= l) { lwb = mid; lo = mid + 1; } else { hi = mid - 1; } } int ans; if(lwb < upb) ans = 0; else ans = lwb - upb + 1; cout<<ans<<endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2063 ms | 24100 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 364 KB | Output is correct |
2 | Correct | 4 ms | 364 KB | Output is correct |
3 | Correct | 4 ms | 364 KB | Output is correct |
4 | Correct | 4 ms | 364 KB | Output is correct |
5 | Correct | 4 ms | 364 KB | Output is correct |
6 | Correct | 4 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2063 ms | 24100 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |