| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 413317 | sebinkim | Weird Numeral System (CCO21_day1problem2) | C++17 | 15 ms | 23936 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;
using ll = long long;
using pll = pair<ll, ll>;
map<ll, ll> M;
queue<ll> Q;
vector<ll> A[1010101];
ll k, q, d, m;
void tc(ll n) {
ll t, u;
for (; !Q.empty(); Q.pop());
Q.push(n); M.clear();
for (; !Q.empty(); ) {
t = Q.front(); Q.pop();
if (t == 0) {
for (; t != n; t = M[t]) {
cout << (M[t] - t * k) << " ";
}
cout << "\n";
return;
}
for (ll &a: A[(t % k + k) % k]) {
u = (t - a) / k;
if (M.find(u) == M.end()) {
M[u] = t; Q.push(u);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||