oj.uz

Submission #971880

# Submission time Handle Problem Language Result Execution time Memory
971880 2024-04-29T12:36:51 Z jadai007 Global Warming (CEOI18_glo) C++17
10 / 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+1; j<n; ++j){
                int a = arr[i];
                int b = arr[j];
                arr[i]+=d; arr[j]+=d;
                memset(dp, 0, sizeof(dp)); p = 0;
                for(int k = 0; k<n; ++k){
                    int idx = lower_bound(dp, dp+p, arr[k]) - dp;
                    if(idx == p) p++;
                    dp[idx] = arr[k];
                }
                ans = max(ans, p);
                arr[i] = a, arr[j] = b;
            }
        }
    }
    cout << ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2648 KB Output is correct
2 Incorrect 7 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2648 KB Output is correct
2 Incorrect 7 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2648 KB Output is correct
2 Incorrect 7 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3416 KB Output is correct
2 Correct 26 ms 3164 KB Output is correct
3 Correct 28 ms 3416 KB Output is correct
4 Correct 25 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 2065 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 2025 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 24 ms 2648 KB Output is correct
2 Incorrect 7 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -