QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#177480 | #6130. Plants vs. Zombies | TJ_Andeviking | WA | 136ms | 4808kb | C++20 | 1.4kb | 2023-09-13 00:10:50 | 2023-09-13 00:10:50 |
Judging History
answer
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define lowbit(x) (x&(-x))
#define inv(x) qpow(x,mod-2)
#define debug(x) cout << (#x) << " = " << x << endl
#define range(x) (x).begin(), (x).end()
const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;
/*---------------------------------------*/
ll n, m;
vector<ll>v;
bool check(ll mid)
{
vector<ll>now(n + 5);
ll ans = 0;
for (int i = 1;i <= n;i++) {
now[i] += v[i];
ans++;
if (now[i] >= mid)
continue;
ll cnt = (mid - now[i]) / v[i] + bool((mid - now[i]) % v[i]);
now[i + 1] += cnt * v[i];
ans += cnt * 2;
}
return ans <= m;
}
void solve()
{
cin >> n >> m;
v.clear();
v.resize(n + 5);
for (int i = 1;i <= n;i++)
cin >> v[i];
ll l = 0, r = 1e18;
while (l < r) {
ll mid = (l + r + 1) >> 1;
if (check(mid))
l = mid;
else
r = mid - 1;
}
cout << l << '\n';
}
/*---------------------------------------*/
int main()
{
iofast;
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
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: 136ms
memory: 4808kb
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 18 3 2 12 1 4 0 4 2 6 0 2 24 3 30 14 0 2 3 0 0 2 6 0 1 6 27 40 1 3 3 0 4 10 11 4 1 5 0 1 0 7 30 2 0 0 16 11 0 36 2 25 4 2 0 0 2 0 2 0 8 2 0 0 0 0 5 0 4 4 28 0 0 21 3 0 2 4 0 0 14 4 6 1 0 7 20 3 8 0 4 0 10 12 5 8 1 6 9 0 951 0 17 135 1030 656 117 0 164 483113369281681155 1000000000000 2952864...
result:
wrong answer 5th numbers differ - expected: '20', found: '18'