oj.uz

Submission #528447

# Submission time Handle Problem Language Result Execution time Memory
528447 2022-02-20T10:08:43 Z erto Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 29 ms 6468 KB 
#include <bits/stdc++.h>
typedef long long int ll;
#define INF ll(1e9 + 7)
#define N (ll)1e5 + 5
using namespace std;



void solve(){
	ll n, m, g, t, t2;
	cin >> n >> m;
	ll a[n], b[n+1];
	for(int i=0 ;i<n; i++){
		cin >> a[i];
		b[i] = m*(i+1) - a[i];
	}
	vector<int> d;
	for(int i=0; i<n; i++){
		if(b[i] < 0)continue;
		g = upper_bound(d.begin(), d.end(), b[i]) - d.begin();
		if(g == d.size()){
			d.push_back(b[i]);
		}
		else{
			d[g] = b[i];
		}
	}
	cout<<n - d.size();


}
 
int main(){
	
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin>>T;
    while (T--){
        solve();
    }
}

Compilation message

triusis.cpp: In function 'void solve()':
triusis.cpp:21:8: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |   if(g == d.size()){
      |      ~~^~~~~~~~~~~
triusis.cpp:10:14: warning: unused variable 't' [-Wunused-variable]
   10 |  ll n, m, g, t, t2;
      |              ^
triusis.cpp:10:17: warning: unused variable 't2' [-Wunused-variable]
   10 |  ll n, m, g, t, t2;
      |                 ^~

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 448 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 456 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 320 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 444 KB Output is correct
38 Correct 1 ms 448 KB Output is correct
39 Correct 1 ms 448 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 448 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 312 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 21 ms 4984 KB Output is correct
45 Correct 26 ms 5312 KB Output is correct
46 Correct 27 ms 5328 KB Output is correct
47 Correct 26 ms 5328 KB Output is correct
48 Correct 18 ms 5432 KB Output is correct
49 Correct 20 ms 5724 KB Output is correct
50 Correct 29 ms 5968 KB Output is correct
51 Correct 24 ms 6468 KB Output is correct
52 Correct 20 ms 4960 KB Output is correct
53 Correct 16 ms 4668 KB Output is correct
54 Correct 23 ms 5572 KB Output is correct
55 Correct 20 ms 5584 KB Output is correct