# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37381 | HardNut | Money (IZhO17_money) | C++14 | 1500 ms | 48824 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int n, a[N], ans, lst;
set<pair<int, int>> st;
bool us;
int main() {
// freopen("money.in", "r", stdin);
// freopen("money.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (lst == a[i]) {
if (us)
st.erase({a[i], i});
else
st.insert({a[i], i});
continue;
}
st.insert({a[i], i});
us = 0;
lst = a[i];
auto id = st.find({a[i], i});
if (id == st.begin()) {
ans++;
continue;
}
id--;
if ((*id).second == i - 1) {
continue;
}
id = st.lower_bound(make_pair(a[i], -1));
if (id == st.begin()) {
ans++;
continue;
}
id--;
if ((*id).second == i - 1) {
us = 1;
st.erase({a[i], i});
continue;
}
ans++;
}
printf("%d", ans);
}
/**
6
1 5 2 5 5 6
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |