Submission #253204

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
253204	2020-07-27T12:03:43 Z	nandonathaniel	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	127 ms	13032 KB

triusis

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int MAXN=200005;
int MAX,a[MAXN],bit[MAXN];
map<int,int> mp;

int query(int x){
	int ret=0;
	for(int i=x;i>0;i-=(i&-i)){
		ret=max(ret,bit[i]);
	}
	return ret;
}

void update(int x,int v){
	for(int i=x;i<=MAX;i+=(i&(-i))){
		bit[i]=max(bit[i],v);
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int n,m;
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		cin >> a[i];
		a[i]-=(i*m);
	}
	vector<pii> v;
	for(int i=0;i<=n;i++){
		if(a[i]>0)continue;
		v.push_back({-a[i],i});
	}
	for(auto isi : v)mp[isi.first];
	for(map<int,int>::iterator it=mp.begin();it!=mp.end();++it){
		MAX++;
		mp[it->first]=MAX;
	}
	int ans=0;
	for(auto isi : v){
		int dp=query(mp[isi.first])+1;
		update(mp[isi.first],dp);
		ans=max(ans,dp);
	}
	cout << n+1-ans << endl;
	return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
28.0 / 28.0

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

Subtask #4
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	3 ms	640 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	640 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	2 ms	640 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	3 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	3 ms	640 KB	Output is correct
20	Correct	2 ms	640 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	2 ms	640 KB	Output is correct
24	Correct	2 ms	640 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	3 ms	640 KB	Output is correct
27	Correct	2 ms	640 KB	Output is correct
28	Correct	127 ms	13032 KB	Output is correct
29	Correct	27 ms	1144 KB	Output is correct
30	Correct	111 ms	7024 KB	Output is correct
31	Correct	123 ms	7020 KB	Output is correct
32	Correct	100 ms	12648 KB	Output is correct
33	Correct	101 ms	12904 KB	Output is correct
34	Correct	40 ms	3312 KB	Output is correct
35	Correct	33 ms	3312 KB	Output is correct
36	Correct	86 ms	7788 KB	Output is correct
37	Correct	21 ms	1152 KB	Output is correct
38	Correct	103 ms	12908 KB	Output is correct
39	Correct	108 ms	12720 KB	Output is correct
40	Correct	0 ms	384 KB	Output is correct
41	Correct	0 ms	384 KB	Output is correct
42	Correct	0 ms	384 KB	Output is correct
43	Correct	0 ms	384 KB	Output is correct
44	Correct	0 ms	384 KB	Output is correct
45	Correct	0 ms	384 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	0 ms	384 KB	Output is correct
48	Correct	0 ms	384 KB	Output is correct
49	Correct	0 ms	384 KB	Output is correct
50	Correct	0 ms	384 KB	Output is correct
51	Correct	0 ms	384 KB	Output is correct
52	Correct	0 ms	384 KB	Output is correct
53	Correct	0 ms	384 KB	Output is correct
54	Correct	0 ms	384 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct

Submission #253204

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 21.0 / 21.0

Subtask #3 28.0 / 28.0

Subtask #4 37.0 / 37.0

Subtask #1
14.0 / 14.0

Subtask #2
21.0 / 21.0

Subtask #3
28.0 / 28.0

Subtask #4
37.0 / 37.0