제출 #1102359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102359		CDuong	Weird Numeral System (CCO21_day1problem2)	C++17	25 / 25	1162 ms	23784 KiB

Main

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define int long long
#define isz(x) (int)x.size()
using namespace std;

void solve() {
    int k, q, d, m;
    cin >> k >> q >> d >> m;

    auto gmod = [&](int val) -> int {
        int res = val % k;
        return (res < 0 ? res + k : res);
    };

    vector<int> a(d);
    vector<vector<int>> md(k);
    for (auto &val : a) {
        cin >> val;
        md[gmod(val)].emplace_back(val);
    }

    vector<int> vec;
    map<int, int> mp;   
    auto dfs = [&](auto self, int val) -> bool {
        if (mp.count(val)) return false;
        mp[val] = false;
        for (auto coef : md[gmod(val)]) {
            if (coef == val) {
                vec.emplace_back(coef);
                return true;
            }
            if ((val - coef) / k != val and self(self, (val - coef) / k)) {
                vec.emplace_back(coef);
                return true;
            }
        }
        return false;
    };

    while (q--) {
        int n;
        cin >> n;
        mp.clear();
        vec.clear();
        if (!dfs(dfs, n)) {
            cout << "IMPOSSIBLE" << "\n";
        }
        else {
            for (int i = 0; i < isz(vec); ++i) {
                cout << vec[i] << " \n"[i + 1 == isz(vec)];
            }
        }
    }
}

signed main() {

#ifndef CDuongg
    if (fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

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