QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#326433 | #6130. Plants vs. Zombies | Lain | WA | 132ms | 4776kb | C++23 | 932b | 2024-02-13 02:57:40 | 2024-02-13 02:57:40 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt;
cin >> tt;
while(tt--) {
int n;
int64_t m;
cin >> n >> m;
vector<int64_t> a(n);
for (auto& x : a) cin >> x;
auto check = [&](int64_t d)->bool {
vector<int64_t> ops(n);
for (int i =0; i < n; i++) {
ops[i] = (d + a[i] - 1)/a[i];
}
int64_t need = 0;
for (int i = 0; i < n; i++) {
need++;
ops[i]--;
if (ops[i] <= 0) continue;
int64_t want = ops[i];
need += 2*want;
ops[i] -= want;
if (i+1 < n) ops[i+1] -= want;
}
return need <= m;
};
int64_t l = 1, r = 1e18;
while(l < r) {
int64_t m = (l+r+1)/2;
if (check(m)) {
l = m;
} else {
r = m-1;
}
}
cout << l << '\n';
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3800kb
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: 132ms
memory: 4776kb
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:
1 1 4 6 18 3 2 12 1 4 1 4 2 6 1 2 24 3 30 10 1 2 3 1 1 2 6 1 1 6 24 28 1 3 3 1 4 10 6 4 1 5 1 1 1 7 30 2 1 1 16 8 1 30 2 25 4 2 1 1 2 1 2 1 5 2 1 1 1 1 5 1 4 4 28 1 1 21 3 1 2 4 1 1 14 4 6 1 1 5 12 3 8 1 4 1 10 12 5 6 1 6 9 1 725 1 17 132 676 588 110 1 163 581298493411633717 1000000000000 7400288227...
result:
wrong answer 1st numbers differ - expected: '0', found: '1'