oj.uz

Submission #421037

# Submission time Handle Problem Language Result Execution time Memory
421037 2021-06-08T16:46:49 Z davi_bart Financial Report (JOI21_financial) C++17
0 / 100
 4000 ms 1048580 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int N,D;
vector<int> v;
int memo[300010];
int val[300010];
int prev[300010];
const int dim=300;
vector<pair<int,int> > ma(100000);
struct min_queue{
    deque<pair<int,int> >q;
    int top(){
        return q.front().fi;
    }
    void insert(int v,int t){
        while(q.size() && q.back().fi>=v)q.pop_back();
        q.pb({v,t});
    }
    void pop(int t){
        while(q.size() && q.front().se<=t)q.pop_front();
    }
}q;
struct fenwick{
    const int dim=1<<19;
    vector<int> f=vector<int> (dim,0);
    void upd(int pos,int val){
        for(int i=pos;i<dim;i+=i&(-i))f[pos]=max(f[pos],val);
    }
    int ma(int pos){
        int ans=0;
        for(int i=pos;i>0;i-=i&(-i))ans=max(ans,f[pos]);
        return ans;
    }
};
vector<fenwick> z;
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);
    cin>>N>>D;
    vector<int> p={0};
    v.pb(0);
    for(int i=0;i<N;i++){
        int a;cin>>a;
        v.pb(a);
        p.pb(a);
    }
    sort(p.begin(),p.end());
    p.resize(unique(p.begin(),p.end())-p.begin());
    map<int,int> l;
    for(int i=0;i<p.size();i++)l[p[i]]=i;
    for(int i=0;i<=N;i++)v[i]=l[v[i]];


    for(int i=0;i<=N;i++){
        if(i%dim==0)z.pb(fenwick());
    }
    for(int i=0;i<=N;i++){
        q.insert(v[i],i);
        q.pop(i-D);
        val[i]=q.top();
    }
    int ans=0;
    for(int i=1;i<=N;i++){
        memo[i]=1;
        int pos=i-i%dim;
        for(int j=pos;j>=0;j-=dim){
            if(ma[j/dim].fi<v[i]){
                memo[i]=max(memo[i],z[j/dim].ma(v[i]-1)+1);
                /*for(int h=j;h<min(i,j+dim);h++){
                    if(v[h]<v[i]){
                        memo[i]=max(memo[i],memo[h]+1);
                    }
                }*/
            }else{
                for(int h=min(i-1,j+dim-1);h>=j;h--){
                    if(val[h]>=v[i])break;
                    if(v[h]<v[i]){
                        memo[i]=max(memo[i],memo[h]+1);
                    }
                }
                break;
            }
        }

        ans=max(ans,memo[i]);
        ma[i/dim].se=max(ma[i/dim].se,memo[i]);
        ma[i/dim].fi=max(ma[i/dim].fi,val[i]);
        z[i/dim].upd(v[i],memo[i]);
    }
    cout<<ans<<endl;

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:57:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i=0;i<p.size();i++)l[p[i]]=i;
      |                 ~^~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5964 KB Output is correct
2 Execution timed out 4066 ms 5964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5964 KB Output is correct
2 Execution timed out 4066 ms 5964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5964 KB Output is correct
2 Execution timed out 4066 ms 5964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 512 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 485 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5964 KB Output is correct
2 Execution timed out 4066 ms 5964 KB Time limit exceeded
3 Halted 0 ms 0 KB -