oj.uz

Submission #957072

# Submission time Handle Problem Language Result Execution time Memory
957072 2024-04-02T22:27:02 Z Charizard2021 Global Warming (CEOI18_glo) C++17
100 / 100
 92 ms 4624 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, x;
    cin >> n >> x;
    int a[n];
    for(int i = 0;i < n; i++) cin >> a[i];
    int prefLongest[n];
    vector<int> dp;
    for(int i = 0; i < n; i++){
        int idx = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        if(idx == (int)dp.size()){
            dp.push_back(a[i]);
            prefLongest[i] = (int)dp.size();
        }
        else{
            dp[idx] = a[i];
            prefLongest[i] = idx + 1;
        }
    }
    deque<int> dp2;
    int ans = 0;
    for(int i = n - 1; i >= 0; i--){
        int idx = upper_bound(dp2.begin(), dp2.end(), a[i] - x) - dp2.begin();
        idx--;
        // cout << (int)dp2.size() - idx - 1 << "\n";
        ans = max(ans, (int)dp2.size() - idx - 1 + prefLongest[i]);
        int idx2 = upper_bound(dp2.begin(), dp2.end(), a[i]) - dp2.begin();
        idx2--;
        if(idx2 == -1){
            dp2.push_front(a[i]);
        }
        else{
            dp2[idx2] = a[i];
        }
    }
    cout<< ans << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 500 KB Output is correct
7 Correct 0 ms 344 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 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 500 KB Output is correct
7 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 500 KB Output is correct
7 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 448 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 344 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 432 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 1876 KB Output is correct
2 Correct 92 ms 3872 KB Output is correct
3 Correct 89 ms 3668 KB Output is correct
4 Correct 89 ms 3740 KB Output is correct
5 Correct 59 ms 3768 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 624 KB Output is correct
2 Correct 22 ms 1108 KB Output is correct
3 Correct 25 ms 1116 KB Output is correct
4 Correct 16 ms 1248 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 15 ms 1412 KB Output is correct
7 Correct 20 ms 1116 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1116 KB Output is correct
2 Correct 40 ms 2036 KB Output is correct
3 Correct 81 ms 3668 KB Output is correct
4 Correct 62 ms 4296 KB Output is correct
5 Correct 36 ms 2152 KB Output is correct
6 Correct 54 ms 3788 KB Output is correct
7 Correct 71 ms 4536 KB Output is correct
8 Correct 37 ms 2128 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 500 KB Output is correct
7 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 448 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 344 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 432 KB Output is correct
27 Correct 90 ms 1876 KB Output is correct
28 Correct 92 ms 3872 KB Output is correct
29 Correct 89 ms 3668 KB Output is correct
30 Correct 89 ms 3740 KB Output is correct
31 Correct 59 ms 3768 KB Output is correct
32 Correct 25 ms 624 KB Output is correct
33 Correct 22 ms 1108 KB Output is correct
34 Correct 25 ms 1116 KB Output is correct
35 Correct 16 ms 1248 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 15 ms 1412 KB Output is correct
38 Correct 20 ms 1116 KB Output is correct
39 Correct 47 ms 1116 KB Output is correct
40 Correct 40 ms 2036 KB Output is correct
41 Correct 81 ms 3668 KB Output is correct
42 Correct 62 ms 4296 KB Output is correct
43 Correct 36 ms 2152 KB Output is correct
44 Correct 54 ms 3788 KB Output is correct
45 Correct 71 ms 4536 KB Output is correct
46 Correct 37 ms 2128 KB Output is correct
47 Correct 44 ms 2160 KB Output is correct
48 Correct 44 ms 2132 KB Output is correct
49 Correct 90 ms 3904 KB Output is correct
50 Correct 56 ms 3788 KB Output is correct
51 Correct 47 ms 3024 KB Output is correct
52 Correct 59 ms 4004 KB Output is correct
53 Correct 53 ms 4044 KB Output is correct
54 Correct 74 ms 4624 KB Output is correct
55 Correct 84 ms 3920 KB Output is correct