oj.uz

Submission #1072900

# Submission time Handle Problem Language Result Execution time Memory
1072900 2024-08-24T06:40:31 Z HappyCapybara Global Warming (CEOI18_glo) C++17
25 / 100
 2000 ms 5972 KB 
#include<bits/stdc++.h>
using namespace std;

int n;
vector<int> st;

void update(int pos, int val, int node=1, int tl=0, int tr=n-1){
    if (tl == tr){
        st[node] = val;
        return;
    }
    int tm = (tl+tr)/2;
    if (pos <= tm) update(pos, val, node*2, tl, tm);
    else update(pos, val, node*2+1, tm+1, tr);
    st[node] = max(st[node*2], st[node*2+1]);
}

int query(int l, int r, int node=1, int tl=0, int tr=n-1){
    if (l <= tl && tr <= r) return st[node];
    int tm = (tl+tr)/2;
    int res = 0;
    if (l <= tm) res = max(res, query(l, r, node*2, tl, tm));
    if (tm+1 <= r) res = max(res, query(l, r, node*2+1, tm+1, tr));
    return res;
}

int main(){
    int x;
    cin >> n >> x;
    vector<int> v(n);
    for (int i=0; i<n; i++) cin >> v[i];
    st.resize(4*n, 0);

    vector<pair<int,int>> p(n);
    for (int i=0; i<n; i++) p[i] = {v[i], -i};

    sort(p.begin(), p.end());

    for (int i=n-1; i>=0; i--){
        int j = -p[i].second;
        int bsf = query(j, n-1);
        update(j, bsf+1);
    }

    int res = st[1];

    if (x == 0){
        cout << res << "\n";
        return 0;
    }

    if (x == pow(10, 9)){
        int tl = 0, tr = n-1, node = 1;
        while (tl != tr){
            int tm = (tl+tr)/2;
            if (st[node*2+1] == res){
                tl = tm+1;
                node = node*2+1;
            }
            else {
                tr = tm;
                node = node*2;
            }
        }

        for (int i=0; i<4*n; i++) st[i] = 0;

        for (int i=0; i<n; i++){
            int j = -p[i].second;
            int bsf = query(0, j);
            update(j, bsf+1);
        }

        int tl2 = 0, tr2 = n-1;
        node = 1;
        while (tl2 != tr2){
            int tm = (tl2+tr2)/2;
            if (st[node*2] == res){
                tr2 = tm;
                node = node*2;
            }
            else {
                tl2 = tm+1;
                node = node*2+1;
            }
        }

        vector<pair<int,int>> q(tl);
        for (int i=0; i<tl; i++) q[i] = {v[i], -i};
        sort(q.begin(), q.end());
        for (int i=0; i<4*n; i++) st[i] = 0;
        for (int i=tl-1; i>=0; i--){
            int j = -q[i].second;
            int bsf = query(j, n-1);
            update(j, bsf+1);
        }
        int res2 = st[1];

        vector<pair<int,int>> r(n-1-tl2);
        for (int i=tl2+1; i<n; i++) r[i] = {v[i], -i};
        sort(r.begin(), r.end());
        for (int i=0; i<4*n; i++) st[i] = 0;
        for (int i=n-2-tl2; i>=0; i--){
            int j = -r[i].second;
            int bsf = query(j, n-1);
            update(j, bsf+1);
        }
        int res3 = st[1];

        cout << tl << " " << tl2 << " " << res << " " << res2 << " " << res3 << "\n";
        cout << res+max(res2, res3) << "\n";
        return 0;
    }

    for (int i=0; i<n; i++){
        for (int j=i; j<n; j++){
            for (int k=-x; k<=x; k+=2*x){
                if (k == 0) continue;
                for (int l=0; l<n; l++){
                    if (i <= l && l <= j) p[l] = {v[l]+k, -l};
                    else p[l] = {v[l], -l};
                }
                sort(p.begin(), p.end());
                for (int l=0; l<4*n; l++) st[l] = 0;
                for (int l=n-1; l>=0; l--){
                    int m = -p[l].second;
                    int bsf = query(m, n-1);
                    update(m, bsf+1);
                }
                res = max(res, st[1]);
            }
        }
    }

    cout << res << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
7 Correct 0 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
7 Correct 0 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
7 Correct 0 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Execution timed out 2054 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 5908 KB Output is correct
2 Correct 119 ms 5716 KB Output is correct
3 Correct 119 ms 5712 KB Output is correct
4 Correct 118 ms 5908 KB Output is correct
5 Correct 82 ms 5712 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2028 ms 1624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 5972 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
7 Correct 0 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Execution timed out 2054 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -