提出 #5691320

---

ソースコード 拡げる

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



int N, K;
vector<int> A;
set<int> sA;
vector<string> S;

string solve() {
    string res = "";
    for (int i = 0; i < 100000; ++i) {
        set<char> se;
        bool ok = true;
        for (auto a : A) {
            if (i >= S[a].size()) {
                ok = false;
                break;
            }
            se.insert(S[a][i]);
        }
        if (!ok || se.size() > 1) break;
        res += *se.begin();
    }

    int ma = 0;
    for (int i = 0; i < N; ++i) {
        if (sA.count(i)) continue;
        if (S[i].size() >= res.size() && S[i].substr(0, (int)res.size()) == res) return "-1";
        int pl = min((int)res.size() - 1, (int)S[i].size());
        for (int j = min((int)res.size(), (int)S[i].size()) - 1; j >= 0; --j) {
            if (res[j] != S[i][j]) pl = j;
        }
        ma = max(ma, pl+1);
    }
    //COUT(ma);
    
    return res.substr(0, ma);
}

int main() {
    while (cin >> N >> K) {
        A.resize(K);
        sA.clear();
        for (int i = 0; i < K; ++i) cin >> A[i], --A[i], sA.insert(A[i]);
        S.resize(N);
        for (int i = 0; i < N; ++i) cin >> S[i];
        cout << solve() << endl;
    }
}

提出情報

ジャッジ結果