# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473118 | _L__ | ZigZag (COCI17_zigzag) | C++17 | 133 ms | 12348 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.
// This code is written by _L__
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define F_word ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const int mod = 1e9+7, N = 2e5+13, inf = 1e9+1;
const ld E = 1e-6;
#define ff first
#define ss second
int main(void){
F_word;
int k, n; cin >> k >> n;
unordered_map<char, multiset<pair<int, string>>> mp;
for(int i = 0; i < k; ++i){
string s; cin >> s;
mp[s[0]].insert({0,s});
}
for(int i = 0; i < n; ++i){
char c; cin >> c;
auto x = mp[c].begin();
pair<int, string> y = *(x); cout << y.ss << endl;
mp[c].erase(x); mp[c].insert({y.ff+1, y.ss});
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |