# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
533222 |
2022-03-05T06:56:22 Z |
kebine |
Money (IZhO17_money) |
C++17 |
|
1 ms |
204 KB |
#include <bits/stdc++.h>
using namespace std;
#define nyahalo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define otsumiko exit(0);
#define mikodanye priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<pair<long long, long long> > >
#define mikochi priority_queue<long long, vector<long long>, greater<long long> >
int main() {
nyahalo
long long n;
cin >> n;
long long ans = 1, a, pv;
set<long long> st;
for (long long i=1; i<=n; i++) {
cin >> a;
if (i > 1) {
auto it = st.lower_bound(a);
if (it == st.begin()) {
ans++;
} else {
it--;
if (*it < pv) {
it++;
if (it == st.end()) {
ans++;
} else if (*it != pv || *it>a){
ans++;
}
}
}
}
st.insert(a);
pv = a;
}
cout << ans << "\n";
otsumiko
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |