#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
int main(){
cin.tie(0)->sync_with_stdio(0);
int k,t,d,m; cin >> k >> t >> d >> m;
vector<int> a(d); for(int& v : a) cin >> v;
gp_hash_table<ll,pair<ll,int>> par({},{},{},{},{1<<22});
while(t--){
ll x; cin >> x;
par.clear(); par[x] = {-2e18,-1};
queue<ll> q; q.push(x);
bool good = 0; int cnt = 0;
while(q.size() && !good && cnt < 1.5e5){
ll u = q.front(); q.pop();
//cout << u << "\n";
for(int w : a){
if((u-w)%k != 0) continue;
ll v = (u-w)/k;
//cout << u << "->" << v << "\n";
if(v == 0){
cout << w << " ";
while(1){
if(par[u].first == -2e18) break;
cout << par[u].second << " ";
u = par[u].first;
}
cout << "\n";
good = 1;
break;
}
if(par.find(v) == par.end()){
q.push(v); par[v] = {u,w};
//cout << v << " " << w << "\n";
}
}
}
if(!good) cout << "IMPOSSIBLE\n";
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
129 ms |
131560 KB |
Expected integer, but "IMPOSSIBLE" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
129 ms |
131560 KB |
Expected integer, but "IMPOSSIBLE" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
