oj.uz

Submission #999620

# Submission time Handle Problem Language Result Execution time Memory
999620 2024-06-16T01:03:25 Z vjudge1 Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 62 ms 7364 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define inf (int)1e15

int binsearch(int val, vector<int>& vec){
    int l = 0, r = (int)vec.size()-1, mid;
    while(l < r){
        mid = (l + r + 1)/2;
        if(vec[mid] <= val){
            l = mid;
        }else{
            r = mid-1;
        }
    }
    if(l != (int)vec.size() - 1 && vec[l] <= val){
        l++;
    }
    return l;
}

void solve(){
    int n, m; cin >> n >> m;
    vector<int> vals;
    for(int i = 0; i < n; i++){
        int in;
        cin >> in;
        in -= (m * i);
        if(in <= m){
            vals.push_back(in);
        }
    }
    if((int)vals.size() != 0LL) reverse(vals.begin(), vals.end());
    vector<int> v;
    //v sorted in increasing size
    for(int i = 0; i < (int)vals.size(); i++){
        if((int)v.size() == 0){
            v.push_back(vals[i]);
            continue;
        }
        int ind = binsearch(vals[i], v);
        //strictly < in case 
        if(v[ind] <= vals[i]){
            v.push_back(vals[i]);
        }else{
            v[ind] = vals[i];
        }
        /*cout << ind << "\n";
        for(int j : v) cout << j << " ";
        cout << "\n";*/
    }
    cout << n - (int)v.size() << "\n";
    /*for(int i : v) cout << i << " ";
    cout << "\n";
    for(int i : vals) cout << i << " ";
    cout << "\n";*/
}

signed main(){
    //ios::sync_with_stdio(false), cin.tie(0);
    //freopen("txt.in", "r", stdin); freopen("txt.out", "w", stdout);
    //int t; cin >> t; while(t--)
    solve();
}

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
28.0 / 28.0

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

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 572 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 676 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 568 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 424 KB Output is correct
29 Correct 0 ms 596 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 424 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 24 ms 5324 KB Output is correct
45 Correct 46 ms 1544 KB Output is correct
46 Correct 53 ms 2664 KB Output is correct
47 Correct 62 ms 2460 KB Output is correct
48 Correct 32 ms 5832 KB Output is correct
49 Correct 36 ms 7108 KB Output is correct
50 Correct 57 ms 4436 KB Output is correct
51 Correct 53 ms 7364 KB Output is correct
52 Correct 33 ms 4556 KB Output is correct
53 Correct 34 ms 1108 KB Output is correct
54 Correct 38 ms 5824 KB Output is correct
55 Correct 37 ms 5836 KB Output is correct