Submission #381329

#TimeUsernameProblemLanguageResultExecution timeMemory
381329AdiZer0ZigZag (COCI17_zigzag)C++17
80 / 80
474 ms20224 KiB
#include <bits/stdc++.h> #define pb push_back #define whole(x) x.begin(), x.end() #define sz(x) (int)x.size() using namespace std; typedef long long ll; typedef long double ld; const int N = (int)2e5 + 7; const int INF = (int)1e9 + 7; const ll linf = (ll)1e18 + 1; set<pair<int, string>> st[N]; int main() { int k, n; cin >> k >> n; for (int i = 1; i <= k; ++i) { string s; cin >> s; int x = (s[0] - 'a'); st[x].insert({0, s}); } for (int i = 1; i <= n; ++i) { char ch; cin >> ch; int x = (ch - 'a'); pair<int, string> cur = *st[x].begin(); st[x].erase(cur); cout << cur.second << "\n"; cur.first++; st[x].insert(cur); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...