Submission #444561

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
444561	2021-07-14T08:59:20 Z	Khizri	Global Warming (CEOI18_glo)	C++17	15 / 100	3 ms	360 KB

glo

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=50+5;
int t=1,n,arr[mxn],x,a[mxn];
int funk(){
	vector<int>vt;
	for(int i=1;i<=n;i++){
		auto it=lower_bound(vt.begin(),vt.end(),arr[i]);
		if(it==vt.end()){
			vt.pb(arr[i]);
		}
		else{
			*it=arr[i];
		}
	}
	return vt.size();
}
void solve(){
	cin>>n>>x;
	
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	int ans=0;
	int k=-x;
	for(int i=1;i<=n;i++){
		memcpy(arr,a,sizeof(a));
		for(int j=i+1;j<=n;j++){
			arr[j]+=k;
			ans=max(ans,funk());
		}
	}
	k=x;
	for(int i=1;i<=n;i++){
		memcpy(arr,a,sizeof(a));
		for(int j=i+1;j<=n;j++){
			arr[j]+=k;
			ans=max(ans,funk());
		}
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	3 ms	204 KB	Output is correct
13	Correct	2 ms	204 KB	Output is correct
14	Correct	2 ms	308 KB	Output is correct
15	Correct	2 ms	204 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Runtime error	1 ms	332 KB	Execution killed with signal 11
20	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	360 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	332 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	332 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	3 ms	204 KB	Output is correct
13	Correct	2 ms	204 KB	Output is correct
14	Correct	2 ms	308 KB	Output is correct
15	Correct	2 ms	204 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Runtime error	1 ms	332 KB	Execution killed with signal 11
20	Halted	0 ms	0 KB	-