提出 #1972230

---

ソースコード 拡げる

/*
	Swamy Saranam

	Date	: 14/01/2018 12:41:19
	Author	: Krishna Mohan A M
	Problem	:
	Status	:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int>	pii;
typedef pair<ld,ld>	pdd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef pair<ll,ll> pll;

#define FASTIO                ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b)            for(int i=(a);i<(b);i++)
#define REP(i,n)              FOR(i,0,n)
#define SORT(v)               sort((v).begin(),(v).end())
#define UN(v)                 SORT(v),(v).erase(unique((v).begin(),(v).end()),(v).end())
#define CL(a,b)               memset(a,b,sizeof a)
#define PB                    push_back
#define F                     first
#define S                     second

const int MOD = 1000000007;

ll n, k, tmp, mx;
set<ll> st;
bool pos;

int main()
{
      FASTIO
      cin>>n>>k;
      st.insert(0);
      REP(i, n){
            cin>>tmp;
            mx = max(tmp, mx);
            st.insert(tmp);
      }
      pos = false;
      // cout<<mx<<" : "<<k<<"\n";
      if(k <= mx){
            for(ll it : st){
                  if(it>=k)
                        break;
                  if(st.count(k-it)){
                        pos = true;
                        break;
                  }
            }
      }
      if(pos)
            cout<<"POSSIBLE\n";
      else
            cout<<"IMPOSSIBLE\n";
      return 0;
}

提出情報

ジャッジ結果