| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 526531 | 2022-02-15T06:40:40 Z | Mr_Husanboy | Money (IZhO17_money) | C++14 | 1 ms | 208 KB |
// Muallif: Mansuraliyev Husanboy Murotali o'g'li >> NamPS
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define F first
#define S second
// 0-9 >> 48-57; A-Z>>65-90 and a-z>>97-122 respectively;
const int N=1e6+5;
void solve(){
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
int init=0; set<int> st,bef;
st.insert(a[0]); int ans=1;
for(int i=1;i<n;i++){
if(a[i]>=a[i-1]){
init++;st.insert(a[i]);
}else break;
}//cout<<init<<"in\n";
ans++;
bool ok=0; auto k=st.end();
for(int i=init+2;i<n;i++){
if(a[i]==a[i-1]){
continue;
}
if(a[i]>a[i-1]){
bef.insert(a[i-1]);
if(ok==0){
k=st.upper_bound(a[i-1]);
auto k1=st.lower_bound(a[i]);
if(k!=k1){
ans++;ok=0;
for(auto u:bef) st.insert(u);
bef.clear();
}else ok=1;
}else{
auto k1=st.lower_bound(a[i]);
if(k1!=k){
ans++;ok=0;
for(auto u:bef) st.insert(u); bef.clear();
}else ok=1;
}
ok=1;
}else{
ok=0;
st.insert(a[i-1]);
ans++;
}
}
cout<<ans<<"\n";
}
int main(){
ios;
//int t=1; cin>>t; while(t--)
solve();
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 208 KB | Output is correct |
| 2 | Correct | 0 ms | 204 KB | Output is correct |
| 3 | Correct | 0 ms | 204 KB | Output is correct |
| 4 | Correct | 0 ms | 204 KB | Output is correct |
| 5 | Correct | 1 ms | 204 KB | Output is correct |
| 6 | Correct | 1 ms | 204 KB | Output is correct |
| 7 | Correct | 0 ms | 204 KB | Output is correct |
| 8 | Correct | 0 ms | 204 KB | Output is correct |
| 9 | Correct | 0 ms | 204 KB | Output is correct |
| 10 | Correct | 0 ms | 204 KB | Output is correct |
| 11 | Correct | 0 ms | 204 KB | Output is correct |
| 12 | Correct | 0 ms | 204 KB | Output is correct |
| 13 | Correct | 0 ms | 204 KB | Output is correct |
| 14 | Correct | 0 ms | 204 KB | Output is correct |
| 15 | Correct | 0 ms | 204 KB | Output is correct |
| 16 | Correct | 0 ms | 204 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 208 KB | Output is correct |
| 2 | Correct | 0 ms | 204 KB | Output is correct |
| 3 | Correct | 0 ms | 204 KB | Output is correct |
| 4 | Correct | 0 ms | 204 KB | Output is correct |
| 5 | Correct | 1 ms | 204 KB | Output is correct |
| 6 | Correct | 1 ms | 204 KB | Output is correct |
| 7 | Correct | 0 ms | 204 KB | Output is correct |
| 8 | Correct | 0 ms | 204 KB | Output is correct |
| 9 | Correct | 0 ms | 204 KB | Output is correct |
| 10 | Correct | 0 ms | 204 KB | Output is correct |
| 11 | Correct | 0 ms | 204 KB | Output is correct |
| 12 | Correct | 0 ms | 204 KB | Output is correct |
| 13 | Correct | 0 ms | 204 KB | Output is correct |
| 14 | Correct | 0 ms | 204 KB | Output is correct |
| 15 | Correct | 0 ms | 204 KB | Output is correct |
| 16 | Correct | 0 ms | 204 KB | Output is correct |
| 17 | Correct | 0 ms | 204 KB | Output is correct |
| 18 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 19 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 208 KB | Output is correct |
| 2 | Correct | 0 ms | 204 KB | Output is correct |
| 3 | Correct | 0 ms | 204 KB | Output is correct |
| 4 | Correct | 0 ms | 204 KB | Output is correct |
| 5 | Correct | 1 ms | 204 KB | Output is correct |
| 6 | Correct | 1 ms | 204 KB | Output is correct |
| 7 | Correct | 0 ms | 204 KB | Output is correct |
| 8 | Correct | 0 ms | 204 KB | Output is correct |
| 9 | Correct | 0 ms | 204 KB | Output is correct |
| 10 | Correct | 0 ms | 204 KB | Output is correct |
| 11 | Correct | 0 ms | 204 KB | Output is correct |
| 12 | Correct | 0 ms | 204 KB | Output is correct |
| 13 | Correct | 0 ms | 204 KB | Output is correct |
| 14 | Correct | 0 ms | 204 KB | Output is correct |
| 15 | Correct | 0 ms | 204 KB | Output is correct |
| 16 | Correct | 0 ms | 204 KB | Output is correct |
| 17 | Correct | 0 ms | 204 KB | Output is correct |
| 18 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 19 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 208 KB | Output is correct |
| 2 | Correct | 0 ms | 204 KB | Output is correct |
| 3 | Correct | 0 ms | 204 KB | Output is correct |
| 4 | Correct | 0 ms | 204 KB | Output is correct |
| 5 | Correct | 1 ms | 204 KB | Output is correct |
| 6 | Correct | 1 ms | 204 KB | Output is correct |
| 7 | Correct | 0 ms | 204 KB | Output is correct |
| 8 | Correct | 0 ms | 204 KB | Output is correct |
| 9 | Correct | 0 ms | 204 KB | Output is correct |
| 10 | Correct | 0 ms | 204 KB | Output is correct |
| 11 | Correct | 0 ms | 204 KB | Output is correct |
| 12 | Correct | 0 ms | 204 KB | Output is correct |
| 13 | Correct | 0 ms | 204 KB | Output is correct |
| 14 | Correct | 0 ms | 204 KB | Output is correct |
| 15 | Correct | 0 ms | 204 KB | Output is correct |
| 16 | Correct | 0 ms | 204 KB | Output is correct |
| 17 | Correct | 0 ms | 204 KB | Output is correct |
| 18 | Incorrect | 0 ms | 204 KB | Output isn't correct |
| 19 | Halted | 0 ms | 0 KB | - |