oj.uz

Submission #971889

# Submission time Handle Problem Language Result Execution time Memory
971889 2024-04-29T12:47:44 Z jadai007 Global Warming (CEOI18_glo) C++17
15 / 100
 2000 ms 3420 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 d = -x; d<=x; ++d){
        for(int i = 0; i<n; ++i){
            for(int j = i; j<n; ++j){
                memset(dp, 0, sizeof(dp)); p = 0;
                for(int k = 0; k<n; ++k){
                    int a = arr[k];
                    if(k <= j && k >= i) a+=d;
                    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 26 ms 2648 KB Output is correct
2 Correct 8 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2696 KB Output is correct
5 Correct 7 ms 2648 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2688 KB Output is correct
10 Correct 8 ms 2652 KB Output is correct
11 Correct 30 ms 2684 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2648 KB Output is correct
2 Correct 8 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2696 KB Output is correct
5 Correct 7 ms 2648 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2688 KB Output is correct
10 Correct 8 ms 2652 KB Output is correct
11 Correct 30 ms 2684 KB Output is correct
12 Correct 960 ms 2900 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Execution timed out 2064 ms 2652 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2648 KB Output is correct
2 Correct 8 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2696 KB Output is correct
5 Correct 7 ms 2648 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2688 KB Output is correct
10 Correct 8 ms 2652 KB Output is correct
11 Correct 30 ms 2684 KB Output is correct
12 Correct 960 ms 2900 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Execution timed out 2064 ms 2652 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3296 KB Output is correct
2 Correct 26 ms 3164 KB Output is correct
3 Correct 29 ms 3160 KB Output is correct
4 Correct 26 ms 3420 KB Output is correct
5 Correct 16 ms 3420 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2021 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 2027 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2648 KB Output is correct
2 Correct 8 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2696 KB Output is correct
5 Correct 7 ms 2648 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2688 KB Output is correct
10 Correct 8 ms 2652 KB Output is correct
11 Correct 30 ms 2684 KB Output is correct
12 Correct 960 ms 2900 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Execution timed out 2064 ms 2652 KB Time limit exceeded
15 Halted 0 ms 0 KB -