oj.uz

Submission #443237

# Submission time Handle Problem Language Result Execution time Memory
443237 2021-07-10T08:17:06 Z Haruto810198 Global Warming (CEOI18_glo) C++17
0 / 100
 2000 ms 9668 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

const int MAX = 200010;

int n, x;
int arr[MAX][3];
int dp[MAX][3];

vi qu[3];

void modify(int i, int j, int k){

    if(dp[i][j] > szof(qu[k])){
        qu[k].pb(arr[i][j]);
    }
    else{
        qu[k][dp[i][j] - 1] = min(qu[k][dp[i][j] - 1], arr[i][j]);
    }

}

int query(int j, int T){

    /// find max{dp[i][j]} s.t. arr[i] < T

    if(qu[j].empty()){
        return 0;
    }

    if(T <= qu[j][0]){
        return 0;
    }

    int L = 0, R = szof(qu[j]) - 1, mid;

    while(L < R){
        mid = (L + R + 1) / 2;
        if(T > qu[j][mid]){
            L = mid;
        }
        else{
            R = mid - 1;
        }
    }

    /// qu[i] : dp = i + 1
    return L + 1;

}

int solve(int d){

    //cerr<<"solve("<<d<<") : "<<endl;

    /// init
    FOR(j, 0, 2, 1){
        qu[j].clear();
    }

    FOR(i, 1, n, 1){
        arr[i][1] = arr[i][0] + d;
    }

    /// dp
    FOR(i, 1, n, 1){

        FOR(j, 0, 2, 1){
            dp[i][j] = query(j, arr[i][j]) + 1;
            //cerr<<"dp["<<i<<"]["<<j<<"] = "<<dp[i][j]<<"\t";
        }
        //cerr<<endl;

        FOR(j, 0, 2, 1){
            FOR(k, 0, j, 1){
                modify(i, k, j);
            }
            /*
            cerr<<"qu["<<j<<"] : ";
            for(int i : qu[j]){
                cerr<<i<<" ";
            }
            cerr<<endl;
            */
        }

    }

    return max({dp[n][0], dp[n][1], dp[n][2]});

}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>x;
    FOR(i, 1, n, 1){
        cin>>arr[i][0];
        arr[i][2] = arr[i][0];
    }

    int res = 0;
    FOR(d, -x, x, 1){
        res = max(res, solve(d));
    }

    cout<<res<<'\n';

    return 0;

}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -