oj.uz

Submission #912398

# Submission time Handle Problem Language Result Execution time Memory
912398 2024-01-19T11:52:12 Z vjudge1 Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 196 ms 20608 KB 
#include <bits/stdc++.h>
#define f first
#define s second	
#define ent '\n'
#define int long long

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

using namespace std;
typedef long long ll;
const int mx=1e6+12;
const int mod=1e9+7;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};

int dp[5001][5001];
int tp[mx*4];
int t[mx*4];
int p[mx*4];
int a[mx];
int n,m,k;

void pull(int v,int tl,int tr,int type,int x){
	if(type==2){
		t[v]=x;
		p[v]=x;
		tp[v]=2;
	}
	else{
		t[v]+=x;
		p[v]+=x;
		if(tp[v]!=2)tp[v]=1;
	}
}
 
void push(int v,int tl,int tr){
	if(tl==tr || !tp[v])return;
	int mid=tl+tr>>1;
	pull(v*2,tl,mid,tp[v],p[v]);
	pull(v*2+1,mid+1,tr,tp[v],p[v]);
	tp[v]=0;
	p[v]=0;
}
 
void upd(int v,int tl,int tr,int l,int r,int x,int type){
	if(l>r)return;
	push(v,tl,tr);
	if(tl>r || l>tr)return;
	if(tl>=l && tr<=r){
		tp[v]=type;
		pull(v,tl,tr,tp[v],x);
		return;
	}
	int mid=tl+tr>>1;
	upd(v*2,tl,mid,l,r,x,type);
	upd(v*2+1,mid+1,tr,l,r,x,type);
	t[v]=max(t[v*2],t[v*2+1]);
}
 
int get(int v,int tl,int tr,int l,int r){
	push(v,tl,tr);
	if(tl>r || l>tr)return -1e18;
	if(tl>=l && tr<=r)return t[v];
	int mid=tl+tr>>1;
	return max(get(v*2,tl,mid,l,r),get(v*2+1,mid+1,tr,l,r));
}

int get(int v,int tl,int tr,int x){
	if(t[v]<x)return n+2;
	push(v,tl,tr);
	if(tl==tr){
		return tl;
	}
	int mid=tl+tr>>1;
	if(t[v*2]<x){
		return get(v*2+1,mid+1,tr,x);
	}
	return get(v*2,tl,mid,x);
}

void Press_Fn_with_F11(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	upd(1,0,n,0,n,-1e18,2);
	upd(1,0,n,n,n,0,2);
	for(int i=1;i<=n;i++){
		int pos=get(1,0,n,a[i]-m);
		if(pos>n)pos++;
		int x=get(1,0,n,n-i+1,n-i+1);
		upd(1,0,n,n-i+1,n,m,1);
		upd(1,0,n,pos-1,get(1,0,n,a[i]+1)-1,a[i],2);
		if(x+m>=a[i]){
			upd(1,0,n,n-i,n-i,a[i],2);
		}
	}
	cout<<get(1,0,n,0)<<ent;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int Alikhan_abi_crush=1;
	// cin>>Alikhan_abi_crush;
	while(Alikhan_abi_crush--){
		Press_Fn_with_F11();
	}
}

Compilation message

triusis.cpp: In function 'void push(long long int, long long int, long long int)':
triusis.cpp:39:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |  int mid=tl+tr>>1;
      |          ~~^~~
triusis.cpp: In function 'void upd(long long int, long long int, long long int, long long int, long long int, long long int, long long int)':
triusis.cpp:55:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |  int mid=tl+tr>>1;
      |          ~~^~~
triusis.cpp: In function 'long long int get(long long int, long long int, long long int, long long int, long long int)':
triusis.cpp:65:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |  int mid=tl+tr>>1;
      |          ~~^~~
triusis.cpp: In function 'long long int get(long long int, long long int, long long int, long long int)':
triusis.cpp:75:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   75 |  int mid=tl+tr>>1;
      |          ~~^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 4 ms 6492 KB Output is correct
21 Correct 5 ms 6748 KB Output is correct
22 Correct 3 ms 6748 KB Output is correct
23 Correct 5 ms 6764 KB Output is correct
24 Correct 5 ms 6748 KB Output is correct
25 Correct 5 ms 6748 KB Output is correct
26 Correct 4 ms 6748 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 4 ms 6776 KB Output is correct
29 Correct 6 ms 6748 KB Output is correct
30 Correct 5 ms 6748 KB Output is correct
31 Correct 5 ms 6748 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 4 ms 6744 KB Output is correct

Subtask #3
28.0 / 28.0

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

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 4 ms 6748 KB Output is correct
4 Correct 6 ms 6748 KB Output is correct
5 Correct 6 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 5 ms 6748 KB Output is correct
8 Correct 3 ms 6748 KB Output is correct
9 Correct 4 ms 6748 KB Output is correct
10 Correct 6 ms 6744 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 4 ms 6492 KB Output is correct
15 Correct 5 ms 6748 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 5 ms 6764 KB Output is correct
18 Correct 5 ms 6748 KB Output is correct
19 Correct 5 ms 6748 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 5 ms 6748 KB Output is correct
22 Correct 4 ms 6776 KB Output is correct
23 Correct 6 ms 6748 KB Output is correct
24 Correct 5 ms 6748 KB Output is correct
25 Correct 5 ms 6748 KB Output is correct
26 Correct 4 ms 6748 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4696 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct
41 Correct 1 ms 4440 KB Output is correct
42 Correct 1 ms 4696 KB Output is correct
43 Correct 2 ms 4444 KB Output is correct
44 Correct 169 ms 20564 KB Output is correct
45 Correct 91 ms 20560 KB Output is correct
46 Correct 139 ms 20520 KB Output is correct
47 Correct 139 ms 20560 KB Output is correct
48 Correct 185 ms 20472 KB Output is correct
49 Correct 154 ms 20560 KB Output is correct
50 Correct 162 ms 20416 KB Output is correct
51 Correct 164 ms 20572 KB Output is correct
52 Correct 196 ms 20564 KB Output is correct
53 Correct 83 ms 20568 KB Output is correct
54 Correct 157 ms 20608 KB Output is correct
55 Correct 159 ms 20568 KB Output is correct