# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
608802 | 2022-07-27T10:17:34 Z | pakhomovee | Gift (IZhO18_nicegift) | C++17 | 402 ms | 78720 KB |
#include <iostream> #include <vector> #include <string> #include <iomanip> #include <algorithm> #include <set> #include <numeric> #include <queue> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> a(n); for (int& i : a) cin >> i; vector<int> b(n, 0); priority_queue<pair<int, int>> q; vector<pair<int, vector<int>>> act; for (int i = 0; i < n; ++i) q.push({ a[i], i }); while (q.size() >= k) { vector<int> pos; for (int j = 0; j < k; ++j) { pos.push_back(q.top().second); q.pop(); } for (int i : pos) { ++b[i]; if (b[i] < a[i]) { q.push({ a[i] - b[i], i }); } } act.push_back({ 1, pos }); } if (q.empty()) { for (pair<int, vector<int>> x : act) { cout << x.first << ' '; for (int j : x.second) { cout << j + 1 << ' '; } cout << '\n'; } } else { cout << -1; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Taken too much stones from the heap |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Taken too much stones from the heap |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Taken too much stones from the heap |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 402 ms | 78720 KB | Jury has the answer but participant has not |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Taken too much stones from the heap |
2 | Halted | 0 ms | 0 KB | - |