QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#90958 | #6130. Plants vs. Zombies | zzh00195 | WA | 24ms | 5148kb | C++14 | 1.5kb | 2023-03-26 10:45:31 | 2023-03-26 10:45:33 |
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 step = 0;
for (int i = 1; i <= n + 10; i ++ ) b[i] = 0;
for (int i = 1; i <= n; i ++ )
{
if (x > b[i]) {
// 第 i 棵植物需要继续浇水
// 在它和第 (i + 1) 棵植物之间反复移动
long long t = x - b[i];
t = (t + a[i] - 1) / a[i];
step += t * 2 - 1;
// 步数超出限制就即刻退出
// 否则数据范围可能超出 long long
if (step > m) return false;
b[i + 1] += a[i + 1] * (t - 1);
} else {
// 第 i 棵植物不需要继续浇水
// 直接路过,但步数还要算
// 这里步数可能会超过限制
// 但是只要右边没有其它需要浇水的植物,就不会返回 false
step++;
}
}
return true;
}
void solve()
{
scanf("%d%lld", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
// 二分答案
long long head = 0, tail = 1e18;
while (head < tail) {
long long mid = (head + tail + 1) >> 1;
if (check(mid)) head = mid;
else tail = mid - 1;
}
printf("%lld\n", head);
}
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: 2ms
memory: 3612kb
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: 24ms
memory: 5148kb
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 0 0 0
result:
wrong answer 114th numbers differ - expected: '5910826', found: '0'