Submission #482358

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
482358	2021-10-24T06:18:33 Z	Blistering_Barnacles	Global Warming (CEOI18_glo)	C++11	100 / 100	1133 ms	80152 KB

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, suf[555555] , dp1[555555] , dp2[555555] ,tree2[2000005], a[555555] , tree1[2000005], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void update1(ll s , ll e , ll node , ll idx , ll val){
    if(s > idx || e < idx)R ;
    if(s == e){
        tree1[node] = max(tree1[node] , val) ;
        R ;
    }
    update1(s , md , lx , idx , val) , update1(md + 1 , e , rx , idx , val) ;
    tree1[node] = max(tree1[lx] , tree1[rx]) ;
}
ll query1(ll s , ll e , ll node , ll l , ll r){
    if(s > r || e < l || l > r)R 0 ;
    if(l <= s && e <= r)R tree1[node] ;
    R max(query1(md + 1 , e , rx , l , r) , query1(s , md , lx , l , r)) ;
}
void update2(ll s , ll e , ll node , ll idx , ll val){
    if(s > idx || e < idx)R ;
    if(s == e){
        tree2[node] = max(tree2[node] , val) ;
        R ;
    }
    update2(s , md , lx , idx , val) , update2(md + 1 , e , rx , idx , val) ;
    tree2[node] = max(tree2[lx] , tree2[rx]) ;
}
ll query2(ll s , ll e , ll node , ll l , ll r){
    if(s > r || e < l || l > r)R 0 ;
    if(l <= s && e <= r)R tree2[node] ;
    R max(query2(md + 1 , e , rx , l , r) , query2(s , md , lx , l , r)) ;
}
void solve(){
    set < ll > se ;
    cin >> n >> k ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
        se.insert(a[i]) ;
        se.insert(a[i] + k - 1) ;
    }
    for(auto u : se){
        mp[u] = ++m ;
    }
    ll ans = 0 ;
    for(ll i = n ; i >= 1 ; i--){
        dp2[i] = query2(1 , m , 1 , mp[a[i]] + 1 , m) + 1 ;
        update2(1 , m , 1 , mp[a[i]] , dp2[i]) ;
    }
    for(ll i = 1 ; i <= n ; i++){
        ans = max(ans , dp2[i] + query1(1 , m , 1 , 1 , mp[a[i] + k - 1])) ;
        dp1[i] = query1(1 , m , 1 , 1 , mp[a[i]] - 1) + 1 ;
        update1(1 , m , 1 , mp[a[i]] , dp1[i]) ;
    }
    cout << ans << endl ;
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	13336 KB	Output is correct
2	Correct	9 ms	13388 KB	Output is correct
3	Correct	7 ms	13388 KB	Output is correct
4	Correct	8 ms	13388 KB	Output is correct
5	Correct	6 ms	13388 KB	Output is correct
6	Correct	7 ms	13388 KB	Output is correct
7	Correct	7 ms	13428 KB	Output is correct
8	Correct	7 ms	13388 KB	Output is correct
9	Correct	7 ms	13388 KB	Output is correct
10	Correct	6 ms	13388 KB	Output is correct
11	Correct	7 ms	13388 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	13336 KB	Output is correct
2	Correct	9 ms	13388 KB	Output is correct
3	Correct	7 ms	13388 KB	Output is correct
4	Correct	8 ms	13388 KB	Output is correct
5	Correct	6 ms	13388 KB	Output is correct
6	Correct	7 ms	13388 KB	Output is correct
7	Correct	7 ms	13428 KB	Output is correct
8	Correct	7 ms	13388 KB	Output is correct
9	Correct	7 ms	13388 KB	Output is correct
10	Correct	6 ms	13388 KB	Output is correct
11	Correct	7 ms	13388 KB	Output is correct
12	Correct	7 ms	13388 KB	Output is correct
13	Correct	7 ms	13388 KB	Output is correct
14	Correct	6 ms	13388 KB	Output is correct
15	Correct	6 ms	13388 KB	Output is correct
16	Correct	6 ms	13388 KB	Output is correct
17	Correct	7 ms	13348 KB	Output is correct
18	Correct	7 ms	13388 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	13336 KB	Output is correct
2	Correct	9 ms	13388 KB	Output is correct
3	Correct	7 ms	13388 KB	Output is correct
4	Correct	8 ms	13388 KB	Output is correct
5	Correct	6 ms	13388 KB	Output is correct
6	Correct	7 ms	13388 KB	Output is correct
7	Correct	7 ms	13428 KB	Output is correct
8	Correct	7 ms	13388 KB	Output is correct
9	Correct	7 ms	13388 KB	Output is correct
10	Correct	6 ms	13388 KB	Output is correct
11	Correct	7 ms	13388 KB	Output is correct
12	Correct	7 ms	13388 KB	Output is correct
13	Correct	7 ms	13388 KB	Output is correct
14	Correct	6 ms	13388 KB	Output is correct
15	Correct	6 ms	13388 KB	Output is correct
16	Correct	6 ms	13388 KB	Output is correct
17	Correct	7 ms	13348 KB	Output is correct
18	Correct	7 ms	13388 KB	Output is correct
19	Correct	8 ms	13632 KB	Output is correct
20	Correct	10 ms	13644 KB	Output is correct
21	Correct	10 ms	13644 KB	Output is correct
22	Correct	8 ms	13644 KB	Output is correct
23	Correct	10 ms	13516 KB	Output is correct
24	Correct	10 ms	13516 KB	Output is correct
25	Correct	8 ms	13516 KB	Output is correct
26	Correct	8 ms	13596 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	999 ms	78268 KB	Output is correct
2	Correct	1044 ms	78388 KB	Output is correct
3	Correct	1025 ms	78312 KB	Output is correct
4	Correct	1039 ms	78316 KB	Output is correct
5	Correct	306 ms	48136 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	186 ms	29508 KB	Output is correct
2	Correct	163 ms	29576 KB	Output is correct
3	Correct	166 ms	29564 KB	Output is correct
4	Correct	77 ms	22084 KB	Output is correct
5	Correct	6 ms	13388 KB	Output is correct
6	Correct	66 ms	18320 KB	Output is correct
7	Correct	114 ms	27668 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	450 ms	41724 KB	Output is correct
2	Correct	428 ms	41796 KB	Output is correct
3	Correct	1133 ms	70216 KB	Output is correct
4	Correct	326 ms	44100 KB	Output is correct
5	Correct	216 ms	41812 KB	Output is correct
6	Correct	417 ms	67824 KB	Output is correct
7	Correct	427 ms	67788 KB	Output is correct
8	Correct	285 ms	41744 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	13336 KB	Output is correct
2	Correct	9 ms	13388 KB	Output is correct
3	Correct	7 ms	13388 KB	Output is correct
4	Correct	8 ms	13388 KB	Output is correct
5	Correct	6 ms	13388 KB	Output is correct
6	Correct	7 ms	13388 KB	Output is correct
7	Correct	7 ms	13428 KB	Output is correct
8	Correct	7 ms	13388 KB	Output is correct
9	Correct	7 ms	13388 KB	Output is correct
10	Correct	6 ms	13388 KB	Output is correct
11	Correct	7 ms	13388 KB	Output is correct
12	Correct	7 ms	13388 KB	Output is correct
13	Correct	7 ms	13388 KB	Output is correct
14	Correct	6 ms	13388 KB	Output is correct
15	Correct	6 ms	13388 KB	Output is correct
16	Correct	6 ms	13388 KB	Output is correct
17	Correct	7 ms	13348 KB	Output is correct
18	Correct	7 ms	13388 KB	Output is correct
19	Correct	8 ms	13632 KB	Output is correct
20	Correct	10 ms	13644 KB	Output is correct
21	Correct	10 ms	13644 KB	Output is correct
22	Correct	8 ms	13644 KB	Output is correct
23	Correct	10 ms	13516 KB	Output is correct
24	Correct	10 ms	13516 KB	Output is correct
25	Correct	8 ms	13516 KB	Output is correct
26	Correct	8 ms	13596 KB	Output is correct
27	Correct	999 ms	78268 KB	Output is correct
28	Correct	1044 ms	78388 KB	Output is correct
29	Correct	1025 ms	78312 KB	Output is correct
30	Correct	1039 ms	78316 KB	Output is correct
31	Correct	306 ms	48136 KB	Output is correct
32	Correct	186 ms	29508 KB	Output is correct
33	Correct	163 ms	29576 KB	Output is correct
34	Correct	166 ms	29564 KB	Output is correct
35	Correct	77 ms	22084 KB	Output is correct
36	Correct	6 ms	13388 KB	Output is correct
37	Correct	66 ms	18320 KB	Output is correct
38	Correct	114 ms	27668 KB	Output is correct
39	Correct	450 ms	41724 KB	Output is correct
40	Correct	428 ms	41796 KB	Output is correct
41	Correct	1133 ms	70216 KB	Output is correct
42	Correct	326 ms	44100 KB	Output is correct
43	Correct	216 ms	41812 KB	Output is correct
44	Correct	417 ms	67824 KB	Output is correct
45	Correct	427 ms	67788 KB	Output is correct
46	Correct	285 ms	41744 KB	Output is correct
47	Correct	423 ms	46764 KB	Output is correct
48	Correct	446 ms	46828 KB	Output is correct
49	Correct	1121 ms	80152 KB	Output is correct
50	Correct	310 ms	49352 KB	Output is correct
51	Correct	253 ms	39676 KB	Output is correct
52	Correct	354 ms	49504 KB	Output is correct
53	Correct	448 ms	71556 KB	Output is correct
54	Correct	473 ms	72132 KB	Output is correct
55	Correct	684 ms	72936 KB	Output is correct

Submission #482358

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0