QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#190517 | #6130. Plants vs. Zombies | Zhou_JK | WA | 91ms | 4748kb | C++23 | 1.0kb | 2023-09-29 01:41:02 | 2023-09-29 01:41:02 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=100005;
int n;
long long m;
int a[N];
long long b[N];
bool check(long long x)
{
long long tot=0;
for(int i=1;i<=n;i++)
b[i]=0;
for(int i=1;i<=n;i++)
if(b[i]<x)
{
long long t=(x-b[i]+a[i]-1)/a[i];
tot+=t*2-1;
if(tot>m) return false;
b[i+1]+=a[i+1]*(t-1);
}
else
{
tot++;
if(tot>m) return false;
}
return true;
}
void solve()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
long long l=1,r=*max_element(a+1,a+n+1)*m,ans=-1;
while(l<=r)
{
long long mid=(l+r)/2;
if(check(mid)) ans=mid,l=mid+1;
else r=mid-1;
}
cout<<ans<<"\n";
return;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
int T;
cin>>T;
while(T--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 91ms
memory: 4748kb
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:
-1 -1 4 6 18 3 2 12 1 4 -1 4 2 6 -1 2 24 3 30 10 -1 2 3 -1 -1 2 6 -1 1 6 24 28 1 3 3 -1 4 10 6 4 1 5 -1 1 -1 7 30 2 -1 -1 16 8 -1 30 2 25 4 2 -1 -1 2 -1 2 -1 5 2 -1 -1 -1 -1 5 -1 4 4 28 -1 -1 21 3 -1 2 4 -1 -1 14 4 6 1 -1 5 12 3 8 -1 4 -1 10 12 5 6 1 6 9 -1 725 -1 17 132 676 588 110 -1 163 5910826 1...
result:
wrong answer 1st numbers differ - expected: '0', found: '-1'