QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #128168 | #6632. Minimize Median | Paradox | WA | 60ms | 7572kb | C++20 | 1.9kb | 2023-07-20 17:08:31 | 2023-07-20 17:08:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int N=1e6+10;
int n,m,k;
int a[N],cost[N],b[N];
bool check(int x){
int sum=0;
for(int i=1;i<=(n+1)/2;i++){
sum+=cost[(a[i]+1+x)/(x+1)];
// cout<<a[i]<<" ";
if(sum>k) return 0;
}
// cout<<endl;
// cout<<sum<<"__\n";
return sum<=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];
sort(a+1,a+1+n);
if(k==0){cout<<a[(n+1)>>1]<<"\n";return;}
// cost[1] = 0, cost[m + 1] = 1e18;
// for (int i = m; i >= 1; i--) cost[i] = min(cost[i], cost[i + 1]);
// for (int i = 1; i <= m; i++){
// int j = 1;
// for (; j * i <= m; j++)
// cost[i * j] = min(cost[i * j], cost[i] + cost[j]);
// cost[m + 1] = min(cost[m + 1], cost[i] + cost[j]);
// }
// for (int i = m; i >= 1; i--) cost[i] = min(cost[i], cost[i + 1]);
b[m]=cost[m];cost[1]=0;
for(int i=m-1;i>0;i--) {cost[i]=min(cost[i],cost[i+1]);b[i]=cost[i];}
for(int i=2;i<=m;i++){
int j;
for(j=1;j*i<=m;j++)
b[i*j]=min(b[i*j],b[i]+b[j]);
b[m]=min(b[m],b[i]+b[j]);
}
for(int i=m-1;i>0;i--) {b[i]=min(b[i],b[i+1]);cost[i]=b[i];}
cost[m]=b[m];
cost[1]=0;
// for(int i=1;i<=m;i++) cout<<cost[i]<<" ";cout<<endl;
int l=0,r=a[n];
int ans=l;
while(l<r){
// cout<<"--\n";
int mid=l+r>>1;
if(check(mid)) {r=mid;}
else {l=mid+1;}
// cout<<l<<" "<<r<<endl;
}
cout<<r<<"\n";
return;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t;cin>>t;
while(t--){
// cout<<"-___\n";
solve();
}
return 0;
}
/*
2
9 6 3
5 7 8214 91278 298 23 342 24 21
4 5 3 2 6 5
7 4 6
675 897 543 9 456 897 3
4 6 2 2
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 7572kb
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: 60ms
memory: 7564kb
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 1 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 1 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 0 0 0 2 3 1 0 1 1 1 0 1 5 0 1 2 0 2 0 0 ...
result:
wrong answer 34th numbers differ - expected: '0', found: '1'