Submission #308339

#	Time	Username	Problem	Language	Result	Execution time	Memory
308339		Gilgamesh	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	32 ms	3184 KiB

triusis

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using pii = pair<int, int>;
 
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define x first
#define y second
 
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0}; 
const char dir[] = {'R', 'L', 'D', 'U'};
 
int add(int a, int b){
    a += b;
    if(a >= MOD){
        a -= MOD;
    }
    return a;
}
 
int sub(int a, int b){
    a -= b;
    if(a < 0) a += MOD;
    return a;
}
 
int mult(int a, int b){
    return ((ll) a * b) % MOD;
}
 
void setIO() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen((s+".in").c_str(),"r",stdin);
//    freopen((s+".text").c_str(),"w",stdout);
}
 
int main(){
    setIO();
    int n, m; cin >> n >> m;
    vector<int> lis;
    for(int i = 0; i < n; ++i){
        int h; cin >> h;
        h = (i + 1) * m - h;
        if(h >= 0){
            auto ind = upper_bound(all(lis), h);
            if(ind == lis.end()) lis.eb(h);
            else *ind = h;
        }
    }
    cout << n - lis.size() << "\n";
}

Compilation message (stderr)

triusis.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

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