Submission #1651836

---

Source Code Expand

#include <cmath>
#include <iostream>
#include <string>
#include <vector>

int main(void) {
  int K, N;
  std::vector<int> v, len;
  std::vector<std::string> w, s = {};
  std::string str;
  std::cin >> K >> N;
  v.resize(N);
  w.resize(N);
  s.resize(K);
  len.resize(K);
  for (int i = 0; i < N; ++i) {
    std::cin >> v[i] >> w[i];
  }
  for (int i = 0; i < K; ++i) {
    len[i] = 1;
  }

  for (int k = 0; k < std::pow(3, K); ++k) {
    ++len[0];
    for (int l = 0; len[l] >= 4; ++l) {
      len[l] = 1;
      ++len[l+1];
    }

    for (int n = 0; n < N; ++n) {
      int num_len = 0;
      for (int i = 0; i < (int)(std::log10(v[n]) + 1); ++i) {
        num_len += len[v[n] % (int)std::pow(10, i+1) / (int)std::pow(10, i) - 1];
      }
      if (num_len != w[n].size()) {
        n = N;
      } else if (n >= N - 1) {

        for (int k0 = 0; k0 < K; ++k0) s[k0] = "";
        for (int n0 = 0; n0 < N; ++n0) {
          int sum = 0;
          for (int i0 = (int)std::log10(v[n0]); i0 >= 0; --i0) {
            // for (int k0 = 0; k0 < K; ++k0) std::cout << s[k0] << (k0 < K - 1 ? "," : "\n");
            int num = v[n0] % (int)std::pow(10, i0+1) / (int)std::pow(10, i0);
            // printf("num:%d, s:%s, w:%s\n", num, s[num-1].c_str(), w[n0].substr(sum, len[num-1]).c_str());
            if (s[num-1] == "") {
              s[num-1] = w[n0].substr(sum, len[num-1]);
            } else if(s[num-1] != w[n0].substr(sum, len[num-1])) {
              n0 = N;
              break;
            }
            sum += len[num-1];
          }

          if (n0 == N - 1) {
            // std::cout << "===== finish =====" << std::endl;
            for (int i = 0; i < K; ++i) {
              // std::cout << i+1 << ": " << s[i] << std::endl;
              std::cout << s[i] << std::endl;
            }
            return 0;
          }
        }

      }
    }
  }

  return 0;
}

Submission Info

Judge Result