413A - Data Recovery - CodeForces Solution


implementation *1200

Please click on ads to support us..

Python Code:

I=lambda:list(map(int,input().split()))
n,m,N,X=I()
t=I()
r=min(t)!=N
r+=max(t)!=X
print(['C','Inc'][m+r>n or min(t)<N or max(t)>X]+'orrect')

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,m,minimum,maximum;
	cin>>n>>m>>minimum>>maximum;
	int arr[m];
	for(int i=0;i<m;i++)
	{
		cin>>arr[i];

	}
	sort(arr,arr+m);
	int diff=n-m;
	int mi=arr[0];
	int ma=arr[m-1];


	if(minimum>mi||maximum<ma)
		cout<<"Incorrect";
	else
	{
	if(diff>=2)
		cout<<"Correct";
	else
	{
		
		if(diff==1)
		{
			if(mi==minimum||ma==maximum)
				cout<<"Correct";
			else
				cout<<"Incorrect";

		}
		else if(diff==0)
		{
			if(mi==minimum&&ma==maximum)
				cout<<"Correct";
			else
				cout<<"Incorrect";
		}

	}
}
}


Comments

Submit
0 Comments
More Questions

1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals