QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#90953#6130. Plants vs. Zombieszzh00195WA 64ms4916kbC++14898b2023-03-26 10:38:082023-03-26 10:38:11

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-26 10:38:11]
  • 评测
  • 测评结果:WA
  • 用时:64ms
  • 内存:4916kb
  • [2023-03-26 10:38:08]
  • 提交

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 cnt = 0;
	for (int i = 1; i <= n + 10; i ++ )	b[i] = 0;
	for (int i = 1; i <= n; i ++ )
	{
		ll t = x - b[i];
		if (t <= 0)
		{
			cnt ++ ;
			continue;
		}
		ll res = t / a[i];
		if (t % a[i])	res ++ ;
		cnt += res * 2 - 1;
		b[i + 1] += a[i + 1] * (res - 1);
		if (cnt > m)	return false;
	}
	return true;
}

void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i ++ )
	{
		cin >> a[i];
		b[i] = 0;
	}
	ll l = 0, r = 1e18, mid;
	while (l < r)
	{
		mid = l + r + 1 >> 1;
		if (check(mid))	l = mid;
		else r = mid - 1;
	}
	cout << l << endl;
}

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: 3332kb

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: 64ms
memory: 4916kb

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'