Submission #1446408
Source Code Expand
#include <iostream>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
// #include <unordered_map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;
#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define INTSPACE 11
char _buf[INTSPACE*1000000 + 3]; // ここ要確認
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
//
bool solve(int N, int K, vector<int>& a) {
sort(ALL(a));
if (a.back() < K) return false;
set<int> s(ALL(a));
if (found(s, K)) return true;
if (found(s, 1)) return true;
auto it = s.lower_bound(K);
set<int> al;
al.insert(K);
while (it != s.end()) {
if (*it > K) {
int e = *it - K;
if (found(s, e)) return true;
al.insert(e);
}
++it;
}
while (true) {
set<int> b;
for (auto it=s.begin(); it!=s.end(); ) {
auto jt = it; ++jt;
if (jt == s.end()) break;
int d = *jt - *it;
if (!found(s, d)) {
if (found(al, d)) return true;
for (auto ali : al) {
if (d < ali) break;
al.insert(d - ali);
}
b.insert(d);
}
it = jt;
}
if (b.empty()) break;
for (int d : b) s.insert(d);
}
return false;
}
int main() {
vector<int> a;
loadvec(a, 2);
int N=a[0], K=a[1];
loadvec(a, N);
cout << (solve(N, K, a) ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Getting Difference |
User |
naoya_t |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
3456 Byte |
Status |
AC |
Exec Time |
104 ms |
Memory |
6400 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
sample_04.txt |
AC |
1 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
256 KB |
subtask_1_02.txt |
AC |
1 ms |
256 KB |
subtask_1_03.txt |
AC |
20 ms |
6400 KB |
subtask_1_04.txt |
AC |
7 ms |
1536 KB |
subtask_1_05.txt |
AC |
4 ms |
1024 KB |
subtask_1_06.txt |
AC |
4 ms |
1152 KB |
subtask_1_07.txt |
AC |
104 ms |
4992 KB |
subtask_1_08.txt |
AC |
11 ms |
1408 KB |
subtask_1_09.txt |
AC |
9 ms |
2432 KB |
subtask_1_10.txt |
AC |
28 ms |
4608 KB |
subtask_1_11.txt |
AC |
10 ms |
1280 KB |