#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define ONLINE_JUDGE
void solve() {
int n, q;
cin >> n >> q;
vector<string> v(n +1);
deque <int> dq[26];
for(int i = 1; i <= n; i++) {
cin >> v[i];
dq[v[i][0] - 'a'].emplace_back(i);
}
for(int i = 0; i < 26; i++) {
sort(dq[i].begin(), dq[i].end(), [&](const int a, const int b) -> bool {
string &x = v[a], &y = v[b];
for(int i = 0; i < min(x.size(), y.size()); i++) {
if(x[i] != y[i]) {
return x[i] < y[i];
}
}
return x.size() < y.size();
});
}
while(q--) {
char ch;
cin >> ch;
ch -= 'a';
cout << v[dq[ch].front()] << "\n";
dq[ch].push_back(dq[ch].front());
dq[ch].pop_front();
}
return;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1; //cin >> t;
for(int i = 1; i <= t; i++) {
solve();
}
return 0;
}
Compilation message
zigzag.cpp: In lambda function:
zigzag.cpp:22:30: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
22 | for(int i = 0; i < min(x.size(), y.size()); i++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
zigzag.cpp: In function 'void solve()':
zigzag.cpp:38:22: warning: array subscript has type 'char' [-Wchar-subscripts]
38 | cout << v[dq[ch].front()] << "\n";
| ^~
zigzag.cpp:39:12: warning: array subscript has type 'char' [-Wchar-subscripts]
39 | dq[ch].push_back(dq[ch].front());
| ^~
zigzag.cpp:39:29: warning: array subscript has type 'char' [-Wchar-subscripts]
39 | dq[ch].push_back(dq[ch].front());
| ^~
zigzag.cpp:40:12: warning: array subscript has type 'char' [-Wchar-subscripts]
40 | dq[ch].pop_front();
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
40 ms |
8768 KB |
Output is correct |
8 |
Correct |
42 ms |
8784 KB |
Output is correct |
9 |
Correct |
36 ms |
8684 KB |
Output is correct |
10 |
Correct |
37 ms |
8784 KB |
Output is correct |