oj.uz

Submission #957024

# Submission time Handle Problem Language Result Execution time Memory
957024 2024-04-02T19:57:07 Z Charizard2021 Global Warming (CEOI18_glo) C++17
15 / 100
 70 ms 1748 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, x;
    cin >> n >> x;
    int a[n];
    for(int i = 0;i < n; i++) cin >> a[i];
    if(x == 0){
        vector<int> dp;
        for(int i = 0; i < n; i++){
            int idx = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
            if(idx == (int)dp.size()){
                dp.push_back(a[i]);
            }
            else{
                dp[idx] = a[i];
            }
        }
        cout << dp.size() << "\n";
    }
    else{
        if(n <= 1000){
            int ans = 0;
            for(int i = -1; i < n; i++){
                int b[n];
                for(int j = 0; j < n; j++){
                    if(j <= i){
                        b[j] = a[j] - x;
                    }
                    else{
                        b[j] = a[j];
                    }
                }
                vector<int> dp;
                for(int j = 0; j < n; j++){
                    int idx = lower_bound(dp.begin(), dp.end(), b[j]) - dp.begin();
                    if(idx == (int)dp.size()){
                        dp.push_back(b[j]);
                    }
                    else{
                        dp[idx] = a[j];
                    }
                }
                ans = max(ans, (int)dp.size());
            }
            cout << ans << "\n";
        }
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1112 KB Output is correct
2 Correct 65 ms 1192 KB Output is correct
3 Correct 64 ms 1116 KB Output is correct
4 Correct 70 ms 1116 KB Output is correct
5 Correct 49 ms 1748 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -