QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #138380 | #6632. Minimize Median | syx2567 | WA | 67ms | 7936kb | C++14 | 810b | 2023-08-11 16:57:22 | 2023-08-11 16:57:24 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1000005;
int T,n,m,k,a[N],cost[N];
long long w[N];
bool check(int x)
{
long long res=0;
for(int i=1;i<=n;i++) res+=w[a[i]/(x+1)+1];//[a[i]/res]<=x <==> a[i]<(x+1)*res
return res<=k;
}
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1);
n=(n+1)/2;
for(int i=1;i<=m;i++) scanf("%d",&cost[i]);
for(int i=1;i<=m+1;i++) w[i]=1e15;
w[1]=0;
for(int i=1;i<=m;i++)
for(int j=1;j*j<=i;j++)
if(i%j==0) w[i]=min(w[i],min(w[i/j]+cost[j],w[j]+cost[i/j]));
for(int i=m;i>=1;i--) w[i]=min(w[i],w[i+1]);
int l=0,r=a[n];
while(l<r)
{
int mid=(l+r)/2;
if(check(mid)) r=mid;
else l=mid+1;
}
printf("%d\n",l);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 7936kb
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: 7756kb
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 1 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 1 1 0 0 1 1 1 1 1 0 1 0 1 2 1 0 6 3 1 0 1 0 2 0 0 3 0 1 0 1 0 2 0 0 0 1 1 2 1 4 0 0 1 1 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 1 ...
result:
wrong answer 27th numbers differ - expected: '0', found: '1'