| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 105496 | leonarda | ZigZag (COCI17_zigzag) | C++14 | 259 ms | 12284 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;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5;
int n, k;
vector< string > v;
queue< string > q[26];
int main ()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> k >> n;
	v.reserve(k);
	for(int i = 0; i < k; ++i) {
		string s;
		cin >> s;
		v.pb(s);
	}
	
	sort(v.begin(), v.end());
	
	for(int i = 0; i < v.size(); ++i) {
		q[v[i][0] - 'a'].push(v[i]);
	}
	
	for(int i = 0; i < n; ++i) {
		char c;
		cin >> c;
		string out = q[c - 'a'].front();
		q[c - 'a'].pop();
		q[c - 'a'].push(out);
		cout << out << endl;
	}
return 0;
}
// :)
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
