# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112408 | 2024-11-14T07:21:13 Z | vjudge1 | Baloni (COCI15_baloni) | C++17 | 2000 ms | 3664 KB |
#include <bits/stdc++.h> using namespace std; int main() { int a; cin >> a; vector<int> d(a); for (int i = 0; i < a; i++) { cin >> d[i]; } int s = 0; while (!d.empty()) { int max_value = *max_element(d.begin(), d.end()); auto it = find(d.begin(), d.end(), max_value); int maxi = distance(d.begin(), it); int ua = -1; for (int i = maxi; i < d.size() - 1; i++) { if (d[i] - 1 == d[i + 1]) { d.erase(d.begin() + i); ua = i; i--; } else { break; } } if (ua != -1 && ua < d.size()) { d.erase(d.begin() + ua); } s++; } cout << s; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2050 ms | 336 KB | Time limit exceeded |
2 | Execution timed out | 2071 ms | 336 KB | Time limit exceeded |
3 | Execution timed out | 2039 ms | 336 KB | Time limit exceeded |
4 | Execution timed out | 2045 ms | 336 KB | Time limit exceeded |
5 | Execution timed out | 2072 ms | 3408 KB | Time limit exceeded |
6 | Execution timed out | 2061 ms | 3664 KB | Time limit exceeded |
7 | Execution timed out | 2069 ms | 3152 KB | Time limit exceeded |
8 | Execution timed out | 2065 ms | 3152 KB | Time limit exceeded |
9 | Execution timed out | 2052 ms | 3408 KB | Time limit exceeded |
10 | Execution timed out | 2050 ms | 3408 KB | Time limit exceeded |