oj.uz

답안 #432908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432908 2021-06-18T15:03:59 Z lukadupli Global Warming (CEOI18_glo) C++14
0 / 100
 2000 ms 3372 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];

    cout << rek(n - 1, 1) << '\n';

    /*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
0 / 5.0

# 결과 실행 시간 메모리 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 1 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 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 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 1 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 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 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 1 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 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2070 ms 3372 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 771 ms 1316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2057 ms 1684 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 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 1 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 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -