# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647672 | nayhz | Rabbit Carrot (LMIO19_triusis) | C++17 | 31 ms | 5308 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// source identifier task_name
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define lck cout << "ick bmi 32.9\n"
#define cam_cs cout << "ick orz\n"
#define orz(x) cout << (x) << " orz\n"
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pcc pair<char, char>
#define ll long long
#define ull unsigned long long
#define ld long double
// #define int long long
#define vi vector<int>
#define vll vector<long long>
#define vd vector<double>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vc vector<char>
#define vsc vector<string>
#define vb vector<bool>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define yes() cout << "Yes\n"
#define no() cout << "No\n"
#define impossible() cout << "Impossible\n"
template<typename T, typename V>
inline void print (const std::pair<T, V> &x) {std::cout << x.first << ' ' << x.second << '\n';}
template<typename T>
inline void print (const T &x) {std::cout << x << '\n';}
template<typename T>
inline void print (std::vector<T> &x) {for (auto &y : x) std::cout << y << " "; std::cout << '\n';}
inline void print () {std::cout << '\n';}
using namespace std;
const ld pi = acos(-1);
const ld eps = 1e-9;
const ll mod = 1000000007;
const ll inf = 1000000007;
clock_t T, NT;
inline double get_time() {NT = clock() - T; return (double)(NT) / CLOCKS_PER_SEC;}
void file_io (string x);
/*
>>>>>>>>>>>>>>>>>>>>>>>>>>END OF TEMPLATE HEADER<<<<<<<<<<<<<<<<<<<<<<<<
*/
void solve (int &tc) {
int n, m; cin >> n >> m;
vi a(n);
for (auto &x : a) cin >> x;
vi b;
for (int i = 0; i < n; i++) {
if ((i + 1) * m >= a[i]) b.pb((i + 1) * m - a[i]);
}
// print(b);
vi v;
for (int i = 0; i < (int)(b.size()); i++) {
auto it = upper_bound(all(v), b[i]);
if (it == v.end()) v.pb(b[i]);
else *it = b[i];
}
cout << n - (int)v.size() << '\n';
}
signed main () {
cin.tie()->sync_with_stdio(false);
T = clock();
srand(time(NULL));
// file_io("");
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
// if (i != t) cout << '\n';
}
// while (true) {solve(t); t++;}
return 0;
}
void file_io (string x = "x") {
string i = x + ".in";
freopen(i.c_str(), "r", stdin);
string o = x + ".out";
freopen(o.c_str(), "w", stdout);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |