QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#227450 | #6130. Plants vs. Zombies | hano | WA | 120ms | 4920kb | C++14 | 1.2kb | 2023-10-27 16:06:53 | 2023-10-27 16:06:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi pair<int,ll>
#define fi first
#define se second
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
int main(){
int t;cin>>t;
while(t--){
ll n,m;cin>>n>>m;
vector<ll>v;
for(int i=0;i<n;i++){
ll a;cin>>a;
v.push_back(a);
}
ll l=0,h=1e17,mid;
ll prev=0;
ll bst=0;
while(l<=h){
mid=(l+h)>>1;
ll mm=m;
for(int i=0;i<n;i++){
ll now=v[i];
ll k=mid/now+(mid%now!=0)-1;
mm--;
if(k<=prev){
prev=0;
continue;
}else{
k-=prev;
prev=0;
if(i!=n-1){
prev=k;
mm-=(2*k);
}else{
mm-=(2*k);
}
}
}
if(mm>=0){
bst=max(bst,mid);
l=mid+1;
}else{
h=mid-1;
}
}
cout<<bst<<endl;
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3464kb
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: 120ms
memory: 4920kb
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 16650504450556638 1000000000000 16561021906
result:
wrong answer 5th numbers differ - expected: '20', found: '18'