QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#274078	#6130. Plants vs. Zombies	xhgua	WA	132ms	5176kb	C++14	940b	2023-12-03 08:59:21	2023-12-03 08:59:22

Judging History

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

[2023-12-03 08:59:22]
评测

测评结果：WA
用时：132ms
内存：5176kb

查看

[2023-12-03 08:59:21]
提交

answer

#include <vector>
#include <iostream>

using i64 = long long;

void solve() {

	int n; i64 m;
	std::cin >> n >> m;

	std::vector<int> a(n + 1);
	for (int i = 1; i <= n; i++) std::cin >> a[i];

	auto check = [&](i64 mid) -> bool {

		std::vector<i64> b(n + 1, 0), c(n + 1, 0);
		for (int i = 1; i <= n; i++) b[i] = (mid == 0 ? 0 : (mid - 1) / a[i] + 1);

		i64 sum = 0;
		for (int i = 1; i <= n - 1; i++) {
			if (c[i] >= b[i]) continue;
			sum += 2 * (b[i] - c[i]) - 1;

			c[i + 1] = b[i] - c[i] - 1;
			c[i] = b[i];
		}

		if (c[n] < b[n]) sum += 2 * (b[n] - c[n]) - 1;

		return sum <= m; 
	};

	i64 l = 0, r = (1ll << 60);
	while (l < r) {
		i64 mid = (l + r + 1) >> 1;
		if (check(mid)) l = mid;
		else r = mid - 1;
	}

	std::cout << l << "\n";
}

int main() {

	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int T;
	std::cin >> T;

	while (T--) solve();

	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3480kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 132ms

memory: 5176kb

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
4
24
3
30
12
0
2
4
0
0
2
8
0
2
6
24
28
1
4
3
0
4
10
6
4
2
5
0
2
0
7
30
3
0
0
16
8
0
30
3
30
8
2
0
0
2
0
2
0
5
2
0
0
0
0
5
0
5
6
28
0
0
24
4
0
2
4
0
0
14
4
6
1
0
6
14
3
9
0
4
0
10
12
6
8
2
6
12
0
770
0
19
147
710
665
120
0
174
553874133149864146
1000000000000
740028822...

result:

wrong answer 16th numbers differ - expected: '2', found: '4'