Submission #912328

#	Time	Username	Problem	Language	Result	Execution time	Memory
912328		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	487 ms	31708 KiB

triusis

// #pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")  
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define sz(x) (int)x.size()
#define bit(a, i) ((a>>i)&1)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int P = 18;
const int K = 800;
const ll INF = 2e18;
const int inf = 1e9;
const int mod = 1e9+7;
const int maxm = 5e2+10;
const int maxn = 2e5+10;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {1, -1, 0, 0};

ll a[maxn];
ll b[maxn];
int n, m, sz;
int dp[maxn];
int d[4*maxn];
int t[4*maxn];
map<ll, int>cnt;

void push(int v=1, int tl=1, int tr=sz){
    t[v<<1] += d[v];
    t[v<<1|1] += d[v];
    d[v<<1] += d[v];
    d[v<<1|1] += d[v];
    d[v] = 0;
}

void build(int v=1, int tl=1, int tr=sz){
    if(tl == tr) t[v] = inf;
    else{
        int tm = tl+tr>>1;
        build(v<<1, tl, tm);
        build(v<<1|1, tm+1, tr);
        t[v] = min(t[v<<1], t[v<<1|1]);
    }
}

int get(int l, int v=1, int tl=1, int tr=sz){
    if(l > tr) return inf;
    if(l <= tl) return t[v];
    push(v);
    int tm = tl+tr>>1;
    return min(get(l, v<<1, tl, tm), get(l, v<<1|1, tm+1, tr)); 
}

void upd(int i, int x, int v=1, int tl=1, int tr=sz){
    if(tl == tr) t[v] = min(t[v], x);
    else{
        push(v);
        int tm = tl+tr>>1;
        if(i <= tm) upd(i, x, v<<1, tl, tm);
        else upd(i, x, v<<1|1, tm+1, tr);
        t[v] = min(t[v<<1], t[v<<1|1]);
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    int ans = n;
    set<ll>st;
    st.insert(0);
    for(int i=1; i<=n; i++){
        cin >> a[i];
        b[i] = a[i]-i*1ll*m;
        st.insert(b[i]);
    } for(auto to: st) cnt[to] = ++sz; 
    build();
    upd(cnt[0], 0);
    for(int i=1; i<=n; i++){
        dp[i] = min(inf, get(cnt[b[i]]));
        t[1]++; d[1]++;
        upd(cnt[b[i]], dp[i]);
        ans = min(ans, dp[i]+n-i);
    }
    cout << ans;
}

Compilation message (stderr)

triusis.cpp: In function 'void build(int, int, int)':
triusis.cpp:43:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |         int tm = tl+tr>>1;
      |                  ~~^~~
triusis.cpp: In function 'int get(int, int, int, int)':
triusis.cpp:54:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |     int tm = tl+tr>>1;
      |              ~~^~~
triusis.cpp: In function 'void upd(int, int, int, int, int)':
triusis.cpp:62:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |         int tm = tl+tr>>1;
      |                  ~~^~~

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