oj.uz

Submission #421047

# Submission time Handle Problem Language Result Execution time Memory
421047 2021-06-08T16:52:19 Z davi_bart Financial Report (JOI21_financial) C++17
60 / 100
 4000 ms 432828 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=1500;
vector<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]<v[i]){
                memo[i]=max(memo[i],z[j/dim].ma(v[i]-1)+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]=max(ma[i/dim],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 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 2 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2764 KB Output is correct
19 Correct 1 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 2 ms 2764 KB Output is correct
24 Correct 2 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 2 ms 2764 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 2 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2764 KB Output is correct
19 Correct 1 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 2 ms 2764 KB Output is correct
24 Correct 2 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 2 ms 2764 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 3 ms 2764 KB Output is correct
29 Correct 2 ms 2784 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2768 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 2 ms 2768 KB Output is correct
34 Correct 2 ms 2764 KB Output is correct
35 Correct 2 ms 2776 KB Output is correct
36 Correct 2 ms 2764 KB Output is correct
37 Correct 2 ms 2756 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 3 ms 2784 KB Output is correct
41 Correct 9 ms 11124 KB Output is correct
42 Correct 10 ms 11468 KB Output is correct
43 Correct 10 ms 11060 KB Output is correct
44 Correct 10 ms 11212 KB Output is correct
45 Correct 9 ms 11212 KB Output is correct
46 Correct 10 ms 11468 KB Output is correct
47 Correct 18 ms 11396 KB Output is correct
48 Correct 13 ms 11440 KB Output is correct
49 Correct 12 ms 11468 KB Output is correct
50 Correct 11 ms 11468 KB Output is correct
51 Correct 9 ms 11468 KB Output is correct
52 Correct 13 ms 11436 KB Output is correct
53 Correct 9 ms 11468 KB Output is correct
54 Correct 12 ms 11468 KB Output is correct
55 Correct 10 ms 11468 KB Output is correct
56 Correct 12 ms 11360 KB Output is correct
57 Correct 10 ms 11440 KB Output is correct
58 Correct 10 ms 11424 KB Output is correct
59 Correct 10 ms 11468 KB Output is correct
60 Correct 9 ms 11468 KB Output is correct
61 Correct 10 ms 11340 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 418816 KB Output is correct
2 Correct 265 ms 416824 KB Output is correct
3 Correct 271 ms 416840 KB Output is correct
4 Correct 591 ms 430636 KB Output is correct
5 Correct 452 ms 432656 KB Output is correct
6 Correct 541 ms 432780 KB Output is correct
7 Correct 1349 ms 428536 KB Output is correct
8 Correct 337 ms 430676 KB Output is correct
9 Correct 995 ms 432776 KB Output is correct
10 Correct 389 ms 432780 KB Output is correct
11 Correct 405 ms 432828 KB Output is correct
12 Correct 477 ms 432704 KB Output is correct
13 Correct 703 ms 432732 KB Output is correct
14 Correct 520 ms 432808 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 524 ms 418888 KB Output is correct
2 Correct 571 ms 416876 KB Output is correct
3 Correct 804 ms 416716 KB Output is correct
4 Execution timed out 4115 ms 432724 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 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 2 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 2 ms 2764 KB Output is correct
13 Correct 2 ms 2764 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 2 ms 2764 KB Output is correct
19 Correct 1 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 2 ms 2764 KB Output is correct
23 Correct 2 ms 2764 KB Output is correct
24 Correct 2 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 2 ms 2764 KB Output is correct
27 Correct 2 ms 2764 KB Output is correct
28 Correct 3 ms 2764 KB Output is correct
29 Correct 2 ms 2784 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 2 ms 2768 KB Output is correct
32 Correct 2 ms 2764 KB Output is correct
33 Correct 2 ms 2768 KB Output is correct
34 Correct 2 ms 2764 KB Output is correct
35 Correct 2 ms 2776 KB Output is correct
36 Correct 2 ms 2764 KB Output is correct
37 Correct 2 ms 2756 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 3 ms 2784 KB Output is correct
41 Correct 9 ms 11124 KB Output is correct
42 Correct 10 ms 11468 KB Output is correct
43 Correct 10 ms 11060 KB Output is correct
44 Correct 10 ms 11212 KB Output is correct
45 Correct 9 ms 11212 KB Output is correct
46 Correct 10 ms 11468 KB Output is correct
47 Correct 18 ms 11396 KB Output is correct
48 Correct 13 ms 11440 KB Output is correct
49 Correct 12 ms 11468 KB Output is correct
50 Correct 11 ms 11468 KB Output is correct
51 Correct 9 ms 11468 KB Output is correct
52 Correct 13 ms 11436 KB Output is correct
53 Correct 9 ms 11468 KB Output is correct
54 Correct 12 ms 11468 KB Output is correct
55 Correct 10 ms 11468 KB Output is correct
56 Correct 12 ms 11360 KB Output is correct
57 Correct 10 ms 11440 KB Output is correct
58 Correct 10 ms 11424 KB Output is correct
59 Correct 10 ms 11468 KB Output is correct
60 Correct 9 ms 11468 KB Output is correct
61 Correct 10 ms 11340 KB Output is correct
62 Correct 237 ms 418816 KB Output is correct
63 Correct 265 ms 416824 KB Output is correct
64 Correct 271 ms 416840 KB Output is correct
65 Correct 591 ms 430636 KB Output is correct
66 Correct 452 ms 432656 KB Output is correct
67 Correct 541 ms 432780 KB Output is correct
68 Correct 1349 ms 428536 KB Output is correct
69 Correct 337 ms 430676 KB Output is correct
70 Correct 995 ms 432776 KB Output is correct
71 Correct 389 ms 432780 KB Output is correct
72 Correct 405 ms 432828 KB Output is correct
73 Correct 477 ms 432704 KB Output is correct
74 Correct 703 ms 432732 KB Output is correct
75 Correct 520 ms 432808 KB Output is correct
76 Correct 524 ms 418888 KB Output is correct
77 Correct 571 ms 416876 KB Output is correct
78 Correct 804 ms 416716 KB Output is correct
79 Execution timed out 4115 ms 432724 KB Time limit exceeded
80 Halted 0 ms 0 KB -