Submission #1446760

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()

typedef int64_t ll; typedef vector<int> VI; typedef pair<int,int> pii;
const ll mod = 1e9+7;



int main()
{
	
	//cin.tie(0); ios_base::sync_with_stdio(false);
	int n,k;
	cin >> n >>k;
	VI a(n);
	rep(i,n) cin >>a[i];
	sort(all(a));
	
	if(k>a.back()+1){puts("IMPOSSIBLE");return 0;}
	int sa = a.back() - k;
	//vector<bool> ck(k+5);
	bool ok =0;
	rep(gc,n){
		VI pls;
		rep(i,n){
			if(i>0 && a[i]-a[i-1]<=k){
				if(a[i]-a[i-1] ==1 || a[i]-a[i-1] ==k || a[i]-a[i-1] == sa){
					ok=1;
					puts("POSSIBLE");return 0;
				}
				if(sz(pls)>3000000) break;
				pls.push_back(a[i]-a[i-1]);
				}
			
			}
		
		rep(i,sz(pls)){
			a.push_back(pls[i]);
			if(sz(a)>3000000) break;
		}
		sort(all(a));
		a.erase(unique(all(a)), a.end());
		int n=sz(a);
	}

	//for(auto x :ck) printf("%c, ",(x? '1':'0')); puts("");
	puts("IMPOSSIBLE");
	return 0;
}

Submission Info

Judge Result