# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696991 | 2023-02-07T20:53:16 Z | allllekssssa | Money (IZhO17_money) | C++14 | 1 ms | 468 KB |
#include<bits/stdc++.h> using namespace std; const int maxN = 1e6 + 10; int a[maxN]; int n; int cnt[maxN]; int main() { cin >> n; for (int i = 1; i<=n; i++) { scanf("%d", &a[i]); cnt[a[i]]++; assert(cnt[a[i]] == 1); } int ans = 0; for (int i = 1; i <= n; i++) { if (i < n && a[i] > a[i + 1]) { ++ans; continue; } for (int j = i - 1; j > 0; j--) { if (a[j] > a[i] && a[j] < a[i + 1]) { ++ans; } } } cout << ans + 1 << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
5 | Halted | 0 ms | 0 KB | - |