Submission #952560

# Submission time Handle Problem Language Result Execution time Memory
952560 2024-03-24T08:54:24 Z Sundavar Global Warming (CEOI18_glo) C++14
58 / 100
109 ms 5460 KB
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n,d;
    cin>>n>>d;
    vector<int> v(n);
    for(int& a : v) cin>>a;
    vector<int> smallest(n+1, 1e9+7), here(n);
    smallest[0] = 0;
    for(int i = 0; i < n; i++){
        int l = lower_bound(smallest.begin(), smallest.end(), v[i]) - smallest.begin();
        here[i] = l;
        smallest[l] = v[i];
    }
    vector<int> biggest(n+1, -1e9+7);
    biggest[0] = 1e9+7;
    int sol = 0;
    for(int i = n-1; i >= 0; i--){
        int l = 0, r = n;
        while(r-l > 1)
            if(biggest[(r+l)/2] > v[i]-d) l = (l+r)/2;
            else r = (l+r)/2;
        sol = max(sol, l+here[i]);
        l = 0, r = n;
        while(r-l > 1)
            if(biggest[(r+l)/2] > v[i]) l = (l+r)/2;
            else r = (l+r)/2;
        biggest[l+1] = v[i];
    }
    cout << sol << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 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 344 KB Output is correct
21 Correct 1 ms 344 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
# Verdict Execution time Memory Grader output
1 Correct 109 ms 5444 KB Output is correct
2 Correct 94 ms 5460 KB Output is correct
3 Correct 94 ms 5428 KB Output is correct
4 Correct 94 ms 5460 KB Output is correct
5 Correct 77 ms 4692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 23 ms 1616 KB Output is correct
2 Correct 23 ms 1628 KB Output is correct
3 Correct 22 ms 1624 KB Output is correct
4 Correct 18 ms 1372 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 18 ms 1372 KB Output is correct
7 Correct 22 ms 1628 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 54 ms 3152 KB Output is correct
2 Correct 53 ms 2800 KB Output is correct
3 Correct 96 ms 5460 KB Output is correct
4 Incorrect 75 ms 4724 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 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 344 KB Output is correct
21 Correct 1 ms 344 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 109 ms 5444 KB Output is correct
28 Correct 94 ms 5460 KB Output is correct
29 Correct 94 ms 5428 KB Output is correct
30 Correct 94 ms 5460 KB Output is correct
31 Correct 77 ms 4692 KB Output is correct
32 Correct 23 ms 1616 KB Output is correct
33 Correct 23 ms 1628 KB Output is correct
34 Correct 22 ms 1624 KB Output is correct
35 Correct 18 ms 1372 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 18 ms 1372 KB Output is correct
38 Correct 22 ms 1628 KB Output is correct
39 Correct 54 ms 3152 KB Output is correct
40 Correct 53 ms 2800 KB Output is correct
41 Correct 96 ms 5460 KB Output is correct
42 Incorrect 75 ms 4724 KB Output isn't correct
43 Halted 0 ms 0 KB -