QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#101372 | #6130. Plants vs. Zombies | diyitibu# | WA | 496ms | 6488kb | C++14 | 988b | 2023-04-29 12:10:15 | 2023-04-29 12:10:20 |
Judging History
answer
#include<bits/stdc++.h>
#define ll __int128
#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;
void write(ll x){
if(x >= 10) write(x / 10) ;
putchar('0' + x % 10) ;
}
__int128 a[maxn],d[maxn];
inline int solve(ll x){
ll sum=n;
for(int i=1;i<=n;++i){
d[i]=(x + a[i] - 1) / a[i] * a[i] - a[i] , d[i] /= a[i] ;
if(i!=1&&d[i]<d[i-1])sum=n-1;
}
for(int i=1;i<=n;++i){
sum += max((ll)0 , d[i] * 2) ;
d[i + 1] -= max((ll)0 , d[i]) ;
}
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=0;
while(l<=r){
ll mid=l+r>>1;
if(solve(mid))ans=mid,l=mid+1;
else r=mid-1;
}
//printf("%lld\n",ans);
write(ans) ;
putchar('\n') ;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 5420kb
input:
2 4 8 3 2 6 6 3 9 10 10 1
output:
6 4
result:
ok 2 number(s): "6 4"
Test #2:
score: -100
Wrong Answer
time: 496ms
memory: 6488kb
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 4 24 3 30 12 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 8 2 0 0 2 0 2 0 5 2 0 0 0 0 5 0 5 6 28 0 0 21 3 0 2 4 0 0 14 4 8 1 0 6 14 3 9 0 4 0 10 12 6 8 2 6 12 0 725 0 17 132 680 588 110 0 163 5910826 1000000000000 16561021906
result:
wrong answer 16th numbers differ - expected: '2', found: '4'