#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define SIZE(x) (int)(x).size()
#define ff first
#define ss second
inline ll readi(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int K, N;
vector<string> v[26];
int cur[26];
int main(){
K=readi(),N=readi();
for(int i=0;i<K;i++){
string s;
cin>>s;
v[s[0]-'a'].push_back(s);
}
for(int i=0;i<26;i++){
sort(v[i].begin(),v[i].end());
}
for(int i=0;i<N;i++){
char c;
cin>>c;
int id=c-'a';
cout<<v[id][cur[id]]<<endl;
cur[id]=(cur[id]+1)%SIZE(v[id]);
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2020 KB |
Output is correct |
2 |
Correct |
0 ms |
2020 KB |
Output is correct |
3 |
Correct |
0 ms |
2020 KB |
Output is correct |
4 |
Correct |
6 ms |
2020 KB |
Output is correct |
5 |
Correct |
0 ms |
2020 KB |
Output is correct |
6 |
Correct |
0 ms |
2020 KB |
Output is correct |
7 |
Runtime error |
239 ms |
6592 KB |
Execution timed out (wall clock limit exceeded) |
8 |
Runtime error |
329 ms |
6620 KB |
Execution timed out (wall clock limit exceeded) |
9 |
Runtime error |
259 ms |
6648 KB |
Execution timed out (wall clock limit exceeded) |
10 |
Runtime error |
229 ms |
6592 KB |
Execution timed out (wall clock limit exceeded) |