Submission #1165587

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

triusis

#pragma region //           https://tioj.ck.tp.edu.tw/problems/2362
#include<bits/stdc++.h>
#define int long long
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
#define f2(i, m) for(int i=0; i<m; i++)
#define f21(i, m) for(int i=1; i<m; i++)
#define f3(i, n, m) for(int i=n; i<m; i++)
#define f2_(i, m) for(int i=m; i>-1; i--)
#define f21_(i, m) for(int i=m; i>0; i--)
#define f3_(i, n, m) for(int i=n; i>=m; i--)
#define travG(idx) for(int i : g[idx])
#define travG_(i, idx) for(int i : g[idx])
#define trav(loop) for(int i : loop)
#define trav_(i, loop) for(int i : loop)
#define trav2(loop, idx) for(int i : loop[idx])
#define trav2_(i, loop, idx) for(int i : loop[idx])
#define ll long long
#define bs bitset
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ve vector<element>
#define ve_ vector<element_>
#define vpii vector<pair<int, int>>
#define dqi deque<int>
#define dqpii deque<pii>
#define qi queue<int>
#define qe queue<element>
#define qpii queue<pair<int, int>>
#define si stack<int>
#define se stack<element>
#define spii stack<pair<int, int>>
#define vb vector<bool>
#define pqi priority_queue<int>
#define pqi_ priority_queue<int, vi, greater<int>>
#define pqpii priority_queue<pair<int, int>>
#define pqpii_ priority_queue<pair<int, int>, vpii, greater<pii>>
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
#define len length()
#define elif else if
#define mod 1000000007
#pragma endregion

#define debug
/*
#ifdef debug
#endif
#ifndef debug
#endif
*/
using namespace std;

signed main()//         APIO  Bridge
{   ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m, ans=0, tmp=0; cin>>n>>m;
    vi magic;
    int n_ = n;
    f2(i, n)
    {
        tmp+=m;
        int t; cin>>t, t-=tmp;
        //cout << t << '\n';
        if(t>0)
        {
            ans++;
            n_--;
            continue;
        }
        if(magic.empty() || t<=magic[magic.size()-1]) magic.pb(t);
        else
        {
            auto p = lower_bound(begin(magic), end(magic), t-1);
            *p = t;
        }
    }
    //cout << ans << '\n' << magic.size() << '\n';
    cout << ans + n_ - magic.size();
    return 0;
}

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