QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#691515 | #6130. Plants vs. Zombies | A_Quark# | WA | 108ms | 5184kb | C++20 | 863b | 2024-10-31 11:47:25 | 2024-10-31 11:47:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define DEBUG
#ifdef DEBUG
const ll N = 1000;
const ll rr = 16;
#endif
#ifndef DEBUG
const ll N = 100100;
const ll rr = 2e17;
#endif
ll a[N], s[N];
int main()
{
ll z;
cin >> z;
while(z--)
{
ll n, k;
cin >> n >> k;
for(ll i=1; i<=n; i++) cin >> a[i];
ll l = 1, r = rr;
auto chk = [&] (ll x)
{
if(x == 0) return 0ll;
for(ll i=1; i<=n; i++)
{
s[i] = (x-1) / a[i] + 1;
}
s[n+1] = 0x7f7f7f7f7f7f7f7f;
ll cnt = 0;
for(ll i=1; i<=n; i++)
{
cnt++;
s[i] --;
s[i] = max(0ll, s[i]);
s[i+1] -= s[i];
cnt += 2*s[i];
}
return cnt;
};
while(l < r)
{
ll m = (l+r)/ 2;
if(chk(m) <= k) l = m+1;
else r = m;
}
cout << l-1 << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3692kb
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: 108ms
memory: 5184kb
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'