QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #128148 | #6632. Minimize Median | yy_zq | WA | 1ms | 9760kb | C++14 | 1.5kb | 2023-07-20 16:45:29 | 2023-07-20 16:45:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i)
#define For(i,j,k) for(int i=j;i>=k;--i)
#define mid ((l+r)>>1)
const int MAX = 1e6 +111;
int cost[MAX],g[MAX],h[MAX];
int a[MAX];
int ok(int M,int n,int k){
int md = (n+1)>>1;
int div = 1;
FOR(i,1,md){
if(a[i]>M){
while((a[i]/div)>M) ++div;
k-=h[div];
}
}
return k>=0;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("1.in","r",stdin);
int t;
cin>>t;
int mx = 1e6;
int yss = 0;
int gg = 0;
if(t>=100000) yss =1;
while(t--){
int n,m,k;
cin>>n>>m>>k;
++gg;
// if(yss)
// if(t>=99900){
// cout<<n<<' '<<m<<' '<<k<<' '<<endl;
// }
// else break;
FOR(i,1,n) cin>>a[i];
FOR(i,1,m) cin>>cost[i],g[i] = cost[i];
sort(a+1,a+1+n);
FOR(i,1,m){
FOR(j,1,i){
if(i*j>m) break;
g[i*j] = min(g[i*j],g[i]+g[j]);
}
}
if(gg==21){
cout<<n<<' '<<m<<' '<<k<<endl;
FOR(i,1,n) cout<<a[i]<<' ';cout<<endl;
FOR(i,1,m) cout<<cost[i]<<' ';cout<<endl;
break;
}
int pos = m;
int cst_min = g[m];
FOR(i,1,m){
while(i*(pos-1)>=m) --pos,cst_min = min(cst_min,g[pos]);
g[m] = min(g[m],g[i]+cst_min);
}
h[m] = g[m];
For(i,m-1,1) h[i] = min(g[i],h[i+1]);
int l = 0, r = m;
while(l<r){
if(ok(mid,n,k)) r = mid;
else l = mid+1;
}
FOR(i,0,m) h[i]=g[i]=cost[i]=0;
if(!yss) cout<<l<<endl;
}
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: 9760kb
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: 1ms
memory: 9584kb
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:
5 3 41 1 2 3 3 3 72 59 16
result:
wrong answer 1st numbers differ - expected: '0', found: '5'