# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672661 | 2022-12-17T10:45:22 Z | haxorman | Teams (CEOI11_tea) | C++14 | 251 ms | 20876 KB |
#include <bits/stdc++.h> using namespace std; const int mxN = 1e6 + 7; pair<int,int> arr[mxN]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i].first; arr[i].second = i + 1; } sort(arr, arr + n); vector<vector<int>> ans = {{}}; for (int i = 0; i < n; ++i) { ans.back().push_back(arr[i].second); if (ans.back().size() == arr[i].first) { ans.push_back({}); } } /* for (auto vec : ans) { for (auto x : vec) { cout << x << ' '; } cout << "\n"; } */ if (!ans.back().size()) { ans.pop_back(); } else if (ans.back().size() < arr[n - 1].first) { for (auto& vec : ans) { if (vec.size() + ans.back().size()) { for (auto x : ans.back()) { vec.push_back(x); } break; } } ans.pop_back(); } cout << ans.size() << "\n"; for (auto vec : ans) { cout << vec.size() << ' '; for (auto x : vec) { cout << x << ' '; } cout << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 18 ms | 1868 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 2156 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 177 ms | 14824 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 239 ms | 19284 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 251 ms | 20876 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |