Submission #25939806

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long 
#define ft first
#define sec second
#define pb push_back
#define pf push_front
#define pr pair<ll,ll>
#define bged(a) a.begin(),a.end()
#define ISCC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#pragma optimize("Ofast","unroll-loop")
using namespace std;
const int MOD = 1e9+7; 
int t ,n ,m ,k ,pos[30];
string a[500005] ,s ,ans;
bool cmp(string x ,string y)
{
	int lx=x.size() ,ly=y.size();	
	for(int i=0 ;i<min(lx ,ly) ;i++)
	{
		if(pos[x[i]-'a'] < pos[y[i]-'a']) return true;
		else if(pos[x[i]-'a'] > pos[y[i]-'a']) return false;
	} 
	if(lx != ly) return lx<ly;
	return false;
}
int main()
{ 	
	
	cin >> s;
	cin >> n;
	for(int i=0 ;i<n ;i++) cin >> a[i];
	for(int i=0 ;i<26 ;i++) pos[s[i]-'a'] = i;
	sort(a ,a+n ,cmp);
	for(int i=0 ;i<n ;i++) cout << a[i] << '\n';
	return 0;
}

Submission Info

Judge Result