oj.uz

Submission #971913

# Submission time Handle Problem Language Result Execution time Memory
971913 2024-04-29T13:21:20 Z jadai007 Global Warming (CEOI18_glo) C++17
38 / 100
 2000 ms 3568 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

int n,x, arr[200200], p, dp[200200], ans;

signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> x;
    for(int i = 0; i<n; ++i) cin >> arr[i];
    if(x == 0){
        for(int i = 0; i<n; ++i){
            int idx = lower_bound(dp, dp+p, arr[i]) - dp;
            if(idx == p) ++p;
            dp[idx] = arr[i];
        }
        cout << p;
        return 0;
    }
    for(int i = 0; i<n; ++i){
        memset(dp, 0, sizeof(dp));
        p = 0;
        for(int j = 0; j<n; ++j){
            int a = arr[j];
            if(j <= i) a-=x;
            int idx = lower_bound(dp, dp+p, a) - dp;
            if(idx == p) p++;
            dp[idx] = a;
        }
        ans = max(ans, p);
    }
    cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2760 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2760 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 3072 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2700 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2760 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 3072 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2700 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 38 ms 2904 KB Output is correct
20 Correct 36 ms 2652 KB Output is correct
21 Correct 42 ms 2896 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 35 ms 2652 KB Output is correct
24 Correct 37 ms 2680 KB Output is correct
25 Correct 30 ms 2652 KB Output is correct
26 Correct 35 ms 2652 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3420 KB Output is correct
2 Correct 26 ms 3160 KB Output is correct
3 Correct 26 ms 3392 KB Output is correct
4 Correct 28 ms 3164 KB Output is correct
5 Correct 19 ms 3568 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2012 ms 2648 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 2045 ms 2652 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 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2760 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 3072 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2700 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 38 ms 2904 KB Output is correct
20 Correct 36 ms 2652 KB Output is correct
21 Correct 42 ms 2896 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 35 ms 2652 KB Output is correct
24 Correct 37 ms 2680 KB Output is correct
25 Correct 30 ms 2652 KB Output is correct
26 Correct 35 ms 2652 KB Output is correct
27 Correct 25 ms 3420 KB Output is correct
28 Correct 26 ms 3160 KB Output is correct
29 Correct 26 ms 3392 KB Output is correct
30 Correct 28 ms 3164 KB Output is correct
31 Correct 19 ms 3568 KB Output is correct
32 Execution timed out 2012 ms 2648 KB Time limit exceeded
33 Halted 0 ms 0 KB -