QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#398162 | #6130. Plants vs. Zombies | ir101 | WA | 112ms | 5700kb | C++17 | 1.4kb | 2024-04-25 00:54:12 | 2024-04-25 00:54:12 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
void solve(){
int n,m;
cin>>n>>m;
vector<int>a(n+1);
for (int i = 1; i <=n ; ++i) {
cin>>a[i];
}
auto check=[&](int x){
auto b=a;
for (int i = 1; i <=n ; ++i) {
b[i]=(x-1)/a[i]+1;
}
b.push_back(0);
int sum=0;
for (int i = 0; i <=n ; ++i) {
if(sum>m)return false;
if(b[i]<=0){
if(i==n)continue;
b[i+1]--;
sum++;
continue;
}
else{
sum+=b[i]*2;
b[i+1]-=b[i];
if(i==n)continue;
if(i<n-1){
b[i+1]--;
sum++;
}
else if(i==n-1 and b[i+1]>0){
b[i+1]--;
sum++;
}
}
}
return sum<=m;
};
int l=0,r=2e18;
int ans=-1;
while(l<=r){
int mid=l+r>>1;
if(check(mid)){
l=mid+1;
ans=mid;
}
else r=mid-1;
}
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false),cin.tie(0);
int t;
cin>>t;
while ( t-- ){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3860kb
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: 112ms
memory: 5700kb
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 20 3 2 14 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 4 3 -1 4 10 6 4 1 5 -1 2 -1 7 30 2 -1 -1 16 8 -1 30 2 30 4 2 -1 -1 2 -1 2 -1 5 2 -1 -1 -1 -1 5 -1 4 6 28 -1 -1 21 3 -1 2 4 -1 -1 14 4 6 1 -1 5 14 3 8 -1 4 -1 10 12 5 8 1 6 12 -1 725 -1 17 132 676 588 110 -1 163 5910826 ...
result:
wrong answer 1st numbers differ - expected: '0', found: '-1'