-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathd.cpp
78 lines (73 loc) · 2.13 KB
/
d.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int Q; cin >> Q;
while(Q--){
string s; cin >> s;
int m; cin >> m;
int b[m];
for(int i = 0; i < m; i++){
cin >> b[i];
}
int idxs[m];
vi indicies;
int mcnt = 0;
for(int cnt = 0; true; cnt++){
vi zeros;
for(int i = 0; i < m; i++){
if(b[i] == 0){
zeros.push_back(i);
}
}
if((int)zeros.size() == 0){
break;
}
for(int i : zeros){
idxs[i] = cnt;
b[i] = -1;
for(int j = 0; j < m; j++){
b[j] -= abs(i-j);
}
}
indicies.push_back((int)zeros.size());
mcnt = cnt+1;
}
map<char, int> cmap;
vector<char> cvec;
for(char i : s){
cmap[i]++;
}
for(auto it = cmap.begin(); it != cmap.end(); it++){
cvec.push_back(it -> first);
}
char out[m];
int stidx = (int)cvec.size();
for(int i = 0; i < mcnt; i++){
stidx--;
while(cmap[cvec[stidx]] < indicies[i]){
stidx--;
}
for(int j = 0; j < m; j++){
if(idxs[j] == i){
out[j] = cvec[stidx];
}
}
}
for(char i : out) cout << i;
cout << endl;
}
return 0;
}