oj.uz

Submission #421044

# Submission time Handle Problem Language Result Execution time Memory
421044 2021-06-08T16:49:43 Z davi_bart Financial Report (JOI21_financial) C++17
60 / 100
 4000 ms 638788 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#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=1000;
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){
        pos+=10;
        for(int i=pos;i<dim;i+=i&(-i))f[i]=max(f[i],val);
    }
    int ma(int pos){
        pos+=10;
        int ans=0;
        for(int i=pos;i>0;i-=i&(-i))ans=max(ans,f[i]);
        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:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     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 2 ms 3148 KB Output is correct
2 Correct 2 ms 3148 KB Output is correct
3 Correct 2 ms 3148 KB Output is correct
4 Correct 2 ms 3148 KB Output is correct
5 Correct 2 ms 3148 KB Output is correct
6 Correct 2 ms 3148 KB Output is correct
7 Correct 2 ms 3148 KB Output is correct
8 Correct 2 ms 3148 KB Output is correct
9 Correct 2 ms 3148 KB Output is correct
10 Correct 2 ms 3148 KB Output is correct
11 Correct 2 ms 3148 KB Output is correct
12 Correct 3 ms 3148 KB Output is correct
13 Correct 2 ms 3148 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct
15 Correct 2 ms 3148 KB Output is correct
16 Correct 2 ms 3148 KB Output is correct
17 Correct 2 ms 3148 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 2 ms 3148 KB Output is correct
20 Correct 2 ms 3148 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 2 ms 3148 KB Output is correct
24 Correct 2 ms 3148 KB Output is correct
25 Correct 2 ms 3148 KB Output is correct
26 Correct 2 ms 3148 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3148 KB Output is correct
2 Correct 2 ms 3148 KB Output is correct
3 Correct 2 ms 3148 KB Output is correct
4 Correct 2 ms 3148 KB Output is correct
5 Correct 2 ms 3148 KB Output is correct
6 Correct 2 ms 3148 KB Output is correct
7 Correct 2 ms 3148 KB Output is correct
8 Correct 2 ms 3148 KB Output is correct
9 Correct 2 ms 3148 KB Output is correct
10 Correct 2 ms 3148 KB Output is correct
11 Correct 2 ms 3148 KB Output is correct
12 Correct 3 ms 3148 KB Output is correct
13 Correct 2 ms 3148 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct
15 Correct 2 ms 3148 KB Output is correct
16 Correct 2 ms 3148 KB Output is correct
17 Correct 2 ms 3148 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 2 ms 3148 KB Output is correct
20 Correct 2 ms 3148 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 2 ms 3148 KB Output is correct
24 Correct 2 ms 3148 KB Output is correct
25 Correct 2 ms 3148 KB Output is correct
26 Correct 2 ms 3148 KB Output is correct
27 Correct 2 ms 3148 KB Output is correct
28 Correct 2 ms 3148 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 2 ms 3148 KB Output is correct
31 Correct 2 ms 3148 KB Output is correct
32 Correct 2 ms 3148 KB Output is correct
33 Correct 2 ms 3148 KB Output is correct
34 Correct 2 ms 3148 KB Output is correct
35 Correct 3 ms 3148 KB Output is correct
36 Correct 3 ms 3148 KB Output is correct
37 Correct 2 ms 3148 KB Output is correct
38 Correct 2 ms 3192 KB Output is correct
39 Correct 2 ms 3148 KB Output is correct
40 Correct 2 ms 3148 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3148 KB Output is correct
2 Correct 2 ms 3148 KB Output is correct
3 Correct 2 ms 3148 KB Output is correct
4 Correct 2 ms 3148 KB Output is correct
5 Correct 2 ms 3148 KB Output is correct
6 Correct 2 ms 3148 KB Output is correct
7 Correct 2 ms 3148 KB Output is correct
8 Correct 2 ms 3148 KB Output is correct
9 Correct 2 ms 3148 KB Output is correct
10 Correct 2 ms 3148 KB Output is correct
11 Correct 2 ms 3148 KB Output is correct
12 Correct 3 ms 3148 KB Output is correct
13 Correct 2 ms 3148 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct
15 Correct 2 ms 3148 KB Output is correct
16 Correct 2 ms 3148 KB Output is correct
17 Correct 2 ms 3148 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 2 ms 3148 KB Output is correct
20 Correct 2 ms 3148 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 2 ms 3148 KB Output is correct
24 Correct 2 ms 3148 KB Output is correct
25 Correct 2 ms 3148 KB Output is correct
26 Correct 2 ms 3148 KB Output is correct
27 Correct 2 ms 3148 KB Output is correct
28 Correct 2 ms 3148 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 2 ms 3148 KB Output is correct
31 Correct 2 ms 3148 KB Output is correct
32 Correct 2 ms 3148 KB Output is correct
33 Correct 2 ms 3148 KB Output is correct
34 Correct 2 ms 3148 KB Output is correct
35 Correct 3 ms 3148 KB Output is correct
36 Correct 3 ms 3148 KB Output is correct
37 Correct 2 ms 3148 KB Output is correct
38 Correct 2 ms 3192 KB Output is correct
39 Correct 2 ms 3148 KB Output is correct
40 Correct 2 ms 3148 KB Output is correct
41 Correct 12 ms 17740 KB Output is correct
42 Correct 14 ms 15948 KB Output is correct
43 Correct 11 ms 15564 KB Output is correct
44 Correct 12 ms 15692 KB Output is correct
45 Correct 12 ms 15696 KB Output is correct
46 Correct 14 ms 18020 KB Output is correct
47 Correct 17 ms 15960 KB Output is correct
48 Correct 15 ms 15948 KB Output is correct
49 Correct 15 ms 15972 KB Output is correct
50 Correct 15 ms 18044 KB Output is correct
51 Correct 13 ms 17996 KB Output is correct
52 Correct 14 ms 18012 KB Output is correct
53 Correct 13 ms 18020 KB Output is correct
54 Correct 13 ms 17960 KB Output is correct
55 Correct 14 ms 17996 KB Output is correct
56 Correct 13 ms 15924 KB Output is correct
57 Correct 13 ms 15948 KB Output is correct
58 Correct 13 ms 18004 KB Output is correct
59 Correct 13 ms 18040 KB Output is correct
60 Correct 12 ms 15896 KB Output is correct
61 Correct 12 ms 15980 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 624888 KB Output is correct
2 Correct 340 ms 622708 KB Output is correct
3 Correct 366 ms 622828 KB Output is correct
4 Correct 609 ms 636744 KB Output is correct
5 Correct 549 ms 638780 KB Output is correct
6 Correct 701 ms 638692 KB Output is correct
7 Correct 2544 ms 634552 KB Output is correct
8 Correct 432 ms 636620 KB Output is correct
9 Correct 1820 ms 638748 KB Output is correct
10 Correct 436 ms 638744 KB Output is correct
11 Correct 514 ms 638756 KB Output is correct
12 Correct 537 ms 638788 KB Output is correct
13 Correct 799 ms 638744 KB Output is correct
14 Correct 627 ms 638692 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 748 ms 624876 KB Output is correct
2 Correct 872 ms 622812 KB Output is correct
3 Correct 1249 ms 622880 KB Output is correct
4 Execution timed out 4062 ms 638704 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3148 KB Output is correct
2 Correct 2 ms 3148 KB Output is correct
3 Correct 2 ms 3148 KB Output is correct
4 Correct 2 ms 3148 KB Output is correct
5 Correct 2 ms 3148 KB Output is correct
6 Correct 2 ms 3148 KB Output is correct
7 Correct 2 ms 3148 KB Output is correct
8 Correct 2 ms 3148 KB Output is correct
9 Correct 2 ms 3148 KB Output is correct
10 Correct 2 ms 3148 KB Output is correct
11 Correct 2 ms 3148 KB Output is correct
12 Correct 3 ms 3148 KB Output is correct
13 Correct 2 ms 3148 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct
15 Correct 2 ms 3148 KB Output is correct
16 Correct 2 ms 3148 KB Output is correct
17 Correct 2 ms 3148 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 2 ms 3148 KB Output is correct
20 Correct 2 ms 3148 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 2 ms 3148 KB Output is correct
23 Correct 2 ms 3148 KB Output is correct
24 Correct 2 ms 3148 KB Output is correct
25 Correct 2 ms 3148 KB Output is correct
26 Correct 2 ms 3148 KB Output is correct
27 Correct 2 ms 3148 KB Output is correct
28 Correct 2 ms 3148 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 2 ms 3148 KB Output is correct
31 Correct 2 ms 3148 KB Output is correct
32 Correct 2 ms 3148 KB Output is correct
33 Correct 2 ms 3148 KB Output is correct
34 Correct 2 ms 3148 KB Output is correct
35 Correct 3 ms 3148 KB Output is correct
36 Correct 3 ms 3148 KB Output is correct
37 Correct 2 ms 3148 KB Output is correct
38 Correct 2 ms 3192 KB Output is correct
39 Correct 2 ms 3148 KB Output is correct
40 Correct 2 ms 3148 KB Output is correct
41 Correct 12 ms 17740 KB Output is correct
42 Correct 14 ms 15948 KB Output is correct
43 Correct 11 ms 15564 KB Output is correct
44 Correct 12 ms 15692 KB Output is correct
45 Correct 12 ms 15696 KB Output is correct
46 Correct 14 ms 18020 KB Output is correct
47 Correct 17 ms 15960 KB Output is correct
48 Correct 15 ms 15948 KB Output is correct
49 Correct 15 ms 15972 KB Output is correct
50 Correct 15 ms 18044 KB Output is correct
51 Correct 13 ms 17996 KB Output is correct
52 Correct 14 ms 18012 KB Output is correct
53 Correct 13 ms 18020 KB Output is correct
54 Correct 13 ms 17960 KB Output is correct
55 Correct 14 ms 17996 KB Output is correct
56 Correct 13 ms 15924 KB Output is correct
57 Correct 13 ms 15948 KB Output is correct
58 Correct 13 ms 18004 KB Output is correct
59 Correct 13 ms 18040 KB Output is correct
60 Correct 12 ms 15896 KB Output is correct
61 Correct 12 ms 15980 KB Output is correct
62 Correct 334 ms 624888 KB Output is correct
63 Correct 340 ms 622708 KB Output is correct
64 Correct 366 ms 622828 KB Output is correct
65 Correct 609 ms 636744 KB Output is correct
66 Correct 549 ms 638780 KB Output is correct
67 Correct 701 ms 638692 KB Output is correct
68 Correct 2544 ms 634552 KB Output is correct
69 Correct 432 ms 636620 KB Output is correct
70 Correct 1820 ms 638748 KB Output is correct
71 Correct 436 ms 638744 KB Output is correct
72 Correct 514 ms 638756 KB Output is correct
73 Correct 537 ms 638788 KB Output is correct
74 Correct 799 ms 638744 KB Output is correct
75 Correct 627 ms 638692 KB Output is correct
76 Correct 748 ms 624876 KB Output is correct
77 Correct 872 ms 622812 KB Output is correct
78 Correct 1249 ms 622880 KB Output is correct
79 Execution timed out 4062 ms 638704 KB Time limit exceeded
80 Halted 0 ms 0 KB -