oj.uz

Submission #1030003

# Submission time Handle Problem Language Result Execution time Memory
1030003 2024-07-21T15:41:30 Z Khanhcsp2 Po (COCI21_po) C++14
70 / 70
 10 ms 2396 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=2e5+11;
stack<int> s;
int n, a[N];
void sol()
{
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i];
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        while(!s.empty() && s.top()>a[i]) s.pop();
        if(s.empty() || s.top()!=a[i]) if(a[i]) ans++, s.push(a[i]);
    }
    cout << ans;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 7 ms 1012 KB Output is correct
6 Correct 10 ms 2396 KB Output is correct
7 Correct 10 ms 2140 KB Output is correct