Submission #329414

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
329414	2020-11-21T05:57:16 Z	CSQ31	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	102 ms	5484 KB

triusis

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	ll n,m;
	cin>>n>>m;
	vector<ll>a(n+1);
	a[0] = 0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i] = i*m - a[i];
	}
	//for(int i=0;i<=n;i++)cout<<a[i]<<" ";
	//cout<<'\n';
	vector<ll>dp(n+1,INF);
	dp[0] = 0;
	int ans = 0;
	for(int i=1;i<=n;i++){
		int p = ub(all(dp),a[i])-dp.begin();
		if(p == 0)continue;
		dp[p] = min(dp[p],a[i]);
		ans = max(ans,p);
	}
	//cout<<ans<<'\n';
	cout<<n-ans<<'\n';
}

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
28.0 / 28.0

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

Subtask #4
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	492 KB	Output is correct
2	Correct	3 ms	492 KB	Output is correct
3	Correct	3 ms	492 KB	Output is correct
4	Correct	2 ms	364 KB	Output is correct
5	Correct	3 ms	492 KB	Output is correct
6	Correct	3 ms	492 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	3 ms	364 KB	Output is correct
9	Correct	3 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	2 ms	364 KB	Output is correct
15	Correct	2 ms	364 KB	Output is correct
16	Correct	2 ms	364 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	3 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	3 ms	364 KB	Output is correct
27	Correct	2 ms	364 KB	Output is correct
28	Correct	45 ms	3820 KB	Output is correct
29	Correct	90 ms	5356 KB	Output is correct
30	Correct	99 ms	5484 KB	Output is correct
31	Correct	94 ms	5356 KB	Output is correct
32	Correct	63 ms	4460 KB	Output is correct
33	Correct	69 ms	4716 KB	Output is correct
34	Correct	102 ms	5356 KB	Output is correct
35	Correct	95 ms	5356 KB	Output is correct
36	Correct	62 ms	4332 KB	Output is correct
37	Correct	69 ms	4716 KB	Output is correct
38	Correct	66 ms	4460 KB	Output is correct
39	Correct	67 ms	4460 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	384 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	1 ms	364 KB	Output is correct
50	Correct	1 ms	364 KB	Output is correct
51	Correct	1 ms	364 KB	Output is correct
52	Correct	1 ms	364 KB	Output is correct
53	Correct	1 ms	384 KB	Output is correct
54	Correct	1 ms	364 KB	Output is correct
55	Correct	1 ms	364 KB	Output is correct

Submission #329414

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