QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#131231#6632. Minimize Medianstasio6#WA 1ms7576kbC++14971b2023-07-26 19:11:042023-07-26 19:11:06

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-26 19:11:06]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:7576kb
  • [2023-07-26 19:11:04]
  • 提交

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)+1:a[i]+1];
	return s<=k;
}
void Z(){
	cin>>n>>m>>k,l=0,r=m;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=m;i++)
		cin>>c[i];
	m++,c[m]=f[m]=2e9,sort(a+1,a+n+1);
	for(int i=m-1;i;i--)
		c[i]=min(c[i],c[i+1]),f[i]=c[i];
	f[1]=0;
	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: 1ms
memory: 7576kb

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'