QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #221281 | #6632. Minimize Median | Nerovix# | WA | 51ms | 7536kb | C++20 | 1.2kb | 2023-10-21 11:37:33 | 2023-10-21 11:37:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MAXN = 1e6 + 5;
int n, m, k;
int a[MAXN], cost[MAXN], Min[MAXN];
bool check(int mid) {
long long res = 0;
for(int i = 1; i <= (n + 1 >> 1); i++) {
if(a[i] <= mid) continue;
res += Min[a[i] / mid];
}
return res <= k;
}
void solve() {
cin >> n >> m >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= m; i++)
cin >> cost[i];
cost[1] = 0;
for(int i = 1; i <= m; i++) {
for(int j = 1; j <= i && i * j <= m; j++)
cost[i * j] = min(cost[i * j], cost[i] + cost[j]);
}
Min[m] = cost[m];
for(int i = m - 1; i >= 1; i--) Min[i] = min(Min[i + 1], cost[i]);
sort(a + 1, a + n + 1);
int l = 1, r = m, ans = m + 1;
while(l <= r) {
int mid = l + r >> 1;
if(check(mid)) r = mid - 1, ans = mid;
else l = mid + 1;
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int _; for(cin >> _; _; _--) solve();
return 0;
}
/*
3
3 5 0
2 5 2
3 2 4 6 13
3 5 3
2 5 3
3 2 4 6 13
3 5 6
2 5 2
3 2 4 6 13
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 7536kb
input:
3 3 5 0 2 5 2 3 2 4 6 13 3 5 3 2 5 3 3 2 4 6 13 3 5 6 2 5 2 3 2 4 6 13
output:
2 2 1
result:
ok 3 number(s): "2 2 1"
Test #2:
score: -100
Wrong Answer
time: 51ms
memory: 7508kb
input:
100000 5 10 5 3 7 1 10 10 11 6 11 6 1 8 9 1 3 1 5 6 51 2 2 2 5 1 42 61 26 59 100 54 5 10 76 7 5 8 4 7 97 4 44 83 61 45 24 88 44 44 5 8 90 1 1 5 1 3 35 15 53 97 71 83 26 7 5 3 52 1 1 3 1 1 22 6 93 5 6 28 6 6 1 3 1 9 31 2 19 10 27 5 8 31 3 6 2 1 2 32 29 13 7 57 34 9 5 5 6 75 3 3 4 5 4 40 56 38 60 17 3...
output:
1 2 1 1 1 1 1 1 2 3 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 1 1 1 1 1 2 1 1 1 2 2 1 1 1 1 1 1 1 1 2 3 1 1 1 1 2 1 1 4 1 2 1 1 1 1 1 1 1 1 1 1 1 2 1 1 4 2 1 1 1 1 2 1 1 2 1 1 1 1 1 2 1 1 1 1 1 2 2 3 1 1 1 1 1 1 1 2 2 1 2 2 1 1 1 1 1 1 1 1 1 2 1 3 1 1 3 1 2 1 1 1 1 1 1 2 1 1 1 2 2 1 1 1 1 1 1 1 3 1 1 2 1 2 1 1 ...
result:
wrong answer 1st numbers differ - expected: '0', found: '1'