# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37978 | wasyl | ZigZag (COCI17_zigzag) | C++11 | 196 ms | 7396 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 <vector>
#include <iostream>
#include <algorithm>
#define d(...) __VA_ARGS__
#define all(x) (x).begin(), (x).end()
#define eb(...) emplace_back(__VA_ARGS__)
using namespace std;using ll=long long;
template<class t>using V = vector< t >;
int n, k;
V< string > tab [26];
int main()
{
ios::sync_with_stdio(false);
cin >> k >> n;
for ( int i = 0; i < k; ++i )
{
string z; cin >> z;
tab[z[0] - 'a'].eb( move( z ) );
}
V< int > pt( 26 );
for ( int i = 0; i < 26; ++i )
sort( all( tab[i] ) );
for ( int i = 0; i < n; ++i )
{
char c; cin >> c;
c -= 'a';
if ( pt[c] == tab[c].size() )
pt[c] = 0;
cout << tab[c][pt[c]] << '\n';
++pt[c];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |