# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
732321 | 2023-04-29T01:39:48 Z | vjudge1 | Baloni (COCI15_baloni) | C++17 | 2000 ms | 3796 KB |
#include <bits/stdc++.h> #define sts stable_sort #define B begin() #define rB rbegin() #define E end() #define rE rend() #define F first #define S second #define pb push_back #define ppb pop_back() #define pf push_front #define ppf pop_front() #define eb emplace_back #define ll long long #define ui unsigned int #define ull unsigned long long using namespace std; const int MAXN = 1e4 + 4; const int MOD = 1e9 + 7; const ll INF = 9223372036854775807LL; const ll inf = 2147483647; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> v(n); for(int i = 0; i < n; i++){ cin >> v[i]; } vector<pair<int,int> > ans; for(int i = 0; i < n; i++){ bool a = 0; for(int j = 0; j < ans.size(); j++){ if(v[i] < ans[j].S && i > ans[j].F && ans[j].S >= 1){ ans[j].S--; a = 1; break; } } if(!a){ ans.pb({i, v[i]}); } sts(ans.rbegin(), ans.rend()); } cout << ans.size() << "\n"; return 0; } /** **/
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Incorrect | 2 ms | 340 KB | Output isn't correct |
4 | Incorrect | 4 ms | 340 KB | Output isn't correct |
5 | Execution timed out | 2076 ms | 3420 KB | Time limit exceeded |
6 | Execution timed out | 2078 ms | 3796 KB | Time limit exceeded |
7 | Execution timed out | 2060 ms | 3284 KB | Time limit exceeded |
8 | Execution timed out | 2068 ms | 3192 KB | Time limit exceeded |
9 | Execution timed out | 2079 ms | 3344 KB | Time limit exceeded |
10 | Execution timed out | 2075 ms | 3464 KB | Time limit exceeded |