QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#190189 | #6130. Plants vs. Zombies | woshiluo | WA | 113ms | 4900kb | C++20 | 904b | 2023-09-28 14:31:49 | 2023-09-28 14:31:49 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
long long m;
cin >> n >> m;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
auto check = [&](long long x) {
vector<long long> ned(n + 1);
for (int i = 0; i < n; i++) {
ned[i] = (x + a[i] - 1) / a[i];
}
long long need = 0;
for (int i = 0; i < n; i++) {
if (i + 1 == n && ned[i] <= 0) {
break;
}
ned[i] -= 1;
need += 1;
if (ned[i] > 0) {
need += ned[i] * 2;
ned[i + 1] -= ned[i];
ned[i] = 0;
}
}
return need <= m;
};
long long l = 0, r = 1e18;
while (r - l > 1) {
long long mid = (l + r) / 2;
if (check(mid)) {
l = mid;
} else {
r = mid;
}
}
cout << l << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 113ms
memory: 4900kb
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 581298493411633717 1000000000000 740028822...
result:
wrong answer 114th numbers differ - expected: '5910826', found: '581298493411633717'