Submission #205749

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
205749	2020-02-29T18:01:25 Z	mraron	Rabbit Carrot (LMIO19_triusis)	C++14	63 / 100	49 ms	3480 KB

triusis

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const double PI=3.1415926535897932384626433832795;
const ll INF = 1LL<<62;
const ll MINF = -1LL<<62;

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

	do {
		val=(val*10)+c-'0';
	} while((c=gc()) && (c>='0' && c<='9'));

	return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)


int main() {
	IO;
	int n,m;
	cin>>n>>m;
	vector<int> a(n);
	for(int i=0;i<n;++i) cin>>a[i];
	for(int i=0;i<n;++i) a[i]-=(i+1)*m;
	int ans=0;
	if(a[0]>0) {
		a[0]=0;
		ans++;
	}
	
	vector<int> lis;
	for(int i=n-1;i>=1;i--) {
		if(a[i]>a[0]) continue ;
		auto it=lower_bound(all(lis), a[i]+1);
		if(it==lis.end()) lis.pb(a[i]);
		else *it=a[i];
	}
	
	cout<<ans+(n-1-sz(lis))<<"\n";
	
	return 0;
}

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	380 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	380 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	380 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	508 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	6 ms	504 KB	Output is correct
11	Correct	6 ms	376 KB	Output is correct
12	Correct	6 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	504 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	380 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	380 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	380 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	5 ms	376 KB	Output is correct
32	Correct	5 ms	376 KB	Output is correct
33	Correct	5 ms	376 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	380 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	6 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	6 ms	376 KB	Output is correct
6	Correct	5 ms	504 KB	Output is correct
7	Correct	6 ms	376 KB	Output is correct
8	Correct	5 ms	380 KB	Output is correct
9	Correct	6 ms	376 KB	Output is correct
10	Correct	6 ms	424 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	508 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	6 ms	504 KB	Output is correct
21	Correct	6 ms	376 KB	Output is correct
22	Correct	6 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	504 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	5 ms	376 KB	Output is correct
32	Correct	5 ms	376 KB	Output is correct
33	Correct	5 ms	380 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	5 ms	380 KB	Output is correct
36	Correct	5 ms	376 KB	Output is correct
37	Correct	5 ms	380 KB	Output is correct
38	Correct	5 ms	376 KB	Output is correct
39	Correct	5 ms	376 KB	Output is correct
40	Correct	5 ms	376 KB	Output is correct
41	Correct	5 ms	376 KB	Output is correct
42	Correct	5 ms	376 KB	Output is correct
43	Correct	5 ms	376 KB	Output is correct

Subtask #4
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	380 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	6 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	6 ms	376 KB	Output is correct
6	Correct	5 ms	504 KB	Output is correct
7	Correct	6 ms	376 KB	Output is correct
8	Correct	5 ms	380 KB	Output is correct
9	Correct	6 ms	376 KB	Output is correct
10	Correct	6 ms	424 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	508 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	6 ms	504 KB	Output is correct
21	Correct	6 ms	376 KB	Output is correct
22	Correct	6 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	504 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	21 ms	2676 KB	Output is correct
29	Correct	49 ms	3064 KB	Output is correct
30	Correct	49 ms	3064 KB	Output is correct
31	Correct	41 ms	3128 KB	Output is correct
32	Correct	33 ms	3188 KB	Output is correct
33	Correct	34 ms	3444 KB	Output is correct
34	Incorrect	39 ms	3480 KB	Output isn't correct
35	Halted	0 ms	0 KB	-

Submission #205749

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 21.0 / 21.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 37.0

Subtask #1
14.0 / 14.0

Subtask #2
21.0 / 21.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 37.0