# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38675 | adamczh1 | ZigZag (COCI17_zigzag) | C++14 | 329 ms | 6648 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |