oj.uz

Submission #432923

# Submission time Handle Problem Language Result Execution time Memory
432923 2021-06-18T15:12:56 Z lukadupli Global Warming (CEOI18_glo) C++14
28 / 100
 2000 ms 1188 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX = 2e5 + 5;

int n, x, arr[MAX];

int memo[MAX][2];
int rek(int pos, bool drop){
    if(pos == 0) return 1;
    if(memo[pos][drop] > 0) return memo[pos][drop];

    int maxi = 0;
    for(int i = 0; i < pos; i++){
        if(arr[pos] > arr[i]) maxi = max(maxi, rek(i, drop));
        if(arr[i] - arr[pos] < x && drop) maxi = max(maxi, rek(i, 0));
    }

    return memo[pos][drop] = maxi + 1;
}

int main()
{
    cin >> n >> x;
    for(int i = 0; i < n; i++) cin >> arr[i];

    int maxi = 0;
    for(int i = 0; i < n; i++) maxi = max(maxi, rek(i, 1));
    cout << maxi;

    /*for(int i = 0; i < n; i++){
        printf("%d\n    drop left: %d\n    no drop left: %d\n", i, rek(i, 1), rek(i, 0));
    }*/
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2091 ms 1188 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 10 ms 204 KB Output is correct
20 Correct 9 ms 324 KB Output is correct
21 Correct 10 ms 312 KB Output is correct
22 Correct 9 ms 444 KB Output is correct
23 Correct 8 ms 316 KB Output is correct
24 Correct 10 ms 204 KB Output is correct
25 Correct 9 ms 312 KB Output is correct
26 Correct 12 ms 204 KB Output is correct
27 Execution timed out 2091 ms 1188 KB Time limit exceeded
28 Halted 0 ms 0 KB -