QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#135375 | #6632. Minimize Median | PanC_ake | WA | 67ms | 35052kb | C++20 | 2.2kb | 2023-08-05 14:08:42 | 2023-08-05 14:08:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " = " << x << '\n'
// #define int long long
#define ll long long
#define endl '\n'
const int N = 1e6 + 10;
char *p1,*p2,buf[100000];
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
int read() {
int x=0,f=1;
char ch=nc();
while(ch<48||ch>57)
{
if(ch=='-')
f=-1;
ch=nc();
}
while(ch>=48&&ch<=57)
x=x*10+ch-48,ch=nc();
return x*f;
}
int n, m, k;
ll c[N], suf[N];
int a[N];
ll dp[N];
vector<array<ll, 2>> seg[N];
multiset<ll> st;
inline int check(int x) {
st.clear();
for (int i = 0; i <= m + 1; ++i) seg[i].clear(), dp[i] = 1e9 + 10;
for (int i = 1; i <= a[(n + 1) / 2]; ++i) {
for (auto [x, s] : seg[i]) {
if (s == 1) st.insert(x);
else st.erase(st.find(x));
}
if (st.size()) dp[i] = *st.begin();
dp[i] = min(dp[i], suf[i + 1]);
if (i <= x) dp[i] = 0;
for (int j = 2; j * i <= m; ++j) {
int l = j * i, r = min(m + 1, j * (i + 1));
// printf("l = %d r = %d res = %d\n", l, r, dp[i] + c[j]);
seg[l].push_back({dp[i] + c[j], 1});
seg[r].push_back({dp[i] + c[j], -1});
}
}
// for (int i = 1; i <= m; ++i) {
// printf("dp[%d]=%d\n", i, dp[i]);
// }
ll need = 0;
for (int i = 1; i <= (n + 1) / 2; ++i) {
if (a[i] >= x) need += dp[a[i]];
if (need > k) return 0;
}
return need <= k;
}
void solve() {
n = read();
m = read();
k = read();
for (int i = 1; i <= n; ++i) a[i] = read();
sort(a + 1, a + 1 + n);
for (int i = 1; i <= m; ++i) c[i] = read();
suf[m + 1] = 1e9 + 10;
for (int i = m; i >= 1; --i) {
suf[i] = min(suf[i + 1], c[i]);
}
int l = 0, r = a[(n + 1) / 2], cnt = 3;
while (l < r && cnt) {
cnt--;
int mid = (l + r) >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
cout << l << '\n';
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
t = read();
while(t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 34672kb
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: 67ms
memory: 35052kb
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:
0 2 0 0 0 0 0 0 3 4 0 0 0 0 1 1 0 0 0 0 1 1 0 2 2 0 0 0 0 0 2 0 0 0 2 2 0 1 0 0 0 0 1 0 2 4 1 1 0 0 2 0 0 7 0 1 0 0 0 1 1 0 1 0 1 0 0 2 1 0 6 3 0 0 1 0 2 0 0 3 0 1 0 0 0 2 0 0 0 0 1 2 1 4 0 0 0 0 0 0 1 2 2 1 2 2 0 1 1 0 0 0 0 0 1 2 1 4 1 0 4 1 2 1 0 0 0 0 1 2 1 0 0 2 3 1 0 1 1 1 0 1 5 0 1 2 0 2 0 0 ...
result:
wrong answer 84th numbers differ - expected: '1', found: '0'