oj.uz

Submission #421021

# Submission time Handle Problem Language Result Execution time Memory
421021 2021-06-08T16:32:12 Z davi_bart Financial Report (JOI21_financial) C++17
26 / 100
 1173 ms 30080 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=100;
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;
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++){
        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;
        bool ok=1;
        for(int j=i-1;j>=i-i%dim;j--){
            if(val[j]>=v[i]){
                ok=0;break;
            }
            if(v[j]<v[i]){
                memo[i]=max(memo[i],memo[j]+1);
            }
        }
        if(ok){
            int pos=i-i%dim-dim;
            for(int j=pos;j>=0;j-=dim){
                if(ma[j/dim].fi<v[i])memo[i]=max(memo[i],ma[j/dim].se+1);
                else{
                    for(int h=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]);
        //cout<<memo[i]<<" ";
    }
    //cout<<endl;
    cout<<ans<<endl;

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:44: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]
   44 |     for(int i=0;i<p.size();i++)l[p[i]]=i;
      |                 ~^~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 1 ms 1868 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 1 ms 1868 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 1868 KB Output is correct
23 Correct 1 ms 1868 KB Output is correct
24 Correct 1 ms 1868 KB Output is correct
25 Correct 1 ms 1868 KB Output is correct
26 Correct 1 ms 1868 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 1 ms 1868 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 1 ms 1868 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 1868 KB Output is correct
23 Correct 1 ms 1868 KB Output is correct
24 Correct 1 ms 1868 KB Output is correct
25 Correct 1 ms 1868 KB Output is correct
26 Correct 1 ms 1868 KB Output is correct
27 Correct 1 ms 1868 KB Output is correct
28 Incorrect 1 ms 1868 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 1 ms 1868 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 1 ms 1868 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 1868 KB Output is correct
23 Correct 1 ms 1868 KB Output is correct
24 Correct 1 ms 1868 KB Output is correct
25 Correct 1 ms 1868 KB Output is correct
26 Correct 1 ms 1868 KB Output is correct
27 Correct 1 ms 1868 KB Output is correct
28 Incorrect 1 ms 1868 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 11476 KB Output is correct
2 Correct 66 ms 11476 KB Output is correct
3 Correct 82 ms 11520 KB Output is correct
4 Correct 387 ms 27356 KB Output is correct
5 Correct 299 ms 29956 KB Output is correct
6 Correct 404 ms 30048 KB Output is correct
7 Correct 1173 ms 29808 KB Output is correct
8 Correct 169 ms 29980 KB Output is correct
9 Correct 847 ms 29988 KB Output is correct
10 Correct 185 ms 29984 KB Output is correct
11 Correct 232 ms 29972 KB Output is correct
12 Correct 251 ms 29972 KB Output is correct
13 Correct 393 ms 30012 KB Output is correct
14 Correct 407 ms 30080 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 1 ms 1868 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 1 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 1 ms 1868 KB Output is correct
18 Correct 1 ms 1868 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 1 ms 1868 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 1868 KB Output is correct
23 Correct 1 ms 1868 KB Output is correct
24 Correct 1 ms 1868 KB Output is correct
25 Correct 1 ms 1868 KB Output is correct
26 Correct 1 ms 1868 KB Output is correct
27 Correct 1 ms 1868 KB Output is correct
28 Incorrect 1 ms 1868 KB Output isn't correct
29 Halted 0 ms 0 KB -