QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#197982 | #6130. Plants vs. Zombies | HarryJ | WA | 113ms | 5152kb | C++23 | 1.0kb | 2023-10-02 23:03:34 | 2023-10-02 23:03:35 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const LL mod=998244353;
const int INF=0x3f3f3f3f;
const int N=1e5+10;
LL a[N],b[N];
LL n,m;
int check(LL x)
{
for(int i=1;i<=n;i++) b[i]=(x+a[i]-1)/a[i]-1;
LL cnt=n;
int last=n;
for(int i=n;i>=1;i--)
{
if(b[i]>0)
{
cnt+=b[i]*2;
b[i-1]-=b[i];
last=i;
}
cnt++;
b[i-1]--;
}
cnt-=last;
if(cnt<=m) return 1;
return 0;
}
void solve()
{
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
LL l=0,r=1e17;
while(l<r)
{
LL mid=(l+r+1)/2;
if(check(mid)) l=mid;
else r=mid-1;
}
cout<<l<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int tt; cin>>tt;
while(tt--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 113ms
memory: 5152kb
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 2 2 14 2 5 0 4 2 8 0 4 24 2 30 12 0 2 3 0 0 2 6 0 2 4 24 28 2 4 2 0 4 10 6 2 2 5 0 2 0 7 36 4 0 0 16 8 0 30 3 30 8 4 0 0 2 0 2 0 3 2 0 0 0 0 5 0 4 6 28 0 0 21 6 0 3 6 0 0 16 3 6 1 0 6 14 6 8 0 4 0 12 14 6 8 2 6 12 0 687 0 2 36 650 532 16 0 94 16650504450556638 1000000000000 16561021520
result:
wrong answer 6th numbers differ - expected: '3', found: '2'