Submission #1446761

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[])
{
	LL N,K;
	cin>>N>>K;
	vector<LL> A(N);
	LL i;
	bool allLetter=true;
	for (i=0;i<N;i++){
		cin>>A[i];
		if (A[i]==K){
			cout<<"POSSIBLE"<<endl;
			return 0;
		}else if (A[i]>K){
			allLetter=false;
		}
	}
	if (allLetter){
		cout<<"IMPOSSIBLE"<<endl;
		return 0;
	}

	sort(A.begin(),A.end());
	LL x;
	for (i=0;i<N-1;i++){
		x=A[i]-A[i+1];
		if (x<0){
			x=-x;
		}
		if (x==1 || x==K){
			cout<<"POSSIBLE"<<endl;
			return 0;
		}
	}

	while (true){
		x=A[0]-A[1];
		if (x<0){
			x=-x;
		}
		if (x==1 || x==K){
			cout<<"POSSIBLE"<<endl;
			return 0;
		}
		if (x==0){
			cout<<"IMPOSSIBLE"<<endl;
			return 0;
		}
		if (A[1]>A[0]){
			A[1]=x;
		}else{
			A[0]=x;
		}
	}
	return 0;
}

Submission Info

Judge Result