# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1025803 |
2024-07-17T10:16:27 Z |
vjudge1 |
ZigZag (COCI17_zigzag) |
C++17 |
|
225 ms |
11036 KB |
#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 |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
223 ms |
11036 KB |
Output is correct |
8 |
Correct |
223 ms |
10836 KB |
Output is correct |
9 |
Correct |
225 ms |
10832 KB |
Output is correct |
10 |
Correct |
220 ms |
10760 KB |
Output is correct |