#include <bits/stdc++.h>
using namespace std;
#define int long long
const long long inf = LLONG_MAX;
unordered_map<long long, long long> memo;
vector<int> arr;
int d; long long K;
// bool attempt(long long R) {
// if (par.count(R)) return (par[R] != inf);
// par[R] = inf;
// for (int i = 1; i <= d; ++i) if (abs(R - a[i]) % K == 0)
// if (R == a[i] || attempt((R - a[i]) / K)) {par[R] = a[i]; return 1;}
// return 0;
// }
bool attempt(long long a){
if(memo.count(a))return memo[a]!=LLONG_MAX;
memo[a]=LLONG_MAX;
for(auto x:arr){
if((a-x)%K==0){
if(a-x==0||attempt((a-x)/K)){
memo[a]=x;
return true;
}
}
}
return false;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int q, m; cin >> K >> q >> d >> m;
arr.resize(d + 1);
for (int i = 1; i <= d; ++i) cin >> arr[i];
long long N; bool pass;
while (q--) {
cin >> N; pass = attempt(N);
if (!pass) cout << "IMPOSSIBLE\n";
else {
vector<int> ans; long long x;
while (1) {
x = memo[N]; ans.push_back(x);
N = (N - x) / K;
if (N == 0) break;
}
reverse(ans.begin(), ans.end());
for (int i : ans) cout << i << ' ';
cout << '\n';
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
336 KB |
For n=773746700847275732, representation uses an invalid digit |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
336 KB |
For n=773746700847275732, representation uses an invalid digit |
| 2 |
Halted |
0 ms |
0 KB |
- |
