# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
977453 | 2024-05-08T02:23:32 Z | shoryu386 | Money (IZhO17_money) | C++17 | 21 ms | 24156 KB |
#include <bits/stdc++.h> using namespace std; #define int long long main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; //attempt greedy int arr[n]; for (int x = 0; x < n; x++) cin >> arr[x]; vector<int> dc[1000007]; for (int x = 0; x < n; x++){ dc[arr[x]].push_back(x); } bitset<1000007> taken; set<int> valuesTaken; for (int zzz = 1; zzz <= n; zzz++){ int smIndex = -1; for (int x = 0; x < n; x++){ if (!taken[x]){ smIndex = x; break; } } int lastVal = arr[smIndex]; taken[smIndex] = 1; vector<int> newval; newval.push_back(arr[smIndex]); for (int z = smIndex+1; z < n; z++){ if (taken[z] || lastVal > arr[z]) break; bool die = false; for (auto y : valuesTaken){ if (lastVal <= y && y < arr[z]){ die = true; break; } } if (die) break; taken[z] = 1; lastVal = arr[z]; newval.push_back(arr[z]); } for (auto y : newval){ valuesTaken.insert(y); } bool allTaken = true; for (int x = 0; x < n; x++) if (!taken[x]) allTaken = false; if (allTaken){ cout << zzz; return 0; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23896 KB | Output is correct |
2 | Correct | 16 ms | 23900 KB | Output is correct |
3 | Correct | 15 ms | 23900 KB | Output is correct |
4 | Incorrect | 21 ms | 24156 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23896 KB | Output is correct |
2 | Correct | 16 ms | 23900 KB | Output is correct |
3 | Correct | 15 ms | 23900 KB | Output is correct |
4 | Incorrect | 21 ms | 24156 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23896 KB | Output is correct |
2 | Correct | 16 ms | 23900 KB | Output is correct |
3 | Correct | 15 ms | 23900 KB | Output is correct |
4 | Incorrect | 21 ms | 24156 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23896 KB | Output is correct |
2 | Correct | 16 ms | 23900 KB | Output is correct |
3 | Correct | 15 ms | 23900 KB | Output is correct |
4 | Incorrect | 21 ms | 24156 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |