# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977431 | 2024-05-08T01:44:40 Z | shoryu386 | Money (IZhO17_money) | C++17 | 1 ms | 348 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]; bitset<1000007> taken; 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; for (int z = smIndex+1; z < n; z++){ if (taken[z] || lastVal > arr[z]) break; else { taken[z] = 1; lastVal = arr[z]; } } bool allTaken = true; for (int x = 0; x < n; x++) if (!taken[x]) allTaken = false; if (allTaken){ cout << zzz; return 0; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |