# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878184 | 2023-11-24T06:51:59 Z | heeheeheehaaw | Money (IZhO17_money) | C++17 | 1 ms | 2496 KB |
#include <bits/stdc++.h> using namespace std; int n, aib[1000005]; int v[1000005]; void update(int poz, int val) { for(int i = poz; i <= 1000000; i += (i & (-i))) aib[i] += val; return; } int query(int poz) { int sum = 0; for(int i = poz; i >= 1; i -= (i & (-i))) sum += aib[i]; return sum; } int main() { map<int, int> m1, m2; cin>>n; for(int i =1 ; i <= n; i++) cin>>v[i], m1[v[i]] = 1; /*int cnt = 0; for(auto it : m1) m2[it.first] = ++cnt; for(int i = 1; i <= n; i++) [i] = m*/ int rez = 1, prev = 0; for(int i = 1; i <= n; i++) { if(v[i] < v[i - 1] || query(v[i]) - query(v[i - 1]) != 0) rez++; prev = v[i]; update(v[i], 1); } cout<<rez; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2496 KB | Output is correct |
4 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2496 KB | Output is correct |
4 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2496 KB | Output is correct |
4 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2496 KB | Output is correct |
4 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |