oj.uz

Submission #471138

# Submission time Handle Problem Language Result Execution time Memory
471138 2021-09-07T13:09:32 Z zxcvbnm Global Warming (CEOI18_glo) C++14
62 / 100
 105 ms 11404 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
void get(vector<int>& suff, vector<int>& suff_len, vector<int> a) {
    reverse(a.begin(), a.end());
    set<int> s;

    for(int i = 0; i < (int) a.size(); i++) {
        auto it = s.upper_bound(a[i]);
        if (it == s.begin()) {
            s.insert(a[i]);
        }
        else {
            it--;
            if (*it < a[i]) {
                s.erase(it);
                s.insert(a[i]);
            }
        }
        suff.push_back(*s.begin());
        suff_len.push_back(s.size());
//        for(int j : suff) {
//            cout << j << " ";
//        } cout << "\n";
    }
    reverse(suff.begin(), suff.end());
    reverse(suff_len.begin(), suff_len.end());
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, x;
    cin >> n >> x;
    vector<int> a(n);
    for(int& i : a) {
        cin >> i;
    }

    int ans = 0;
    vector<int> suff, suff_len;
    get(suff, suff_len, a);
    for(int& i : suff) {
        i += x;
    }

    ans = *max_element(suff_len.begin(), suff_len.end());
//    suff.push_back(0);
//    suff_len.push_back(0);

    vector<int> dp;
    for(int i = 0; i < n; i++) {
        int pos = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        if (pos == (int) dp.size()) {
            dp.push_back(a[i]);
        }
        else {
            dp[pos] = a[i];
        }

        ans = max(ans, (int) dp.size());
        ans = max(ans, suff_len[i]);
        if (i == n-1) continue;

        auto it = lower_bound(dp.begin(), dp.end(), suff[i+1]);
        ans = max(ans, (it - dp.begin()) + suff_len[i+1]);
    }

    cout << ans << "\n";
//    for(int i = 0; i < n; i++) {
//        cout << suff[i] << " " << suff_len[i] << "\n";
//    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Incorrect 1 ms 332 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 6744 KB Output is correct
2 Correct 81 ms 6728 KB Output is correct
3 Correct 80 ms 6664 KB Output is correct
4 Correct 83 ms 6820 KB Output is correct
5 Correct 100 ms 11404 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2028 KB Output is correct
2 Correct 20 ms 1992 KB Output is correct
3 Correct 24 ms 2076 KB Output is correct
4 Correct 23 ms 3008 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 20 ms 2992 KB Output is correct
7 Correct 16 ms 1992 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3552 KB Output is correct
2 Correct 39 ms 3632 KB Output is correct
3 Correct 79 ms 6756 KB Output is correct
4 Correct 105 ms 11212 KB Output is correct
5 Correct 44 ms 5720 KB Output is correct
6 Correct 80 ms 10684 KB Output is correct
7 Correct 78 ms 10780 KB Output is correct
8 Correct 33 ms 3580 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Incorrect 1 ms 332 KB Output isn't correct
20 Halted 0 ms 0 KB -