Submission #1256504

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
	string search;
	long long int n,k,i;
	cin >> n >> k;
	
	vector<long long int> a(k);
	vector<string> base(n);
	
	for(i=0;i<k;i++){	cin >> a[i];a[i]--;}
	for(i=0;i<n;i++)	cin >> base[i];
	
	if(n == k){cout << "" << endl; return 0;}
	
	search = base[a[0]];
	for(i=0;i<k;i++){
		if(search.length() > base[a[i]].length()){
			if(search.find(base[a[i]]) != SIZE_MAX)
				search = base[a[i]];
			else{
				cout << "-1" <<endl;
				return 0;
			}
		}else if(base[a[i]].find(search) == SIZE_MAX){
			cout << "-1" <<endl;
			return 0;
		}
	}
	for(i=0,k=0;i<n;i++){
		if(i == a[k])
			k++;
		else if(base[i].find(search) != SIZE_MAX){
			cout << "-1" << endl;
			return 0;
		}
	}
	cout << search << endl;
}

Submission Info

Judge Result