# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
127928 | 2019-07-10T08:36:50 Z | BThero | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 21 ms | 2168 KB |
// Why am I so dumb? :c // chrono::system_clock::now().time_since_epoch().count() //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #define pb push_back #define mp make_pair #define all(x) (x).begin(), (x).end() #define fi first #define se second using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef pair<int, int> pii; template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const int MAXN = (int)1e5 + 5; const ll INF = (ll)1e10; ll trf[MAXN], lim[MAXN]; int n, q; void solve() { scanf("%d %d", &n, &q); for (int i = 1; i <= n; ++i) { scanf("%lld", &lim[i]); } trf[1] = lim[1]; for (int i = 1; i <= n; ++i) { trf[i + 1] = (lim[i + 1] + trf[i] - 1) / trf[i]; } for (int i = 1; i <= q; ++i) { ll l, r, t, sum = 0; scanf("%lld %lld %lld", &t, &l, &r); l -= t; r -= t; int ans = 0; if (l <= sum && sum <= r) { ++ans; } for (int j = 1; j <= n; ++j) { ll cur = t % trf[j] + 1; sum -= cur; if (l <= sum && sum <= r) { ++ans; } t /= trf[j]; } printf("%d\n", ans); } } int main() { //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); int tt = 1; while (tt--) { solve(); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 21 ms | 2168 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 21 ms | 2168 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |