QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#282076 | #6130. Plants vs. Zombies | fosov | WA | 170ms | 4900kb | C++17 | 1.1kb | 2023-12-11 12:40:47 | 2023-12-11 12:40:48 |
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;
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 + 1;
} else {
r = md;
}
}
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: 100
Accepted
time: 3ms
memory: 4116kb
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: 170ms
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:
-1 -1 4 6 20 3 2 14 1 4 -1 4 2 6 -1 2 24 3 30 10 -1 2 3 -1 0 2 6 -1 1 6 24 28 1 4 3 -1 4 10 6 4 1 5 -1 2 0 7 30 2 -1 0 16 8 -1 30 2 30 4 2 0 -1 2 -1 2 -1 5 2 -1 -1 -1 -1 5 -1 4 6 28 -1 -1 21 3 0 2 4 -1 -1 14 4 6 1 -1 5 14 3 8 -1 4 -1 10 12 5 8 1 6 12 -1 725 -1 17 132 676 588 110 -1 163 5910826 10000...
result:
wrong answer 1st numbers differ - expected: '0', found: '-1'