oj.uz

답안 #1097035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097035 2024-10-05T21:07:59 Z Niosakaru Global Warming (CEOI18_glo) C++11
58 / 100
 200 ms 9396 KB 
#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define N 200200

int n , x , p , fp , m , rt , a[N] , b[N] , c[N] , it[N << 2];
vector <int> vi;

void upd(int i,int l,int r,int p,int x){
    if (r < p || p < l) return;
    if (l == r) return it[i] = x, void();
    int mid = (l + r) >> 1;
    if (p <= mid) upd(i << 1,l,mid,p,x); else upd(i << 1|1,mid + 1,r,p,x);
    it[i] = max(it[i << 1] , it[i << 1|1]);  
}

int get(int i,int l,int r,int p){
    if (r < p) return 0;
    if (l >= p) return it[i];
    int mid = (l + r) >> 1;
    return max(get(i << 1,l,mid,p) , get(i << 1|1,mid + 1,r,p));
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> x;
    memset(c , 0x3f , sizeof c);
    for (int i = 1 ; i <= n ; i ++){
        cin >> a[i] , b[i] = lower_bound(c + 1,c + n + 1 , a[i]) - c; c[b[i]] = a[i];
        vi.push_back(a[i]) , vi.push_back(a[i] + x);
    } 

    sort(vi.begin() , vi.end());
    vi.resize(unique(vi.begin() , vi.end()) - vi.begin());
    m = vi.size();

    for (int i = n ; i ; i --){
        p = lower_bound(vi.begin() , vi.end() , a[i]) - vi.begin() + 1 , fp = get(1 , 1 , m , p + 1);
        rt = max(rt ,fp + b[i]);
        p = lower_bound(vi.begin() , vi.end() , a[i] + x) - vi.begin() + 1 , fp = get(1 , 1 , m , p + 1);
        p = lower_bound(vi.begin() , vi.end() , a[i] + x) - vi.begin() + 1 , upd(1 , 1 , m , p , fp + 1);
    }

    cout << rt << '\n';

    return 0;
}

/*

8 10
7 3 5 12 2 7 3 4

2
3
4
5
7
12
13
14
15
17
22

*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2528 KB Output is correct
21 Correct 1 ms 2576 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2520 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 9164 KB Output is correct
2 Correct 160 ms 9396 KB Output is correct
3 Correct 159 ms 9156 KB Output is correct
4 Correct 171 ms 9328 KB Output is correct
5 Correct 78 ms 7368 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 4704 KB Output is correct
2 Correct 40 ms 4572 KB Output is correct
3 Correct 39 ms 4572 KB Output is correct
4 Correct 21 ms 4060 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 28 ms 3940 KB Output is correct
7 Correct 33 ms 4568 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 5836 KB Output is correct
2 Correct 88 ms 5848 KB Output is correct
3 Incorrect 200 ms 8276 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2528 KB Output is correct
21 Correct 1 ms 2576 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2520 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 159 ms 9164 KB Output is correct
28 Correct 160 ms 9396 KB Output is correct
29 Correct 159 ms 9156 KB Output is correct
30 Correct 171 ms 9328 KB Output is correct
31 Correct 78 ms 7368 KB Output is correct
32 Correct 41 ms 4704 KB Output is correct
33 Correct 40 ms 4572 KB Output is correct
34 Correct 39 ms 4572 KB Output is correct
35 Correct 21 ms 4060 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 28 ms 3940 KB Output is correct
38 Correct 33 ms 4568 KB Output is correct
39 Correct 90 ms 5836 KB Output is correct
40 Correct 88 ms 5848 KB Output is correct
41 Incorrect 200 ms 8276 KB Output isn't correct
42 Halted 0 ms 0 KB -