QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#694485 | #6130. Plants vs. Zombies | ucup-team3294# | WA | 81ms | 4788kb | C++23 | 850b | 2024-10-31 18:04:05 | 2024-10-31 18:04:05 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define x first
#define y second
void solve() {
int n,m;
cin>>n>>m;
vector<int> a(n+10);
for(int i=1;i<=n;i++){
cin>>a[i];
}
int l=0,r=5e16;
vector<int> c(n+10);
auto check=[&](int x)->bool{
for(int i=1;i<=n;i++){
c[i]=(x+a[i]-1)/a[i];
}
int sum=1;
if(c[1]) c[1]--;
for(int i=1;i<n;i++){
if(c[i]>0){
sum+=2*c[i]+1;
c[i+1]=c[i+1]-c[i]-1;
}else {
sum++;
c[i+1]--;
}
if(sum>m) return 0;
}
if(c[n]>0) sum+=2*c[n];
return sum<=m;
};
while(l<r){
int mid=l+r+1>>1;
if(check(mid)) l=mid;
else r=mid-1;
}
cout<<l<<"\n";
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int T=1;
cin>>T;
while(T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3840kb
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: 81ms
memory: 4788kb
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 18 3 2 12 1 4 0 4 2 6 0 2 24 3 30 10 0 2 3 0 0 2 6 0 1 6 24 28 1 3 3 0 4 10 6 4 1 5 0 1 0 7 30 2 0 0 16 8 0 30 2 25 4 2 0 0 2 0 2 0 5 2 0 0 0 0 5 0 4 4 28 0 0 21 3 0 2 4 0 0 14 4 6 1 0 5 12 3 8 0 4 0 10 12 5 6 1 6 9 0 725 0 17 132 676 588 110 0 163 5910826 1000000000000 16561021906
result:
wrong answer 5th numbers differ - expected: '20', found: '18'