QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#636286	#6130. Plants vs. Zombies	La5te2	WA	5ms	3956kb	C++20	894b	2024-10-12 23:13:01	2024-10-12 23:13:01

Judging History

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

[2024-10-12 23:13:01]
评测

测评结果：WA
用时：5ms
内存：3956kb

查看

[2024-10-12 23:13:01]
提交

answer

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
	int n, m, mx = 0;
	cin >> n >> m;
	std::vector<int> a(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		mx = max(mx, a[i]);
	}
	ll L = 0, R = m * mx, ans;
	while(L <= R) {
		ll mid = L + R >> 1;
		int cnt = 0;
		std::vector<int> vis(n + 1, 0);
		for(int i = 1; i < n; i++) {
			if(ceil(1.0 * mid / (1.0 * a[i])) > vis[i]) 
				cnt += 2 * (ceil(1.0 * mid / (1.0 * a[i])) - vis[i]) - 1;
			vis[i + 1] += ceil(1.0 * mid / (1.0 * a[i])) - 1;
		}
		if(vis[n] < ceil(1.0 * mid / (1.0 * a[n]))) 
			cnt += 2 * (ceil(1.0 * mid / (1.0 * a[n])) - vis[n]) - 1;
		if(cnt <= m) ans = mid, L = mid + 1;
		else R = mid - 1;
	}
	cout << ans << '\n';
	return;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while(t--) solve();
	return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3632kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 5ms

memory: 3956kb

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:

140730953467620
140730953467620
6
6
20
3
3
14
1
4
4
5
2
6
6
4
24
4
45
15
15
2
4
4
0
2
10
10
2
7
24
28
1
4
3
3
4
12
6
4
2
5
5
2
0
7
48
3
3
0
24
12
12
42
3
30
8
2
0
0
2
2
2
2
5
3
3
3
3
3
5
5
6
6
28
28
28
32
4
0
2
4
4
4
14
5
8
1
1
6
14
3
12
12
5
5
18
16
6
14
2
6
12
12
904
904
19
150
780
792
120
120
176...

result:

wrong answer 1st numbers differ - expected: '0', found: '140730953467620'