#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip>
#include <stdio.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (ll)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <ll,ll>
#define rep(i,n) for(ll i = 0 ; i < n ; i++)
#define drep(i,n) for(ll i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(ll i = x ; i < n ; i++)
#define vi vector <ll>
#define vec(s) vector<s>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
const ll max_n = 103002;
using namespace std;
ll k,n,q,m;
vi a;
map <ll,int> memo;
int slv(ll x){
if(memo.find(x)!=memo.end()) return memo[x];
memo[x]=1;
rep(i,n) {
if(x-a[i] == 0) {
return memo[x] = 1;
}
if((x-a[i])%k!=0) continue;
ll nex=(x-a[i])/k;
// cout << x << " " << nex << "\n";
if(nex==x)continue;
if(memo.find(nex)!=memo.end()) {
if(memo[nex]==1) return memo[x]=1;
}else {
slv(nex);
// if(memo[nex]==1)cout<<nex<<"\n";
if(memo[nex]==1) return memo[x]=1;
}
}
return memo[x]=0;
}
int main(){
fcin;
cin>>k>>q>>n>>m;
rep(i,n){ll x;cin>>x;a.pb(x);}
rep(_,q) {
ll val;
cin>>val;
if(slv(val)==0) cout << "IMPOSSIBLE\n";
else {
vi tmp;
while(val!=inf) {
rep(i,sz(a)) {
if(val==a[i]) {
tmp.pb(a[i]);
val=inf;break;
}
if((val-a[i])%k!=0)continue;
if(memo[((val-a[i])/k)]==1) {val-=a[i];val/=k;tmp.pb(a[i]);}
}
}
reverse(all(tmp));
rep(i,sz(tmp)){
cout<<tmp[i];
if(i-1<sz(tmp)) cout<<" ";
}
cout<<"\n";
}
}
/*
*/
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Expected integer, but "IMPOSSIBLE" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Expected integer, but "IMPOSSIBLE" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
