QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#778424	#6130. Plants vs. Zombies	999^#	WA	125ms	6688kb	C++14	778b	2024-11-24 14:34:38	2024-11-24 14:34:39

Judging History

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

[2024-11-24 14:34:39]
评测

测评结果：WA
用时：125ms
内存：6688kb

查看

[2024-11-24 14:34:38]
提交

answer

#include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
typedef long long LL;
using namespace std;
const int N=2000007;
int n;
LL m,A[N],C[N];
bool ok(LL d) {
	LL k=0;
	For(i,1,n) {
		C[i]=(d+A[i]-1)/A[i];
	}
	For(i,1,n) {
		C[i]=max(C[i],0LL);
		C[i+1]-=C[i];
		k+=C[i];
		if(2*k>m) break;
	}
	if(2*k<=m) return 1;
	For(i,1,n) {
		C[i]=(d+A[i]-1)/A[i];
	}
	--C[1]; k=0;
	For(i,1,n) {
		C[i]=max(C[i],0LL);
		C[i+1]-=C[i];
		k+=C[i];
		if(2*k+1>m) return 0;
	}
	return 1;
}
void magic() {
	scanf("%d%lld",&n,&m);
	For(i,1,n) scanf("%lld",&A[i]);
	LL l=1,r=1E18;
	while(l<=r) {
		LL m=(l+r)>>1;
		if(ok(m)) l=m+1;
		else r=m-1; 
	}
	printf("%lld\n",r);
}
int main() {
	int T;
	scanf("%d",&T);
	while(T--) {
		magic();
	}
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 5924kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 125ms

memory: 6688kb

input:

116
4 0
3 2 6 6
4 1
3 2 6 6
10 19
10 2 8 4 2 4 9 3 3 3
4 8
3 9 3 6
2 19
2 10
11 15
3 1 1 4 3 7 10 8 6 7 10
10 14
8 7 1 1 10 9 2 8 10 7
2 13
2 3
10 10
8 1 6 6 9 4 7 1 8 8
7 14
6 7 4 5 3 1 3
11 6
8 1 10 9 7 2 6 6 1 3 9
4 10
6 1 3 8
7 7
10 6 2 10 4 7 2
5 11
9 10 5 9 2
9 1
2 4 8 6 2 8 8 1 6
4 5
7 2 9 8
...

output:

0
0
4
6
20
3
2
14
1
4
0
4
2
6
0
2
24
3
30
10
0
2
3
0
0
2
6
0
2
6
24
28
1
4
3
0
4
10
6
4
2
5
0
2
0
7
30
2
0
0
16
8
0
30
3
30
4
2
0
0
2
0
2
0
5
2
0
0
0
0
5
0
4
6
28
0
0
21
3
0
2
4
0
0
14
4
6
1
0
5
14
3
8
0
4
0
10
12
5
8
1
6
12
0
741
0
17
138
687
612
113
0
169
5910826
1000000000000
16561022296

result:

wrong answer 29th numbers differ - expected: '1', found: '2'