oj.uz

Submission #563387

# Submission time Handle Problem Language Result Execution time Memory
563387 2022-05-17T05:38:50 Z guagua0407 Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main() {_
	int n,m;
	cin>>n>>m;
	int b[n];
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		b[i]=m*(i+1)-x;
		//cout<<b[i]<<' ';
	}
	multiset<int> s;
	for(int i=0;i<n;i++){
		if(s.upper_bound(b[i])!=s.end()) s.erase(s.upper_bound(b[i]));
		s.insert(b[i]);
	}
	/*for(auto it=s.begin();it!=s.end();it++){
		cout<<*it<<' ';
	}*/
	cout<<n-s.size();
	return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -