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
77
78
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 151515
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
vll solve(vll& A, ll m, ll x) {
priority_queue<pll, vpll, greater<pll>> pq;
for(ll i = 1; i <= m; i++) pq.push({0, i});
unordered_map<ll, vll> mp;
ll n = A.size();
for(ll i = 0; i < n; i++) {
mp[A[i]].push_back(i);
}
sort(rall(A));
vll res(n);
for(ll i = 0; i < n; i++) {
auto [sum, tower] = pq.top(); pq.pop();
sum += A[i];
res[mp[A[i]].back()] = tower;
mp[A[i]].pop_back();
pq.push({sum, tower});
}
ll mi = pq.top().first;
while(!pq.empty()) {
auto [s, _] = pq.top(); pq.pop();
if(mi + x < s) return {};
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
cin>>tc;
for(ll i = 1; i <= tc; i++) {
ll n, m, x;
cin>>n>>m>>x;
vll A(n);
for(ll j = 0; j < n; j++) cin>>A[j];
auto res = solve(A, m, x);
if(res.empty()) {
cout<<"NO"<<endl;
} else {
cout<<"YES"<<endl;
for(auto r : res) cout<<r<<' ';cout<<endl;
}
}
return 0;
}
|
