oj.uz

Submission #421043

# Submission time Handle Problem Language Result Execution time Memory
421043 2021-06-08T16:49:06 Z davi_bart Financial Report (JOI21_financial) C++17
48 / 100
 493 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){
        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:59: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]
   59 |     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 3 ms 5964 KB Output is correct
2 Correct 3 ms 5964 KB Output is correct
3 Correct 3 ms 5964 KB Output is correct
4 Correct 4 ms 5964 KB Output is correct
5 Correct 4 ms 5960 KB Output is correct
6 Correct 3 ms 5964 KB Output is correct
7 Correct 3 ms 5964 KB Output is correct
8 Correct 3 ms 5964 KB Output is correct
9 Correct 4 ms 5964 KB Output is correct
10 Correct 4 ms 5964 KB Output is correct
11 Correct 3 ms 5964 KB Output is correct
12 Correct 3 ms 5964 KB Output is correct
13 Correct 3 ms 5964 KB Output is correct
14 Correct 3 ms 5964 KB Output is correct
15 Correct 3 ms 5964 KB Output is correct
16 Correct 3 ms 5964 KB Output is correct
17 Correct 3 ms 5964 KB Output is correct
18 Correct 3 ms 5964 KB Output is correct
19 Correct 3 ms 5964 KB Output is correct
20 Correct 4 ms 5964 KB Output is correct
21 Correct 3 ms 5964 KB Output is correct
22 Correct 3 ms 5964 KB Output is correct
23 Correct 3 ms 5964 KB Output is correct
24 Correct 5 ms 5964 KB Output is correct
25 Correct 3 ms 5964 KB Output is correct
26 Correct 4 ms 5964 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5964 KB Output is correct
2 Correct 3 ms 5964 KB Output is correct
3 Correct 3 ms 5964 KB Output is correct
4 Correct 4 ms 5964 KB Output is correct
5 Correct 4 ms 5960 KB Output is correct
6 Correct 3 ms 5964 KB Output is correct
7 Correct 3 ms 5964 KB Output is correct
8 Correct 3 ms 5964 KB Output is correct
9 Correct 4 ms 5964 KB Output is correct
10 Correct 4 ms 5964 KB Output is correct
11 Correct 3 ms 5964 KB Output is correct
12 Correct 3 ms 5964 KB Output is correct
13 Correct 3 ms 5964 KB Output is correct
14 Correct 3 ms 5964 KB Output is correct
15 Correct 3 ms 5964 KB Output is correct
16 Correct 3 ms 5964 KB Output is correct
17 Correct 3 ms 5964 KB Output is correct
18 Correct 3 ms 5964 KB Output is correct
19 Correct 3 ms 5964 KB Output is correct
20 Correct 4 ms 5964 KB Output is correct
21 Correct 3 ms 5964 KB Output is correct
22 Correct 3 ms 5964 KB Output is correct
23 Correct 3 ms 5964 KB Output is correct
24 Correct 5 ms 5964 KB Output is correct
25 Correct 3 ms 5964 KB Output is correct
26 Correct 4 ms 5964 KB Output is correct
27 Correct 6 ms 10188 KB Output is correct
28 Correct 7 ms 10060 KB Output is correct
29 Correct 6 ms 10060 KB Output is correct
30 Correct 6 ms 10060 KB Output is correct
31 Correct 6 ms 10060 KB Output is correct
32 Correct 6 ms 10060 KB Output is correct
33 Correct 6 ms 10060 KB Output is correct
34 Correct 7 ms 10060 KB Output is correct
35 Correct 7 ms 10060 KB Output is correct
36 Correct 6 ms 10060 KB Output is correct
37 Correct 6 ms 10060 KB Output is correct
38 Correct 6 ms 10060 KB Output is correct
39 Correct 5 ms 10060 KB Output is correct
40 Correct 6 ms 10120 KB Output is correct
41 Correct 54 ms 100820 KB Output is correct
42 Correct 51 ms 96936 KB Output is correct
43 Correct 51 ms 100680 KB Output is correct
44 Correct 51 ms 88440 KB Output is correct
45 Correct 49 ms 92624 KB Output is correct
46 Correct 59 ms 101060 KB Output is correct
47 Correct 52 ms 96964 KB Output is correct
48 Correct 53 ms 96972 KB Output is correct
49 Correct 59 ms 101160 KB Output is correct
50 Correct 57 ms 101128 KB Output is correct
51 Correct 55 ms 101060 KB Output is correct
52 Correct 59 ms 101076 KB Output is correct
53 Correct 54 ms 101068 KB Output is correct
54 Correct 54 ms 101136 KB Output is correct
55 Correct 55 ms 101060 KB Output is correct
56 Correct 56 ms 101092 KB Output is correct
57 Correct 56 ms 101156 KB Output is correct
58 Correct 55 ms 101104 KB Output is correct
59 Correct 53 ms 101076 KB Output is correct
60 Correct 61 ms 96984 KB Output is correct
61 Correct 52 ms 96980 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 493 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 490 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 Correct 3 ms 5964 KB Output is correct
3 Correct 3 ms 5964 KB Output is correct
4 Correct 4 ms 5964 KB Output is correct
5 Correct 4 ms 5960 KB Output is correct
6 Correct 3 ms 5964 KB Output is correct
7 Correct 3 ms 5964 KB Output is correct
8 Correct 3 ms 5964 KB Output is correct
9 Correct 4 ms 5964 KB Output is correct
10 Correct 4 ms 5964 KB Output is correct
11 Correct 3 ms 5964 KB Output is correct
12 Correct 3 ms 5964 KB Output is correct
13 Correct 3 ms 5964 KB Output is correct
14 Correct 3 ms 5964 KB Output is correct
15 Correct 3 ms 5964 KB Output is correct
16 Correct 3 ms 5964 KB Output is correct
17 Correct 3 ms 5964 KB Output is correct
18 Correct 3 ms 5964 KB Output is correct
19 Correct 3 ms 5964 KB Output is correct
20 Correct 4 ms 5964 KB Output is correct
21 Correct 3 ms 5964 KB Output is correct
22 Correct 3 ms 5964 KB Output is correct
23 Correct 3 ms 5964 KB Output is correct
24 Correct 5 ms 5964 KB Output is correct
25 Correct 3 ms 5964 KB Output is correct
26 Correct 4 ms 5964 KB Output is correct
27 Correct 6 ms 10188 KB Output is correct
28 Correct 7 ms 10060 KB Output is correct
29 Correct 6 ms 10060 KB Output is correct
30 Correct 6 ms 10060 KB Output is correct
31 Correct 6 ms 10060 KB Output is correct
32 Correct 6 ms 10060 KB Output is correct
33 Correct 6 ms 10060 KB Output is correct
34 Correct 7 ms 10060 KB Output is correct
35 Correct 7 ms 10060 KB Output is correct
36 Correct 6 ms 10060 KB Output is correct
37 Correct 6 ms 10060 KB Output is correct
38 Correct 6 ms 10060 KB Output is correct
39 Correct 5 ms 10060 KB Output is correct
40 Correct 6 ms 10120 KB Output is correct
41 Correct 54 ms 100820 KB Output is correct
42 Correct 51 ms 96936 KB Output is correct
43 Correct 51 ms 100680 KB Output is correct
44 Correct 51 ms 88440 KB Output is correct
45 Correct 49 ms 92624 KB Output is correct
46 Correct 59 ms 101060 KB Output is correct
47 Correct 52 ms 96964 KB Output is correct
48 Correct 53 ms 96972 KB Output is correct
49 Correct 59 ms 101160 KB Output is correct
50 Correct 57 ms 101128 KB Output is correct
51 Correct 55 ms 101060 KB Output is correct
52 Correct 59 ms 101076 KB Output is correct
53 Correct 54 ms 101068 KB Output is correct
54 Correct 54 ms 101136 KB Output is correct
55 Correct 55 ms 101060 KB Output is correct
56 Correct 56 ms 101092 KB Output is correct
57 Correct 56 ms 101156 KB Output is correct
58 Correct 55 ms 101104 KB Output is correct
59 Correct 53 ms 101076 KB Output is correct
60 Correct 61 ms 96984 KB Output is correct
61 Correct 52 ms 96980 KB Output is correct
62 Runtime error 493 ms 1048580 KB Execution killed with signal 9
63 Halted 0 ms 0 KB -