# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102480 | Thanhs | Weird Numeral System (CCO21_day1problem2) | C++17 | 1599 ms | 1872 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
#define endl '\n'
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const int NM = 5e3 + 5;
vector<int> v;
int k, q, d, m, a[NM];
bool ok;
map<int, bool> mp;
int F(int x)
{
return ((x % k) + k) % k;
}
void dfs(int x)
{
if (mp[x])
return;
if (v.size())
mp[x] = 1;
if (v.size() && !x)
{
ok = 1;
for (int i = v.size() - 1; i >= 0; i--)
cout << v[i] << " \n"[i == 0];
return;
}
for (int i = 1; i <= d; i++)
if (F(x) == F(a[i]))
{
v.push_back(a[i]);
dfs((x - a[i]) / k);
if (ok)
return;
v.pop_back();
}
}
void solve()
{
cin >> k >> q >> d >> m;
for (int i = 1; i <= d; i++)
cin >> a[i];
while (q--)
{
int x;
cin >> x;
v.clear();
mp.clear();
ok = 0;
dfs(x);
if (!ok)
cout << "IMPOSSIBLE\n";
}
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
if (fopen("in.txt", "r"))
{
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
int tc = 1;
// cin >> tc;
while (tc--)
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |