# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1112368 | 2024-11-14T06:46:06 Z | vjudge1 | Baloni (COCI15_baloni) | C++11 | 2000 ms | 3664 KB |
#include <bits/stdc++.h> int main() { int n,count = 0; int max=0,index=0; std::cin >> n; std::vector<int> arr(n,0); for(int &i:arr) std::cin >> i; std::queue<int> q; while(arr.size()>0) { int balon=arr[0]; count++; for(int i=0;i<arr.size();i++) { if(arr[i]==balon) { q.push(i); balon--; } } int katsayi=0; while(!q.empty()) { int x = q.front(); q.pop(); arr.erase(arr.begin()+x-katsayi); katsayi++; } } std::cout << count; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Correct | 2 ms | 444 KB | Output is correct |
3 | Correct | 4 ms | 336 KB | Output is correct |
4 | Correct | 4 ms | 336 KB | Output is correct |
5 | Execution timed out | 2068 ms | 3408 KB | Time limit exceeded |
6 | Execution timed out | 2076 ms | 3664 KB | Time limit exceeded |
7 | Execution timed out | 2078 ms | 3152 KB | Time limit exceeded |
8 | Execution timed out | 2048 ms | 3152 KB | Time limit exceeded |
9 | Execution timed out | 2048 ms | 3576 KB | Time limit exceeded |
10 | Execution timed out | 2072 ms | 3408 KB | Time limit exceeded |