| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 977437 | 2024-05-08T02:00:09 Z | shoryu386 | Money (IZhO17_money) | C++17 | 18 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);
}
for (int x = 0; x < n; x++){
}
bitset<1000007> taken;
set<int> valuesTaken;
for (int zzz = 1; zzz <= n; zzz++){
int smallestVal = LLONG_MAX/20, smIndex = -1;
for (int x = 0; x < n; x++){
if (!taken[x] && smallestVal > arr[x]){
smallestVal = arr[x];
smIndex = x;
}
}
int lastVal = arr[smIndex];
taken[smIndex] = 1; vector<int> newval;
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 | 16 ms | 23896 KB | Output is correct |
| 2 | Correct | 15 ms | 23900 KB | Output is correct |
| 3 | Correct | 16 ms | 23904 KB | Output is correct |
| 4 | Correct | 15 ms | 23920 KB | Output is correct |
| 5 | Correct | 15 ms | 23928 KB | Output is correct |
| 6 | Correct | 15 ms | 23900 KB | Output is correct |
| 7 | Correct | 15 ms | 23900 KB | Output is correct |
| 8 | Correct | 18 ms | 24156 KB | Output is correct |
| 9 | Correct | 16 ms | 23900 KB | Output is correct |
| 10 | Incorrect | 17 ms | 23908 KB | Output isn't correct |
| 11 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 16 ms | 23896 KB | Output is correct |
| 2 | Correct | 15 ms | 23900 KB | Output is correct |
| 3 | Correct | 16 ms | 23904 KB | Output is correct |
| 4 | Correct | 15 ms | 23920 KB | Output is correct |
| 5 | Correct | 15 ms | 23928 KB | Output is correct |
| 6 | Correct | 15 ms | 23900 KB | Output is correct |
| 7 | Correct | 15 ms | 23900 KB | Output is correct |
| 8 | Correct | 18 ms | 24156 KB | Output is correct |
| 9 | Correct | 16 ms | 23900 KB | Output is correct |
| 10 | Incorrect | 17 ms | 23908 KB | Output isn't correct |
| 11 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 16 ms | 23896 KB | Output is correct |
| 2 | Correct | 15 ms | 23900 KB | Output is correct |
| 3 | Correct | 16 ms | 23904 KB | Output is correct |
| 4 | Correct | 15 ms | 23920 KB | Output is correct |
| 5 | Correct | 15 ms | 23928 KB | Output is correct |
| 6 | Correct | 15 ms | 23900 KB | Output is correct |
| 7 | Correct | 15 ms | 23900 KB | Output is correct |
| 8 | Correct | 18 ms | 24156 KB | Output is correct |
| 9 | Correct | 16 ms | 23900 KB | Output is correct |
| 10 | Incorrect | 17 ms | 23908 KB | Output isn't correct |
| 11 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 16 ms | 23896 KB | Output is correct |
| 2 | Correct | 15 ms | 23900 KB | Output is correct |
| 3 | Correct | 16 ms | 23904 KB | Output is correct |
| 4 | Correct | 15 ms | 23920 KB | Output is correct |
| 5 | Correct | 15 ms | 23928 KB | Output is correct |
| 6 | Correct | 15 ms | 23900 KB | Output is correct |
| 7 | Correct | 15 ms | 23900 KB | Output is correct |
| 8 | Correct | 18 ms | 24156 KB | Output is correct |
| 9 | Correct | 16 ms | 23900 KB | Output is correct |
| 10 | Incorrect | 17 ms | 23908 KB | Output isn't correct |
| 11 | Halted | 0 ms | 0 KB | - |