| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 382741 |
2021-03-28T06:27:42 Z |
ne4eHbKa |
Po (COCI21_po) |
C++17 |
|
14 ms |
1516 KB |
#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef int8_t byte;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
void add(int &a, const int b) {if((a += b) >= md) a -= md;}
void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
int prod(const int a, const int b) {return ll(a) * b % md;}
};
void solve() {
int n; cin >> n;
stack<int> f;
int ans = 0;
while(n--) {
int v; cin >> v;
while(!f.empty() && f.top() > v)
f.pop(), ++ans;
if(f.empty() || f.top() != v)
f.push(v);
}
cout << ans + len(f) << endl;
}
signed main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef _LOCAL
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
#else
system("color a");
freopen("in.txt", "r", stdin);
int t; cin >> t;
while(t--)
#endif
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 4 |
Incorrect |
6 ms |
492 KB |
Output isn't correct |
| 5 |
Incorrect |
8 ms |
492 KB |
Output isn't correct |
| 6 |
Correct |
13 ms |
1516 KB |
Output is correct |
| 7 |
Incorrect |
14 ms |
1388 KB |
Output isn't correct |
