Submission #1266956

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266956		dhuyyyy	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

#include <bits/stdc++.h>
#define fi first
#define se second
#define int long long
using namespace std;

using ll = long long;
using ii = pair<int,int>;
using pii = pair<int,ii>;
using aa = array<int,3>;

const int N = 2e5+5;
const int M = 1e5+5;
const int INF = 1e9;
const int MOD = 1e9+7;

int n, t, x, s, res = 0, cnt = 0, a[N], BIT[N];

vector <int> v;

void update(int id,int val){
    while (id <= n){
        BIT[id] = max(BIT[id],val);
        id += id & -id;
    }
}
int get(int id){
    int res = 0;
    while (id){
        res = max(res,BIT[id]);
        id -= id & -id;
    }
    return res;
}
int calc(int val){
    return lower_bound(v.begin(),v.end(),val) - v.begin();
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    freopen("main.in","r",stdin);
    freopen("main.out","w",stdout);
    cin >> n >> t;
    for (int i = 1; i <= n; i++){
        cin >> x;
        x = (t * i - x);
        if (x >= 0){
            v.push_back(x);
            a[++cnt] = x;
        }
    }
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    for (int i = 1; i <= cnt; i++){
        a[i] = calc(a[i]) + 1;
    }
    for (int i = 1; i <= cnt; i++){
        int cur = get(a[i]) + 1;
        update(a[i],cur);
        res = max(res,cur);
    }
    cout << n - res;
    return 0;
}

Compilation message (stderr)

triusis.cpp: In function 'int main()':
triusis.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     freopen("main.in","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
triusis.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen("main.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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