QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#282077 | #6130. Plants vs. Zombies | fosov | WA | 3ms | 4344kb | C++17 | 1.1kb | 2023-12-11 12:42:07 | 2023-12-11 12:42:07 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 0x3f3f3f3f
#define LNF (ll) 0x3f3f3f3f3f3f3f3f
#define maxn 100010
ll a[maxn], def[maxn];
void solve() {
ll n, m; cin >> n >> m;
for (int i = 0; i < n; ++ i) cin >> a[i];
ll l = 0, r = LNF;
while (l < r) {
ll md = (l + r + 1) >> 1;
ll stp = 0;
memset(def, 0, sizeof def);
for (int i = 0; i < n; ++ i) {
if (md <= def[i]) {
stp += i != n-1;
} else {
ll cnt = (md - def[i] + a[i] - 1) / a[i];
stp += cnt * 2 - 1;
if (stp > m) break;
def[i+1] = (a[i+1] * (cnt - 1));
}
}
if (stp <= m) {
l = md;
} else {
r = md - 1;
}
}
cout << l - 1 << '\n';
}
int main() {
#ifdef TEST
freopen("zz.in", "r+", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int t; cin >> t;
while (t --) solve();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 3ms
memory: 4344kb
input:
2 4 8 3 2 6 6 3 9 10 10 1
output:
5 3
result:
wrong answer 1st numbers differ - expected: '6', found: '5'