QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#90965 | #6130. Plants vs. Zombies | zzh00195 | AC ✓ | 510ms | 4956kb | C++14 | 897b | 2023-03-26 10:52:04 | 2023-03-26 10:52:07 |
Judging History
answer
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll a[N], n, m;
ll b[N];
bool check(ll x)
{
ll cnt = 0;
for (int i = 0; i <= n + 9; i ++ ) b[i] = 0;
for (int i = 1; i <= n; i ++ )
{
ll t = x - b[i];
if (t <= 0)
{
cnt ++ ;
continue;
}
ll res = t / a[i];
if (t % a[i]) res ++ ;
cnt += res * 2 - 1;
b[i + 1] += a[i + 1] * (res - 1);
if (cnt > m) return false;
}
return true;
}
void solve()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
{
cin >> a[i];
b[i] = 0;
}
ll l = 0, r = 1e18, mid;
while (l < r)
{
mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
cout << l << endl;
}
int main()
{
int t;
cin >> t;
while (t -- )
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3444kb
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: 0
Accepted
time: 201ms
memory: 4956kb
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 20 3 2 14 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 4 3 0 4 10 6 4 1 5 0 2 0 7 30 2 0 0 16 8 0 30 2 30 4 2 0 0 2 0 2 0 5 2 0 0 0 0 5 0 4 6 28 0 0 21 3 0 2 4 0 0 14 4 6 1 0 5 14 3 8 0 4 0 10 12 5 8 1 6 12 0 725 0 17 132 676 588 110 0 163 5910826 1000000000000 16561021906
result:
ok 116 numbers
Test #3:
score: 0
Accepted
time: 510ms
memory: 4804kb
input:
2110 4 0 3 2 6 6 4 1 3 2 6 6 2 7 3 9 28 82 68 27 32 98 88 19 96 37 53 50 45 37 41 92 51 70 73 84 2 53 7 89 9 59 24 23 62 97 22 145 61 22 87 34 75 89 22 6 10 74 21 35 33 23 85 66 89 46 16 48 2 48 25 146 67 63 93 98 1 70 57 45 40 15 1 5 54 38 96 19 94 18 43 98 28 45 47 92 46 21 26 83 54 21 72 25 47 2 ...
output:
0 0 12 35 72 29 6 125 1462 93 160 54 28 27 4 33 625 43 60 1056 0 116 42 31 66 0 0 370 80 198 66 189 39 55 42 36 63 810 325 36 38 20 59 115 0 0 25 4 7 0 72 0 60 1045 39 24 48 35 120 16 86 42 0 28 38 135 67 22 60 104 0 2256 110 0 0 4 25 59 49 0 16 1008 0 26 750 36 33 12 13 48 48 85 18 3135 182 24 160 ...
result:
ok 2110 numbers