#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, k;
string arr[MAXN];
struct op {
bool operator () (int a, int b){
return arr[a] < arr[b];
};
};
set<int, op> num[MAXN][26];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
vector<set<int>> st(26);
cin>>k>>n;
for(int i = 0; i < k; i++){
cin>>arr[i];
num[0][arr[i][0] - 'a'].insert(i);
st[arr[i][0] - 'a'].insert(0);
}
for(int i = 0; i < n; i++){
char c;
cin>>c;
int idx = c - 'a';
int x = *st[idx].begin();
int dis = (*num[x][idx].begin());
num[x][idx].erase(num[x][idx].begin());
if(num[x][idx].empty())
st[idx].erase(st[idx].begin());
st[idx].insert(x + 1);
cout<<arr[dis]<<endl;
num[x + 1][idx].insert(dis);
}
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
44 ms |
65540 KB |
Execution killed with signal 9 |
2 |
Runtime error |
46 ms |
65540 KB |
Execution killed with signal 9 |
3 |
Runtime error |
45 ms |
65536 KB |
Execution killed with signal 9 |
4 |
Runtime error |
48 ms |
65540 KB |
Execution killed with signal 9 |
5 |
Runtime error |
45 ms |
65540 KB |
Execution killed with signal 9 |
6 |
Runtime error |
43 ms |
65536 KB |
Execution killed with signal 9 |
7 |
Runtime error |
42 ms |
65536 KB |
Execution killed with signal 9 |
8 |
Runtime error |
45 ms |
65540 KB |
Execution killed with signal 9 |
9 |
Runtime error |
45 ms |
65540 KB |
Execution killed with signal 9 |
10 |
Runtime error |
43 ms |
65540 KB |
Execution killed with signal 9 |