| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 491160 |
2021-11-30T16:39:03 Z |
inksamurai |
Po (COCI21_po) |
C++17 |
|
10 ms |
976 KB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3cSpNGp ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int main(){
_3cSpNGp;
int n;
cin>>n;
vi a(n);
rep(i,n){
cin>>a[i];
}
vi stk;
int ans=0;
rep(i,n){
// if(sz(stk)==0){
// stk.pb(a[i]);
// ans=ans+1;
// }else{
// if(a[i]){
// while(sz(stk) and stk.back()>a[i]){
// stk.pop_back();
// }
// if(sz(stk)==0 or stk.back()!=a[i]) ans=ans+1,stk.pb(a[i]);
// }else{
// stk.clear();
// }
// }
while(sz(stk) and stk.back()>a[i]) stk.pop_back();
if(!(sz(stk) and stk.back()==a[i])){
stk.pb(a[i]);
ans=ans+1;
}
}
cout<<ans<<"\n";
//
return 0;
}
| # |
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 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 4 |
Incorrect |
3 ms |
460 KB |
Output isn't correct |
| 5 |
Incorrect |
6 ms |
588 KB |
Output isn't correct |
| 6 |
Correct |
10 ms |
976 KB |
Output is correct |
| 7 |
Incorrect |
9 ms |
588 KB |
Output isn't correct |
