#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
ll k,q,d,m,n;
ll qs[69];
ll arr[5069];
vector<ll> ans;
unordered_map<ll,ll> track;
stack<ll> sk;
bool find(ll x) {
if (-m<=x&&x<=m) {
if (track.find(x)==track.end()) {
return 0;
}
if (x!=track[x]) {
ll cur=(x-track[x])/k;
find(cur);
}
ans.push_back(track[x]);
return 1;
}
for (int i = 0; i < d; i++) {
if ((x-arr[i])%k==0) {
if (find((x-arr[i])/k)) {
ans.push_back(arr[i]);
return true;
}
}
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>k>>q>>d>>m;
for (int i = 0; i < d; i++) {
cin>>arr[i];
track[arr[i]]=arr[i];
sk.push(arr[i]);
}
while (sk.size()) {
ll tmp=sk.top();
sk.pop();
for (int i = 0; i < d; i++) {
ll cur=tmp*k+arr[i];
if (cur<-m||cur>m) {
continue;
}
if (track.find(cur)==track.end()) {
track[cur]=arr[i];
sk.push(cur);
}
}
}
for (int t = 0; t < q; t++) {
ans.clear();
cin>>n;
if (find(n)) {
for (auto i : ans) {
cout<<i<<' ';
}
cout<<endl;
}
else {
if (t==1) {
cout<<"IMPOSSIBLE"<<q<<endl;
}
cout<<"IMPOSSIBLE"<<endl;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Expected integer, but "IMPOSSIBLE" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Expected integer, but "IMPOSSIBLE" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
