# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481435 | 2021-10-20T19:56:39 Z | MilosMilutinovic | Po (COCI21_po) | C++14 | 12 ms | 1700 KB |
#include <bits/stdc++.h> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++) #define per(i,a,n) for (int i=n-1;i>=a;i--) #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second #define SZ(x) ((int)(x).size()) typedef vector<int> VI; typedef long long ll; typedef pair<int,int> PII; typedef double db; mt19937 mrand(random_device{}()); const ll mod=1000000007; int rnd(int x) { return mrand() % x;} ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;} // head const int N=101000; int n,a[N]; int main() { scanf("%d",&n); rep(i,0,n) scanf("%d",a+i); stack<int> stk; int ans=0; rep(i,0,n) { while (!stk.empty()&&stk.top()>a[i]) stk.pop(); if (SZ(stk)&&stk.top()==a[i]) continue; if (a[i]!=0) ans++,stk.push(a[i]); } printf("%d",ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 5 ms | 588 KB | Output is correct |
5 | Correct | 7 ms | 700 KB | Output is correct |
6 | Correct | 12 ms | 1700 KB | Output is correct |
7 | Correct | 11 ms | 1460 KB | Output is correct |