QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#233740#6632. Minimize Medianugly2333WA 74ms5892kbC++20762b2023-10-31 21:57:502023-10-31 21:57:51

Judging History

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

  • [2023-10-31 21:57:51]
  • 评测
  • 测评结果:WA
  • 用时:74ms
  • 内存:5892kb
  • [2023-10-31 21:57:50]
  • 提交

answer

//Δ_B 
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1111111;
const int inf = 1e9+N;
int n,m,k,a[N],c[N];
int main(){
	int T,i,j,l,r,h,x;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d%d",&n,&m,&k);
		for(i=1;i<=n;i++)
			scanf("%d",a+i);
		sort(a+1,a+n+1);
		n=n/2+1;
		for(i=1;i<=m;i++)
			scanf("%d",c+i);
		c[1]=0;
		m++;
		c[m]=inf;
		for(i=1;i<=m;i++)
			for(j=1;i*j<m+i;j++)
				c[min(i*j,m)]=min(c[min(i*j,m)],c[i]+c[j]);
		for(i=m-1;i>=1;i--)
			c[i]=min(c[i],c[i+1]);
		l=0,r=m;
		while(l<r){
			h=l+r>>1;
			x=k;
			for(i=1;i<=n;i++)
				if(x>=0)
					x-=c[(a[i]+1+h)/(h+1)];
			if(x>=0)
				r=h;
			else
				l=h+1;
		}
		printf("%d\n",l);
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5844kb

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: 74ms
memory: 5892kb

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
0
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
0
2
1
0
6
3
0
0
1
0
2
0
0
3
0
1
0
1
0
2
0
0
0
0
1
2
1
4
0
0
1
0
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
0
...

result:

wrong answer 34th numbers differ - expected: '0', found: '1'