oj.uz

답안 #1103690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1103690 2024-10-21T14:28:29 Z BuzzyBeez Weird Numeral System (CCO21_day1problem2) C++17
0 / 25
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const long long inf = LLONG_MAX;

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 x : arr) if (abs(R - x) % K == 0) 
		// if (R == x || attempt((R - x) / K)) {par[R] = x; 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);
	for (int i = 0; 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<long long> fin; long long cur = N;
            while(1){
                fin.push_back(memo[cur]);
                cur=(cur-memo[cur])/K;
                if(cur==0)break;
            }
            reverse(fin.begin(),fin.end());
			for (auto i : fin) cout << i << ' ';
			cout << '\n';
			// vector<long long> 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';
		}
	}
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 17.0

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