oj.uz

Submission #852215

# Submission time Handle Problem Language Result Execution time Memory
852215 2023-09-21T12:36:32 Z NaimSS Weird Numeral System (CCO21_day1problem2) C++14
25 / 25
 796 ms 5164 KB 
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define all(v) begin(v),end(v)
#define endl '\n'
#define sz(v) ((int)v.size())
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<int> vi;


void dbg_out(){ cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "): ", dbg_out(__VA_ARGS__), cerr << endl;
#else
#define dbg(...) 42
#endif

mt19937 rng(422);
int k,d;

unordered_map<ll,int> dp, go;
set<int> A;
int a[2505];

int solve(ll num){
    if(dp.count(num))return dp[num];
    dp[num] = 0;
    rep(i,0,d){
        ll nv = num - a[i];
        if(nv%k)continue;
        if(solve(nv/k)){
            dp[num] = 1;
            go[num] = a[i];
            return 1;
        }
    }
    return dp[num] = 0;
}


int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int q,m;
    cin >> k >> q >> d >> m;

    rep(i,0,d)cin >> a[i],dp[a[i]] = 1, go[a[i]] = a[i];
    while(q--){
        ll N;
        cin >> N;
        if(solve(N)){
            vi vals;
            while(N != 0 || sz(vals)==0){
                int put = go[N];
                N = (N-put)/k;
                vals.pb(put);
            }
            reverse(all(vals));
            rep(i,0,sz(vals))cout<<vals[i]<<" \n"[i == sz(vals)-1];
        }else{
            cout << "IMPOSSIBLE\n";
        }
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB OK
2 Correct 0 ms 348 KB OK
3 Correct 0 ms 348 KB OK
4 Correct 0 ms 348 KB OK
5 Correct 1 ms 344 KB OK
6 Correct 1 ms 344 KB OK
7 Correct 0 ms 348 KB OK
8 Correct 1 ms 344 KB OK

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB OK
2 Correct 0 ms 348 KB OK
3 Correct 0 ms 348 KB OK
4 Correct 0 ms 348 KB OK
5 Correct 1 ms 344 KB OK
6 Correct 1 ms 344 KB OK
7 Correct 0 ms 348 KB OK
8 Correct 1 ms 344 KB OK
9 Correct 1 ms 344 KB OK
10 Correct 0 ms 344 KB OK
11 Correct 1 ms 344 KB OK
12 Correct 1 ms 348 KB OK
13 Correct 1 ms 344 KB OK
14 Correct 1 ms 344 KB OK
15 Correct 1 ms 344 KB OK
16 Correct 0 ms 600 KB OK
17 Correct 1 ms 344 KB OK
18 Correct 1 ms 344 KB OK
19 Correct 1 ms 344 KB OK
20 Correct 1 ms 348 KB OK
21 Correct 23 ms 1176 KB OK
22 Correct 165 ms 1524 KB OK
23 Correct 796 ms 5164 KB OK
24 Correct 324 ms 2224 KB OK
25 Correct 1 ms 344 KB OK
26 Correct 1 ms 348 KB OK
27 Correct 0 ms 348 KB OK
28 Correct 0 ms 348 KB OK