제출 #591817

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
591817		Belgutei	Rabbit Carrot (LMIO19_triusis)	C++17	14 / 100	2 ms	596 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

typedef pair<long long, long long> Point;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
#define MOD 1000000007
#define MOD1 1000000009
#define sqr(x) sqr((x)*(x))

void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#ifdef BE_DEBUG
#define debug(...) cerr << "\033[1;31m(" << #__VA_ARGS__ << "):\033[0m", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

const int N = 200005;
ll n,m;
ll a[N];
multiset<ll> s;
multiset<ll> :: iterator it;

int main() {
    IOS
    // freopen("cownomics.in", "r", stdin);
    // freopen("cownomics.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) {
        cin >> a[i];
    }
    for(ll i = 1; i <= n; i ++) {
        ll tmp = m * i - a[i];
        if(s.size() == 0) {
            if(a[i] <= m * i) {
                s.insert(tmp);
            }
            continue;
        }
        it = s.upper_bound(tmp);
        if(it == s.end()) {
            s.insert(tmp);
        }
        else {
            s.erase(it);
            s.insert(tmp);
        }
    }
    cout << n - s.size();
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37