QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#466149 | #6632. Minimize Median | ucup-team191# | WA | 81ms | 7916kb | C++23 | 1.1kb | 2024-07-07 16:29:16 | 2024-07-07 16:29:16 |
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=1,hi=m;
while (lo<hi)
{
int mid=(lo+hi)/2;
for (int i=1;i<=m;++i) a[i]=MOD;
a[mid]=0;
for (int i=1;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>=1;--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: 100
Accepted
time: 1ms
memory: 7916kb
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: 81ms
memory: 7668kb
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:
1 2 1 1 1 1 1 1 3 4 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 1 1 1 1 1 2 1 1 1 2 2 1 1 1 1 1 1 1 1 2 4 1 1 1 1 2 1 1 7 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 6 3 1 1 1 1 2 1 1 3 1 1 1 1 1 2 1 1 1 1 1 2 1 4 1 1 1 1 1 1 1 2 2 1 2 2 1 1 1 1 1 1 1 1 1 2 1 4 1 1 4 1 2 1 1 1 1 1 1 2 1 1 1 2 3 1 1 1 1 1 1 1 5 1 1 2 1 2 1 1 ...
result:
wrong answer 1st numbers differ - expected: '0', found: '1'