QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#466155 | #6632. Minimize Median | ucup-team191# | WA | 1ms | 7924kb | C++23 | 1.1kb | 2024-07-07 16:31:46 | 2024-07-07 16:31:47 |
Judging History
answer
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)
const int N=1000010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;
int t,n,m,k,co[N],h[N],a[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>t;
while (t--)
{
cin>>n>>m>>k;
for (int i=0;i<n;++i) cin>>h[i];
for (int i=1;i<=m;++i) cin>>co[i];
for (int i=m-1;i>=1;--i) co[i]=min(co[i],co[i+1]);
int lo=0,hi=m;
while (lo<hi)
{
int mid=(lo+hi)/2;
for (int i=0;i<=m;++i) a[i]=MOD;
a[mid]=0;
for (int i=0;i<=m;++i)
{
int j;
for (j=1;i*j+j-1<=m;++j) a[i*j+j-1]=min(a[i*j+j-1],a[i]+co[j]);
if (j<=m) a[m]=min(a[m],a[i]+co[j]);
}
for (int i=m-1;i>=0;--i) a[i]=min(a[i],a[i+1]);
ll s=0;
vi coo;
for (int i=0;i<n;++i) coo.pb(a[h[i]]);
sort(all(coo));
for (int i=0;i<=n/2;++i) s+=coo[i];
if (s<=k) hi=mid;
else lo=mid+1;
}
cout<<lo<<en;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 7924kb
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 0
result:
wrong answer 3rd numbers differ - expected: '1', found: '0'