CodeForces 413A

最新推荐文章于 2021-08-03 18:05:50 发布

打铁大队长

最新推荐文章于 2021-08-03 18:05:50 发布

阅读量195

点赞数

本文链接：https://blog.csdn.net/ccutsoft20154954/article/details/50515746

版权

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Description

Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.

The testing goes in n steps, at each step the processor gets some instructions, and then its temperature is measured. The head engineer in R2 is keeping a report record on the work of the processor: he writes down the minimum and the maximum measured temperature in his notebook. His assistant had to write down all temperatures into his notebook, but (for unknown reasons) he recorded only m.

The next day, the engineer's assistant filed in a report with all the m temperatures. However, the chief engineer doubts that the assistant wrote down everything correctly (naturally, the chief engineer doesn't doubt his notes). So he asked you to help him. Given numbers n, m, min, max and the list of m temperatures determine whether you can upgrade the set of m temperatures to the set of n temperatures (that is add n - m temperatures), so that the minimum temperature was min and the maximum one was max.

Input

The first line contains four integers n, m, min, max(1 ≤ m < n ≤ 100; 1 ≤ min < max ≤ 100). The second line contains m space-separated integers t_i(1 ≤ t_i ≤ 100) — the temperatures reported by the assistant.

Note, that the reported temperatures, and the temperatures you want to add can contain equal temperatures.

Output

If the data is consistent, print 'Correct' (without the quotes). Otherwise, print 'Incorrect' (without the quotes).

Sample Input

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
    int a[111],i,n,m,mi,ma,f1,f2,k,ans;
    cin>>n>>m>>mi>>ma;
    ans=n-m;
    memset(a,0,sizeof(a));
 	for(i=0;i<m;i++)
	{
		 	scanf("%d",&k);
		 	a[i]=k;
		 	if(n<=2)
 			{
		 		if(k!=mi &&k!=ma)
		 		{
	 			cout<<"Incorrect"<<endl;
	 			goto e;
	 			}
  			}
 	} 		
    sort(a,a+m);
    f1=a[0];f2=a[m-1];
	if(ans>=2)
	{
		if(mi<=f1 &&ma>=f2)
		{
			cout<<"Correct"<<endl;
		}
		else
		{
			cout<<"Incorrect"<<endl;
		}
	}
	else if(ans==0)
	{
		if(mi==f1 &&ma==f2)
		{
			cout<<"Correct"<<endl;
		}
		else		
		{
			cout<<"Incorrect"<<endl;
		}
	}
	else 
	{
		if((mi==f1 ||ma==f2) &&mi<=f1 &&ma>=f2)
		{
			cout<<"Correct"<<endl;
		}
		else
		{
			cout<<"Incorrect"<<endl;
		}
	}
    e:;
    return 0;
}

Input