제출 #1226819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1226819		yassia	Cloud Computing (CEOI18_clo)	C++20	0 / 100	120 ms	235284 KiB

clo

#ifndef local
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = int;
using pll = pair<ll,ll>;
using str = string;
using ld = long double;
auto sd = std::chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(sd);
struct node{
    ll ans, l, r;
    node(){
        ans = 0;
        l = -1;
        r = -1;
    }
};
node d1[10000005];
node d2[10000005];
int sz = 1;
void update1(int v, ll left, ll right, ll ix, ll val){
    if (ix < left || right<=ix) {
        return;
    }
    else if (ix == left && ix+1==right) {
        d1[v].ans =val;
        return;
    }
    else {
        ll mid = (left + right)/2;
        if (d1[v].l ==-1) d1[v].l = sz++; update1(d1[v].l, left, mid, ix, val);
        if (d1[v].r==-1) d1[v].r = sz++; update1(d1[v].r, mid, right, ix,val);
        d1[v].ans = max(d1[d1[v].l].ans, d1[d1[v].r].ans);
    }
}
ll get1(ll v, ll left, ll right, ll sl, ll sr) {
    if (right <= sl || left >= sr) {
        return 0;
    }
    else if (sl <= left && right <= sr) {
        return d1[v].ans;
    }
    else {
        ll mid = (left + right)/2;
        ll ansl = 0; ll ansr = 0;
        if (d1[v].l != -1) ansl = get1(d1[v].l, left, mid, sl, sr);
        if (d1[v].r != -1) ansr =get1(d1[v].r, mid, right, sl, sr);
        return max(ansl,ansr);
    }
}
void update2(int v, ll left, ll right, ll ix, ll val){
    if (ix < left || right<=ix) {
        return;
    }
    else if (ix == left && ix+1==right) {
        d2[v].ans =val;
        return;
    }
    else {
        ll mid = (left + right)/2;
        if (d2[v].l ==-1) d2[v].l = sz++; update2(d2[v].l, left, mid, ix, val);
        if (d2[v].r==-1) d2[v].r = sz++; update2(d2[v].r, mid, right, ix,val);
        d2[v].ans = max(d2[d2[v].l].ans, d2[d2[v].r].ans);
    }
}
ll get2(ll v, ll left, ll right, ll sl, ll sr) {
    if (right <= sl || left >= sr) {
        return 0;
    }
    else if (sl <= left && right <= sr) {
        return d2[v].ans;
    }
    else {
        ll mid = (left + right)/2;
        ll ansl = 0; ll ansr = 0;
        if (d2[v].l != -1) ansl = get2(d2[v].l, left, mid, sl, sr);
        if (d2[v].r != -1) ansr =get2(d2[v].r, mid, right, sl, sr);
        return max(ansl,ansr);
    }
}

vector<vector<ll>> changes;
ll dp[200005];
ll dp1[200005];
int t[200005];
void solve1() {
    ll n, x;
    cin >> n >> x;
    ll maxA = x;
    for (int i =0; i <n ;i++){
        cin>>t[i];
        maxA= max(maxA, t[i]);
    }
    ll cnt= maxA;

    ll mx = 0;
    for (int i = n-1; i >=0; i--){
        dp[i] = get1(0, 0, cnt+1, t[i]+1, cnt+1)+1;
        mx =max(mx, dp[i]);
        changes.push_back({t[i], get1(0, 0, cnt+1, t[i], t[i]+1)});
        if (changes.back()[1] < dp[i]) {
            update1(0, 0, cnt+1, t[i], dp[i]);
        }
    }
    for (int i =0; i < n; i++){
        update1(0, 0, cnt+1, changes.back()[0],changes.back()[1]);
        dp1[i] = get2(0, 0, cnt+1, 0, t[i])+1;
        if (get2(0, 0, cnt+1, t[i] ,t[i]+1)< dp1[i]){
            update2(0, 0, cnt+1, t[i], dp1[i]);
        }
        mx= max(mx, dp1[i]);
        mx = max(mx, dp1[i] + get1(0, 0, cnt+1, max(0, t[i]-x+1), cnt+1));
        changes.pop_back();
    }
    cout<<mx;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
#ifdef local
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    ll t1 = 1;
    for (int _ = 0; _ < t1; ++_) solve1();
#ifdef local
    printf_s("\n%.5f s", (double) clock() / CLOCKS_PER_SEC);
#endif
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10