| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 480504 |
2021-10-16T16:19:05 Z |
2548631 |
Po (COCI21_po) |
C++17 |
|
12 ms |
404 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL)
#define forw(i, l, r) for( int i = (l) ; i < (r) ; i++ )
#define forb(i, r, l) for( int i = (r) ; i >= (l) ; i-- )
#define log2i(x) (64 - __builtin_clzll(1ll * (x)) - 1)
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define Pi acos(-1.0l)
#define sz(x) int(x.size())
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';
int n, ans = 0;
deque<int> s;
int main() {
fastIO;
#ifndef ONLINE_JUDGE
//freopen("test.inp", "r", stdin);
//freopen("test.out", "w", stdout);
#endif
cin >> n;
forw(i, 0, n) {
int x; cin >> x;
while(sz(s) && s.back() >= x) {
if(s.back() > x) ans++;
s.pob();
}
s.pb(x);
}
ans += sz(s);
if(sz(s) && s.front() == 0) ans--;
cout << ans;
return 0;
}
| # |
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 |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
5 ms |
204 KB |
Output is correct |
| 5 |
Correct |
6 ms |
204 KB |
Output is correct |
| 6 |
Correct |
12 ms |
404 KB |
Output is correct |
| 7 |
Correct |
12 ms |
312 KB |
Output is correct |
