| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1025803 | vjudge1 | ZigZag (COCI17_zigzag) | C++17 | 225 ms | 11036 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;
void solve(){
    int n, m;
    cin >> n >> m;
    set<pair<int, string>> st[26];
    for (int i = 0; i < n; i ++){
        string s;
        cin >> s;
        st[s[0] - 'a'].insert({0, s});
    }
    for (int i = 0; i < m; i ++){
        char c;
        cin >> c;
        auto P = *st[c - 'a'].begin();
        st[c - 'a'].erase(P);
        st[c - 'a'].insert({P.first + 1, P.second});
        cout << P.second << endl;
    }
}
int main(){
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
