oj.uz

답안 #1081303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081303 2024-08-29T21:35:23 Z chaoslong Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 2408 KB 
// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;

int n, m, a[N], b[N], t[4 * N];

void update(int id, int l, int r, int p, int val) {
    if(l > p || r < p) return;
    if(l == r) {
        t[id] = val;
        return;
    }
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, p, val);
    update(id << 1 | 1, mid + 1, r, p, val);
    t[id] = max(t[id << 1], t[id << 1 | 1]);
}

int get(int id, int l, int r, int u, int v) {
    if(l > v || r < u) return 0;
    if(u <= l && r <= v) return t[id];
    int mid = (l + r) >> 1;
    int trai = get(id << 1, l, mid, u, v);
    int phai = get(id << 1 | 1, mid + 1, r, u, v);
    return max(trai, phai);
}

void to_nho_cau() {
    cin >> n >> m;
    vector<int> nen;
    int kt = 0;
    forr(i, 1, n) {
        cin >> a[i];
        if(i == 1 && a[i] > m) {
            kt = 1;
            a[i] = m;
        }
        nen.pb(a[i]);
        nen.pb(a[i] + m);
    }
    sort(all(nen));
    nen.resize(unique(all(nen)) - nen.begin());
    int mx = 0;
    forr(i, 1, n) {
        b[i] = lower_bound(all(nen), a[i] + m) - nen.begin() + 1;
        a[i] = lower_bound(all(nen), a[i]) - nen.begin() + 1;
        mx = max(mx, b[i]);
    }
    int ans = 0;
    ford(i, n, 1) {
        int val = get(1, 1, mx, 0, b[i]) + 1;
        update(1, 1, mx, a[i], val);
        if(i == 1) ans = val;
    }
//    cout << ans << "\n";
    cout << n - ans + kt << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    #ifdef LOCAL
        freopen(file".inp","r",stdin);
        freopen(file".out","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--) to_nho_cau();
}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
  ∧__∧
（｀•ω• )づ__∧
（つ　 /( •ω•。)
  しーＪ (nnノ) pat pat
**/
/**  /\_/\
*   (= ._.)
*   / >☕ \>💻
**/

Compilation message

triusis.cpp:106:9: warning: "/*" within comment [-Wcomment]
  106 | /**  /\_/\
      |

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2408 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 0 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2408 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 0 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2408 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 0 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2408 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 0 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -