Submission #8446559

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
using ll     = long long;
using pii    = pair<int, int>;
using pll    = pair<ll, ll>;
using vi     = vector<int>;
using vl     = vector<ll>;
using vvi    = vector<vi>;
using vvl    = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
    return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
    std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
    os << std::endl;
}

int main() {
    int k, n;
    cin >> k >> n;
    vector<string> v(n), w(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i] >> w[i];
    }
    int comb = 1;
    for (int i = 0; i < k; ++i) {
        comb *= 3;
    }
    for (int i = 0; i < comb; ++i) {
        vi num(k, 1);
        int threes = i;
        for (int j = 0; j < k; ++j) {
            num[j] += threes % 3;
            threes /= 3;
        }
        vector<string> ret(k, "-");
        bool ok = true;
        for (int j = 0; j < n; ++j) {
            int tot = 0;
            for (int k = 0; k < v[j].size(); ++k) {
                tot += num[v[j][k] - '1'];
            }
            if (tot != w[j].size()) {
                ok = false;
                break;
            }
            int idx = 0;
            for (int k = 0; k < v[j].size(); ++k) {
                if (ret[v[j][k] - '1'] == "-")
                    ret[v[j][k] - '1'] = w[j].substr(idx, num[v[j][k] - '1']);
                else if (ret[v[j][k] - '1'] != w[j].substr(idx, num[v[j][k] - '1'])) {
                    ok = false;
                    break;
                }
                idx += num[v[j][k] - '1'];
            }
        }
        if (!ok)
            continue;
        else {
            for (auto &r : ret) {
                cout << r << "\n";
            }
            return 0;
        }
    }

    return 0;
}

Submission Info

Judge Result