# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
377068 |
2021-03-12T23:01:28 Z |
Pichon5 |
Po (COCI21_po) |
C++17 |
|
44 ms |
492 KB |
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//gcd(a,b)=gcd(a-b,b) a>=b
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
//__builtin_popcount(x)
using namespace std;
int main()
{
int n,x;
cin>>n;
stack<int>st,clean;
int res=0;
for(int i=0;i<n;i++){
cin>>x;
if(x==0){
st=clean;
continue;
}
if(st.empty()){
st.push(x);
res++;
continue;
}
while(!st.empty()){
int val=st.top();
if(val==x)break;
if(val<x){
res++;
st.push(x);
break;
}
st.pop();
}
if(st.empty()){
res++;
st.push(x);
}
}
cout<<res<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
11 ms |
364 KB |
Output is correct |
5 |
Correct |
16 ms |
364 KB |
Output is correct |
6 |
Correct |
43 ms |
492 KB |
Output is correct |
7 |
Correct |
44 ms |
364 KB |
Output is correct |