Submission #483932

#	Time	Username	Problem	Language	Result	Execution time	Memory
483932		XII	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	28 ms	2628 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ALL(x) (x).begin(), (x).end()

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORU(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define IOS cin.tie(0)->sync_with_stdio(false);
#define PROB "LMIO19_triusis"
void Fi(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp", "r", stdin);
        freopen(PROB".out", "w", stdout);
    }
}

const int N = 2e5 + 1;
int a[N], n, m;

int main(){
    IOS;
    Fi();
    cin >> n >> m;
    vector<int> d;
    FORU(i, 1, n){
        cin >> a[i];
        a[i] = i * m - a[i];
        if(a[i] >= 0){
            int j = upper_bound(ALL(d), a[i]) - d.begin();
            if(j >= d.size()) d.eb(a[i]);
            else d[j] = a[i];
        }
    }
    cout << n - d.size();
    return 0;
}

Compilation message (stderr)

triusis.cpp: In function 'int main()':
triusis.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             if(j >= d.size()) d.eb(a[i]);
      |                ~~^~~~~~~~~~~
triusis.cpp: In function 'void Fi()':
triusis.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(PROB".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(PROB".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37