oj.uz

Submission #397670

# Submission time Handle Problem Language Result Execution time Memory
397670 2021-05-02T19:17:46 Z Victor Global Warming (CEOI18_glo) C++17
10 / 100
 2000 ms 1896 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, x, ans = 0, temps[200001];
    cin >> n >> x;
    vi subseq;

    rep(i, 0, n) cin >> temps[i];

    if (!x) {
        subseq.assign(n, 0);
        int longest = 0;
        rep(i, 0, n) {
            int temp = temps[i];

            int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
            subseq[idx] = temp;
            if (idx == longest) ++longest;
        }
        ans = longest;
    }

    else
        rep(i, 0, n+1) {
            subseq.assign(n, 0);
            int longest = 0;
            
            
            rep(j, 0, n) {
                int temp = temps[i];
                if (j >= i) temp += x;

                int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
                subseq[idx] = temp;
                if (idx == longest) ++longest;
            }
            ans = max(ans, longest);
        }

    cout << ans << endl;
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1812 KB Output is correct
2 Correct 36 ms 1892 KB Output is correct
3 Correct 36 ms 1892 KB Output is correct
4 Correct 36 ms 1896 KB Output is correct
5 Correct 30 ms 1796 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2058 ms 716 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 2082 ms 1100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

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