QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#101367	#6130. Plants vs. Zombies	diyitibu^#	WA	69ms	5048kb	C++14	821b	2023-04-29 11:36:53	2023-04-29 11:36:55

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-04-29 11:36:55]
评测

测评结果：WA
用时：69ms
内存：5048kb

查看

[2023-04-29 11:36:53]
提交

answer

#include<bits/stdc++.h>
#define ll long long
#define gc getchar
#define maxn 100005
using namespace std;

inline ll read(){
	ll a=0;int f=0;char p=gc();
	while(!isdigit(p)){f|=p=='-';p=gc();}
	while(isdigit(p)){a=(a<<3)+(a<<1)+(p^48);p=gc();}
	return f?-a:a;
}int n;
ll m;

ll a[maxn],d[maxn];

inline int solve(ll x){
	ll sum=n;
	for(int i=1;i<=n;++i)d[i]=a[i];
	for(int i=1;i<=n;++i){
		if(x<=d[i])continue;
		ll ci=ceil(1.0*(x-d[i])/a[i]);
		d[i+1]+=ci*a[i+1];
		sum+=ci<<1;
		if(sum>m)return 0;
	}
	return sum<=m;
}

int main(){
	int t=read();
	while(t--){
		n=read();m=read();
		for(int i=1;i<=n;++i)
			a[i]=read(),d[i]=0;
		ll l=0,r=1e17,ans;
		while(l<=r){
			ll mid=l+r>>1;
			if(solve(mid))ans=mid,l=mid+1;
			else r=mid-1;
		}
		printf("%lld\n",ans);
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3708kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 69ms

memory: 5048kb

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:

175646982537219
175646982537219
4
6
18
3
2
12
1
4
4
4
2
6
6
2
24
3
30
10
10
2
3
3
3
2
6
6
1
6
24
28
1
3
3
3
4
10
6
4
1
5
5
1
1
7
30
2
2
2
16
8
8
30
2
25
4
2
2
2
2
2
2
2
5
2
2
2
2
2
5
5
4
4
28
28
28
21
3
3
2
4
4
4
14
4
6
1
1
5
12
3
8
8
4
4
10
12
5
6
1
6
9
9
725
725
17
132
676
588
110
110
163
5910826
...

result:

wrong answer 1st numbers differ - expected: '0', found: '175646982537219'