Submission #1439654

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define pb(x) push_back(x)
#define eb(x,y) emplace_back(x,y)
#define MOD 1000000007
#define MAX 1000000001
#define INF 1410065408
#define EPS 1e-9
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
struct edge{int from, to; ll cost;};

signed main(){
    int n, k;
    cin >> n >> k;
    if(n == k) return 0;
    vector<int> a(k);
    rep(k){
        cin >> a[i];
        a[i]--;
    }

    string s, longestKeyword;
    vector<string> rest;
    int ai = 0;
    rep(n){
        cin >> s;
        if(ai < k && i == a[ai]){
            if(ai == 0){
                longestKeyword = s;
            }else{
                int newLength = 0;
                while(newLength < min((int)s.length(), (int)longestKeyword.length())){
                    if(s[newLength] == longestKeyword[newLength]) newLength++;
                    else break;
                }
                if(newLength < (int)longestKeyword.length()) longestKeyword = longestKeyword = longestKeyword.substr(0, newLength);
            }
            ai++;
        }else{
            rest.pb(s);
        }
    }
    if(longestKeyword.empty()){
        cout << "-1";
        return 0;
    }

    int minLength = 0;
    for(string r : rest){
        int newMinLength = 0;
        while(newMinLength < min((int)r.length(), (int)longestKeyword.length())){
            if(r[newMinLength] == longestKeyword[newMinLength]) newMinLength++;
            else break;
        }
        if(newMinLength + 1 > minLength) minLength = newMinLength + 1;
    }
    if(minLength > (int)longestKeyword.length()){
        cout << "-1";
    }else{
        cout << longestKeyword.substr(0, minLength);
    }
}

Submission Info

Judge Result