제출 #1158059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158059		MPG	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	65 ms	11336 KiB

triusis

//#pragma GCC optomize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long                           ll;
#define                                     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define                                     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
//#define                                     min_heap priority_queue<ll, vector<ll>, greater<ll>>
#define                                     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define                                     filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout); 
#define                                     endl '\n'
#define                                     md(a) (a % mod + mod) % mod
#define pb push_back
//cout << vectorprecision(5) << fixed << f;
//hash prime = 769
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


ll const maxn = 2e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 400;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}


ll n, m, arr[maxn];
multiset <ll> st;

void Solve(){

cin >> n >> m;
for (int i = 1; i < n + 1; i++){
    cin >> arr[i]; arr[i] = i * m - arr[i];

}
for (int i = 1; i < n + 1; i++){
    if (arr[i] < 0)
        continue;
    auto it = st.upper_bound(arr[i]);
    if (it == st.end()){
        st.insert(arr[i]);
    }
    else{
        st.erase(it);
        st.insert(arr[i]);
    }
}
cout << n - st.size() << endl;


}





int main(){
sariE;// filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

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