# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
900247 | 2024-01-08T01:45:15 Z | nguyentunglam | Packing Biscuits (IOI20_biscuits) | C++17 | 1000 ms | 600 KB |
#include<bits/stdc++.h> #define fi first #define se second #define endl "\n" #define ii pair<int, int> using namespace std; const int N = 110; long long a[N]; long long count_tastiness(long long x, vector<long long> A) { for(int i = 0; i < A.size(); i++) a[i] = A[i]; long long ret = 1; for(int y = 1; y <= 1e5; y++) { long long tmp = y; long long cur = 0; for(int j = 60; j >= 0; j--) { cur *= 2; if (cur > 1e5) break; if (tmp >> j & 1) cur += x; cur = max(0LL, cur - a[j]); } if (!cur) ret++; // if (!cur) cout << y << endl; } return ret; } #ifdef ngu int main() { freopen ("task.inp", "r", stdin); freopen ("task.out", "w", stdout); int q; cin >> q; while (q--) { long long k, x; cin >> k >> x; vector<long long> a(k); for(int i = 0; i < k; i++) cin >> a[i]; cout << count_tastiness(x, a) << endl; } } #endif // ngu
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 102 ms | 344 KB | Output is correct |
2 | Correct | 77 ms | 348 KB | Output is correct |
3 | Correct | 95 ms | 600 KB | Output is correct |
4 | Correct | 105 ms | 348 KB | Output is correct |
5 | Incorrect | 102 ms | 592 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 103 ms | 408 KB | Output is correct |
2 | Incorrect | 62 ms | 408 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 81 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1088 ms | 344 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 102 ms | 344 KB | Output is correct |
2 | Correct | 77 ms | 348 KB | Output is correct |
3 | Correct | 95 ms | 600 KB | Output is correct |
4 | Correct | 105 ms | 348 KB | Output is correct |
5 | Incorrect | 102 ms | 592 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |