답안 #413320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
413320 2021-05-28T13:36:56 Z sebinkim Weird Numeral System (CCO21_day1problem2) C++14
0 / 25
14 ms 24032 KB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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]) {
			assert((t - a) % k == 0);
			u = (t - a) / k;
			if (M.find(u) == M.end()) {
				M[u] = t; Q.push(u);
			}
		}
	}
	cout << "IMPOSSIBLE\n";
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	ll i, t, n;

	cin >> k >> q >> d >> m;

	for (i = 0; i < d; i++) {
		cin >> t; A[(t % k + k) % k].push_back(t);
	}

	for (; q--; ) {
		cin >> n;
		tc(n);
	}

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 24032 KB Expected integer, but "IMPOSSIBLE" found
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 24032 KB Expected integer, but "IMPOSSIBLE" found
2 Halted 0 ms 0 KB -