QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#131218 | #6632. Minimize Median | stasio6# | WA | 0ms | 7572kb | C++14 | 911b | 2023-07-26 18:45:09 | 2023-07-26 18:45:12 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int _,n,m,k,a[1<<20],c[1<<20],f[1<<20],l,r,d;
int C(int x){
int s=0;
for(int i=1;i<=n/2+1;i++)
s+=f[x?(a[i]+x-1)/x:a[i]+1];
return s<=k;
}
void Z(){
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>c[i],f[i]=c[i];
f[1]=0,sort(a+1,a+n+1),l=0,r=m,f[++m]=2e9;
for(int i=2;i<m;i++)
for(int j=1;i*(j-1)<=m;j++)
f[min(m,i*j)]=min(f[min(m,i*j)],f[j]+c[i]);
for(int i=m-1;i;i--)
f[i]=min(f[i],f[i+1]);
for(int i=1;i<=m;i++)
cout<<f[i]<<" \n"[i==m];
while(l<r)
d=(l+r)/2,C(d)?r=d:l=d+1;
cout<<l<<'\n';
}
signed main() {
ios::sync_with_stdio(0);
for(cin>>_;_--;)
Z();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
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:
0 2 4 4 6 6 2 0 2 4 4 6 6 2 0 2 4 4 6 6 1
result:
wrong answer 1st numbers differ - expected: '2', found: '0'