Submission #1256340

#	Time	Username	Problem	Language	Result	Execution time	Memory
1256340		menkh	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	69 ms	12872 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define MAX 200005
int poles[MAX], b[MAX];
int n, m;

void solve() {
	scanf("%lld %lld", &n, &m); 
	for (int i = 1; i <= n; i++) scanf("%lld", &poles[i]);

	for (int i = 1; i <= n; i++) b[i] = m * i - poles[i];

	multiset<int> s;
	for (int i = 1; i <= n; i++) {
		if (b[i] < 0) continue; 
		
		auto it = s.upper_bound(b[i]);
		if (it != s.end()) s.erase(it);
		s.insert(b[i]);
	}

	printf("%lld\n", n - (int)s.size());
}

signed main() {
	solve();
}

Compilation message (stderr)

triusis.cpp: In function 'void solve()':
triusis.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         scanf("%lld %lld", &n, &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
triusis.cpp:11:43: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         for (int i = 1; i <= n; i++) scanf("%lld", &poles[i]);
      |                                      ~~~~~^~~~~~~~~~~~~~~~~~~

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