Submission #1224992

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224992		sitingfake	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	31 ms	4032 KiB

triusis

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

// define

#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ld double
#define ii pair<int,int>
#define se second
#define fi first
#define iii pair<int,ii>
#define all(v) v.begin(),v.end()
#define bit(x,i) (((x)>>(i))&1LL)
#define flip(x,i) ((x)^(1LL<<(i)))
#define ms(d,x) memset(d,x,sizeof(d))
#define sitingfake 1
#define orz 1

//constant

const ll mod = 1e9 + 7;
const long long linf = 4557430888798830399;
const int inf = 1061109567;
const int maxarr = 1e6 + 5;
const int dx[] = {0,1,-1,0};
const int dy[] = {1,0,0,-1};

template<typename T> bool maximize(T &a, const T &b)
{
    if(a < b) {a = b; return 1;}
    return 0;
}

template<typename T> bool minimize(T &a, const T &b)
{
    if(a > b) {a = b; return 1;}
    return 0;
}

inline void Plus(ll & a ,ll b)
{
    b %= mod;
    a += b;
    if(a >= mod) a -= mod;
    if(a < 0) a += mod;
    return;
}

inline void Mul(ll & a, ll b)
{
    a %= mod; b %= mod;
    a *= b;
    a %= mod;
    return;
}

//code

const int maxn = 2e5 + 7;

ll a[maxn];

int n;

ll M;

int bit[maxn];

void up(int x ,int val)
{
    for(; x <= n; x += (x & -x))
    {
        bit[x] = max(bit[x] , val);
    }
}

int get(int x)
{
    int ans = 0;

    for(;x > 0; x -= (x & -x))
    {
        ans = max(ans , bit[x]);
    }

    return ans;
}

void Reform()
{
    vector <ll> P;

    for(int i = 1; i <= n; i++)
    {
        if(a[i] < 0)
        {
            a[i] = -1;
            continue;
        }
        P.push_back(a[i]);
    }

    sort(all(P));
    P.resize(unique(all(P)) - P.begin());

    for(int i = 1; i <= n; i++)
    {
        if(a[i] == -1) continue;
        a[i] = lower_bound(all(P) , a[i]) - P.begin() + 1;
    }
}

void solve(void)
{
    cin >> n >> M;

    for(int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        a[i] = M * 1ll * i - x;
    }

    Reform();
    for(int i = 1; i <= n; i++)
    {
        if(a[i] == -1) continue;

        int ans = get(a[i]) + 1;
        up(a[i] , ans);
    }

    cout << n - get(n);

}
/**
**/
signed main()
{
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0);

   #define task ""

   if(fopen(task".inp","r"))
   {
       freopen(task".inp","r",stdin);
       freopen(task".out","w",stdout);
   }

   int tc; tc = 1;

   while(tc--) solve();

   //execute;
}

Compilation message (stderr)

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

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