# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
473204 |
2021-09-15T10:11:35 Z |
AbdoMo |
ZigZag (COCI17_zigzag) |
C++17 |
|
249 ms |
7804 KB |
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
if(a.size()==b.size())
{
return a<b;
}
return a.size()<b.size();
}
void solve(){
int n,k;
cin>>n>>k;
vector<string>v[26];
for(int i=0;i<n;i++)
{
string s;
cin>>s;
v[s[0]-'a'].pb(s);
}
for(int i=0;i<26;i++)
{
sort(v[i].begin(),v[i].end());
}
int ind[26]={};
while(k--)
{
char c;
cin>>c;
cout<<v[c-'a'][ind[c-'a']]<<endl;
ind[c-'a']++;
ind[c-'a']%=v[c-'a'].size();
}
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// cin>>t;
while(t--){solve();}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
316 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
203 ms |
7804 KB |
Output is correct |
8 |
Correct |
249 ms |
7780 KB |
Output is correct |
9 |
Correct |
238 ms |
7764 KB |
Output is correct |
10 |
Correct |
225 ms |
7800 KB |
Output is correct |