Submission #531634

#	Time	Username	Problem	Language	Result	Execution time	Memory
531634		andecaandeci	Money (IZhO17_money)	C++17	0 / 100	0 ms	204 KiB

money

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef double dbl;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef map<ll, ll> mll;
typedef pair<string, ll> psl;
typedef map<string, ll> msl;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef deque<ll> deq;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqm;
typedef priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> dij;
typedef priority_queue<ll> pq;
typedef string str;
const ll mod=1e9+7;
const ll maxn=1e5+1;
ll gcd(ll a, ll b) {
    return a==0 ? b : gcd(a, b%a);
}
ll lcm(ll a, ll b) {
    ll ans=a*b;
    ans=ans/(gcd(a, b));
    return ans;
}
#define ihacoy ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define dh << endl;
#define co cout <<
#define udh cout << endl;
#define spa << " ";
#define ci cin >>
#define fi first
#define se second
#define sp << " " <<
#define tes while(t--)
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
#define gre greater<ll>()
#define sip return 0
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
int n, idx=1, ans=1, ujung=1e9;
int main() {
    ihacoy
    ci n;
    deque<int> v(n);
    set<int> now;
    for(int i=0; i<n; i++) {
        ci v[i];
    }
    now.insert(v[0]);
    while(v[idx]>=v[idx-1] && idx<n) {
        now.insert(v[idx]);
        idx++;
    }
    for(int i=idx; i<n; i++) {
        if(v[i]>v[i+1] || v[i]>ujung) {
            ans++;
            auto it=now.ub(v[i]);
            if(it!=now.end()) {
                ujung=*it;
            } else ujung=1e9;
        }
        now.insert(v[i]);
    }
    co ans;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55