제출 #1103679

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103679		BuzzyBeez	Weird Numeral System (CCO21_day1problem2)	C++14	0 / 25	1 ms	336 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long

const long long inf = LLONG_MAX;

unordered_map<long long, long long> par;
int a[5008];

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;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int q, m; cin >> K >> q >> d >> m;
	for (int i = 1; i <= d; ++i) cin >> a[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 = par[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';
		}
	}
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 17