# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
67166 | 2018-08-13T12:51:05 Z | imeimi2000 | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 2000 ms | 6424 KB |
#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <unordered_map> #include <functional> #include <cstring> #include <cmath> #include <ctime> #include <cstdlib> using namespace std; typedef long long llong; typedef long double ld; typedef pair<int, int> pii; typedef pair<llong, llong> pll; int n; llong d[500001]; int getPos(int i, int t) { return i - t / d[i] * d[i]; } int lowbound(int x, int t) { int s = 0, e = n + 1; while (s < e) { int m = (s + e) / 2; if (getPos(m, t) < x) s = m + 1; else e = m; } return s; } int main() { int q; scanf("%d%d", &n, &q); d[0] = 1; for (int i = 1; i <= n; ++i) { scanf("%lld", d + i); d[i] = ((d[i] - 1) / d[i - 1] + 1) * d[i - 1]; } while (q--) { int t, l, r; cin >> t >> l >> r; printf("%d\n", lowbound(-l + 1, t) - lowbound(-r, t)); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2048 ms | 6424 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 6424 KB | Output is correct |
2 | Correct | 8 ms | 6424 KB | Output is correct |
3 | Correct | 7 ms | 6424 KB | Output is correct |
4 | Correct | 7 ms | 6424 KB | Output is correct |
5 | Correct | 5 ms | 6424 KB | Output is correct |
6 | Correct | 6 ms | 6424 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2048 ms | 6424 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |