# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642913 | 2022-09-20T18:56:02 Z | valerikk | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 2000 ms | 6456 KB |
#include <cstdio> #define MAXN 500005 #define MAXT 1000000001 int N, Q; int D[MAXN]; int W[MAXN], C[MAXN]; int count(int T, int L) { int res = (T >= L); int X = T; for (int i = 1; i <= N; ++i) { int r = T % C[i]; T /= C[i]; X -= r * W[i] + 1; res += (X >= L); } return res; } int main() { scanf("%d%d", &N, &Q); for (int i = 1; i <= N; ++i) { scanf("%d", &D[i]); } W[1] = 1; C[1] = D[1]; for (int i = 2; i <= N; ++i) { W[i] = C[i - 1] * W[i - 1]; C[i] = (D[i] + W[i] - 1) / W[i]; } while (Q--) { int T, L, R; scanf("%d%d%d", &T, &L, &R); printf("%d\n", count(T, L) - count(T, R + 1)); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2078 ms | 6456 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 212 KB | Output is correct |
2 | Correct | 10 ms | 332 KB | Output is correct |
3 | Correct | 10 ms | 336 KB | Output is correct |
4 | Correct | 10 ms | 212 KB | Output is correct |
5 | Correct | 10 ms | 212 KB | Output is correct |
6 | Correct | 10 ms | 336 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2078 ms | 6456 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |