Submission #1841600

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main(void) {
  int n, K;
  cin >> n >> K;

  vector<int> a(K);
  for (int i = 0; i < K; i++) {
    cin >> a[i];
    a[i]--;
  }
  sort(a.begin(), a.end());

  vector<string> s(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }

  string t = "";
  for (int i = 0; i < K; i++) {
    if (t != "" && t.size() < s[a[i]].size()) continue;
    t = s[a[i]];
  }

  int tz = t.size();
  vector<int> same(n, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < tz; j++) {
      if (s[i][j] == t[j]) same[i]++;
      else break;
    }
  }

  int h = tz + 1, l = -1;
  for (int i = 0; i < n; i++) {
    if (*lower_bound(a.begin(), a.end(), i) == i) {
      h = min(h, same[i]);
    } else {
      l = max(l, same[i]);
    }
  }
  cout << (l < h ? t.substr(0, l + 1) : "-1") << endl;


  return 0;
}

Submission Info

Judge Result