| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 57101 |
2018-07-14T03:12:14 Z |
Benq |
Money (IZhO17_money) |
C++14 |
|
4 ms |
872 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
Tree<pi> T;
int n;
bool nex(int a, int b) {
auto it = next(T.lb({a,-MOD}));
if (it != T.end() && it->f == b) return 1;
it = T.ub({a,MOD});
if (it != T.end() && it->f == b) return 1;
return 0;
}
vi v;
void stuff() {
auto it = T.lb({v.back(),-MOD});
T.erase(it);
v.pop_back();
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n; v.resize(n);
F0R(i,n) {
cin >> v[i];
T.insert({v[i],i});
}
int ans = 0;
while (sz(v)) {
while (sz(v) > 1 && nex(v[sz(v)-2],v[sz(v)-1])) stuff();
stuff(); ans ++;
}
cout << ans;
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
568 KB |
Output is correct |
| 4 |
Correct |
2 ms |
568 KB |
Output is correct |
| 5 |
Correct |
3 ms |
568 KB |
Output is correct |
| 6 |
Correct |
3 ms |
684 KB |
Output is correct |
| 7 |
Correct |
4 ms |
684 KB |
Output is correct |
| 8 |
Correct |
4 ms |
684 KB |
Output is correct |
| 9 |
Correct |
3 ms |
708 KB |
Output is correct |
| 10 |
Correct |
4 ms |
872 KB |
Output is correct |
| 11 |
Correct |
0 ms |
872 KB |
Output is correct |
| 12 |
Incorrect |
3 ms |
872 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
568 KB |
Output is correct |
| 4 |
Correct |
2 ms |
568 KB |
Output is correct |
| 5 |
Correct |
3 ms |
568 KB |
Output is correct |
| 6 |
Correct |
3 ms |
684 KB |
Output is correct |
| 7 |
Correct |
4 ms |
684 KB |
Output is correct |
| 8 |
Correct |
4 ms |
684 KB |
Output is correct |
| 9 |
Correct |
3 ms |
708 KB |
Output is correct |
| 10 |
Correct |
4 ms |
872 KB |
Output is correct |
| 11 |
Correct |
0 ms |
872 KB |
Output is correct |
| 12 |
Incorrect |
3 ms |
872 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
568 KB |
Output is correct |
| 4 |
Correct |
2 ms |
568 KB |
Output is correct |
| 5 |
Correct |
3 ms |
568 KB |
Output is correct |
| 6 |
Correct |
3 ms |
684 KB |
Output is correct |
| 7 |
Correct |
4 ms |
684 KB |
Output is correct |
| 8 |
Correct |
4 ms |
684 KB |
Output is correct |
| 9 |
Correct |
3 ms |
708 KB |
Output is correct |
| 10 |
Correct |
4 ms |
872 KB |
Output is correct |
| 11 |
Correct |
0 ms |
872 KB |
Output is correct |
| 12 |
Incorrect |
3 ms |
872 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
568 KB |
Output is correct |
| 4 |
Correct |
2 ms |
568 KB |
Output is correct |
| 5 |
Correct |
3 ms |
568 KB |
Output is correct |
| 6 |
Correct |
3 ms |
684 KB |
Output is correct |
| 7 |
Correct |
4 ms |
684 KB |
Output is correct |
| 8 |
Correct |
4 ms |
684 KB |
Output is correct |
| 9 |
Correct |
3 ms |
708 KB |
Output is correct |
| 10 |
Correct |
4 ms |
872 KB |
Output is correct |
| 11 |
Correct |
0 ms |
872 KB |
Output is correct |
| 12 |
Incorrect |
3 ms |
872 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
