oj.uz

Submission #1082843

# Submission time Handle Problem Language Result Execution time Memory
1082843 2024-09-01T19:25:30 Z chaoslong Global Warming (CEOI18_glo) C++14
100 / 100
 256 ms 12576 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, x, a[N], b[N], t[8 * N], dp[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 >> x;
    vector<int> nen;
    forr(i, 1, n) {
        cin >> a[i];
        b[i] = a[i] + x;
        nen.pb(a[i]);
        nen.pb(b[i]);
    }
    sort(all(nen));
    int mx = 0;
    nen.resize(unique(all(nen)) - nen.begin());
    forr(i, 1, n) {
        a[i] = lower_bound(all(nen), a[i]) - nen.begin() + 1;
        b[i] = lower_bound(all(nen), b[i]) - nen.begin() + 1;
        mx = max(mx, b[i]);
    }
    forr(i, 1, n) {
        int val = get(1, 1, mx, 1, b[i] - 1) + 1;
        int val2 = get(1, 1, mx, 1, a[i] - 1) + 1;
        update(1, 1, mx, a[i], val2);
        dp[i] = val;
    }
    int ans = 0;
    forr(i, 1, 8 * n) t[i] = 0;
    ford(i, n, 1) {
        int val = get(1, 1, mx, a[i] + 1, mx) + 1;
        update(1, 1, mx, a[i], val);
//        cout << dp[i] << " " << val - 1 << "\n";
        ans = max(ans, dp[i] + val - 1);
    }
    cout << ans << "\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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 12512 KB Output is correct
2 Correct 223 ms 12484 KB Output is correct
3 Correct 221 ms 12556 KB Output is correct
4 Correct 225 ms 12556 KB Output is correct
5 Correct 119 ms 11716 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 3416 KB Output is correct
2 Correct 53 ms 3540 KB Output is correct
3 Correct 51 ms 3540 KB Output is correct
4 Correct 29 ms 3288 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 33 ms 3284 KB Output is correct
7 Correct 52 ms 3536 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 6404 KB Output is correct
2 Correct 130 ms 6604 KB Output is correct
3 Correct 250 ms 12528 KB Output is correct
4 Correct 165 ms 11720 KB Output is correct
5 Correct 79 ms 6088 KB Output is correct
6 Correct 159 ms 11464 KB Output is correct
7 Correct 139 ms 12088 KB Output is correct
8 Correct 101 ms 6608 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 225 ms 12512 KB Output is correct
28 Correct 223 ms 12484 KB Output is correct
29 Correct 221 ms 12556 KB Output is correct
30 Correct 225 ms 12556 KB Output is correct
31 Correct 119 ms 11716 KB Output is correct
32 Correct 52 ms 3416 KB Output is correct
33 Correct 53 ms 3540 KB Output is correct
34 Correct 51 ms 3540 KB Output is correct
35 Correct 29 ms 3288 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 33 ms 3284 KB Output is correct
38 Correct 52 ms 3536 KB Output is correct
39 Correct 116 ms 6404 KB Output is correct
40 Correct 130 ms 6604 KB Output is correct
41 Correct 250 ms 12528 KB Output is correct
42 Correct 165 ms 11720 KB Output is correct
43 Correct 79 ms 6088 KB Output is correct
44 Correct 159 ms 11464 KB Output is correct
45 Correct 139 ms 12088 KB Output is correct
46 Correct 101 ms 6608 KB Output is correct
47 Correct 120 ms 6460 KB Output is correct
48 Correct 111 ms 6476 KB Output is correct
49 Correct 256 ms 12576 KB Output is correct
50 Correct 127 ms 11812 KB Output is correct
51 Correct 114 ms 8836 KB Output is correct
52 Correct 159 ms 11944 KB Output is correct
53 Correct 179 ms 11776 KB Output is correct
54 Correct 148 ms 12484 KB Output is correct
55 Correct 223 ms 12484 KB Output is correct