Submission #1147766

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147766		guagua0407	Financial Report (JOI21_financial)	C++20	100 / 100	333 ms	38148 KiB

Main

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int inf=1e9;
const int mxn=3e5+5;
int mn[mxn][20];

vector<int> lz(mxn*4,-1);
vector<int> seg(mxn*4);

void push(int v){
    if(lz[v]!=-1){
        seg[v*2]=lz[v];
        lz[v*2]=lz[v];
        seg[v*2+1]=lz[v];
        lz[v*2+1]=lz[v];
        lz[v]=-1;
    }
}

void upd(int pos,int val,int l=0,int r=mxn-1,int v=1){
    if(l==r){
        seg[v]=max(seg[v],val);
        return;
    }
    if(l<r) push(v);
    int mid=(l+r)/2;
    if(pos<=mid){
        upd(pos,val,l,mid,v*2);
    }
    else{
        upd(pos,val,mid+1,r,v*2+1);
    }
    seg[v]=max(seg[v*2],seg[v*2+1]);
}

void st(int tl,int tr,int val,int l=0,int r=mxn-1,int v=1){
    if(r<tl or tr<l){
        return;
    }
    if(tl<=l and r<=tr){
        lz[v]=val;
        seg[v]=val;
        return;
    }
    if(l<r) push(v);
    int mid=(l+r)/2;
    st(tl,min(mid,tr),val,l,mid,v*2);
    st(max(mid+1,tl),tr,val,mid+1,r,v*2+1);
    seg[v]=max(seg[v*2],seg[v*2+1]);
}

int query(int tl,int tr,int l=0,int r=mxn-1,int v=1){
    if(r<tl or tr<l){
        return 0;
    }
    if(tl<=l and r<=tr){
        return seg[v];
    }
    if(l<r) push(v);
    int mid=(l+r)/2;
    return max(query(tl,min(mid,tr),l,mid,v*2),query(max(mid+1,tl),tr,mid+1,r,v*2+1));
}

int main() {_
    int n,d;
    cin>>n>>d;
    vector<int> a(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    vector<int> xs;
    xs.push_back(-1);
    for(int i=1;i<=n;i++){
        xs.push_back(a[i]);
    }
    sort(all(xs));
    xs.resize(unique(all(xs))-xs.begin());
    for(int i=1;i<=n;i++){
        a[i]=lower_bound(all(xs),a[i])-xs.begin();
    }
    for(int i=1;i<=n;i++){
        mn[i][0]=a[i];
    }
    for(int j=1;j<20;j++){
        for(int i=1;i+(1<<j)-1<=n;i++){
            mn[i][j]=min(mn[i][j-1],mn[i+(1<<(j-1))][j-1]);
        }
    }
    function<int(int,int)> get=[&](int l,int r){
        int bit=__lg(r-l+1);
        return min(mn[l][bit],mn[r-(1<<bit)+1][bit]);
    };
    vector<int> dp(n+1);
    vector<int> curmx(n+1);
    for(int i=1;i<=n;i++){
        dp[i]=query(0,a[i]-1)+1;
        if(i>=d){
            int curmn=get(i-d+1,i);
            st(0,curmn-1,0);
        }
        upd(a[i],dp[i]);
        //cout<<dp[i]<<' ';
    }
    cout<<*max_element(all(dp))<<'\n';
    return 0;
}
//maybe its multiset not set
//yeeorz
//diaoborz

Compilation message (stderr)

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 12 / 12
• Subtask 5: 5 / 5
• Subtask 6: 35 / 35