# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331643 | 2020-11-29T11:12:45 Z | vitkishloh228 | Money (IZhO17_money) | C++14 | 1 ms | 364 KB |
#include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; vector<int> q = a; sort(q.begin(), q.end()); vector<int> used(n); for (int i = 0; i < n; ++i) { a[i] = lower_bound(q.begin(), q.end(), a[i]) - q.begin(); while (used[a[i]]) { a[i]++; } used[a[i]] = 1; } int cnt = 1; int last = -1e9; for (int i = 0; i < n; ++i) { if (i == 0) { last = a[i]; } else if (a[i] < a[i-1]) { cnt++; } } cout << cnt; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 0 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 0 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 0 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 0 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |