QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#656975	#6130. Plants vs. Zombies	kazimiyuuka	WA	110ms	4724kb	C++20	1.2kb	2024-10-19 13:58:04	2024-10-19 13:58:04

Judging History

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

[2024-10-19 13:58:04]
评测

测评结果：WA
用时：110ms
内存：4724kb

查看

[2024-10-19 13:58:04]
提交

answer

#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <random>
#include <cstdlib>
#include <numeric>
#include <functional>
#include <queue>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;

void slove()
{
	ll n, m;
	cin >> n >> m;

	vector<ll> data(n + 1);
	vector<ll> tim(n + 2);
	for (int i = 1; i <= n; i++) cin >> data[i];
	
	ll l = 1, r = (ll)1e5 * m;
	function<ll(ll)> check = [&](ll low) {
		for (int i = 1; i <= n; i++) tim[i] = (low + data[i] - 1) / data[i];
		ll ned = 0;
		for (int i = 1; i <= n; i++) {
			ned++;
			tim[i]--;
			if (tim[i] <= 0) continue;
			ll tmp = min(tim[i], tim[i + 1]);
			ned += tmp * 2LL;
			tim[i] -= tmp;
			tim[i + 1] -= tmp;
			ned += tim[i] * 2LL;
		}
		return ned;
	};
	check(4);
	while (l < r) {
		ll mid = (l + r) / 2 + 1;

		if (check(mid) > m) 
			r = mid - 1;
		else 
			l = mid;
	}

	cout << l << endl;
	
}

int main()
{
	//freopen("out.txt", "w", stdout);
	//freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false);

	cin.tie(0);
	cout.tie(0);

	int cnt = 1;
	cin >> cnt;

	while (cnt--)
	{
		slove();
	}
};

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3728kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 110ms

memory: 4724kb

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:

1
1
4
6
18
3
2
12
1
4
1
4
2
6
1
2
24
3
30
10
1
2
3
1
1
2
6
1
1
6
24
28
1
3
3
1
4
10
6
4
1
5
1
1
1
7
30
2
1
1
16
8
1
30
2
25
4
2
1
1
2
1
2
1
5
2
1
1
1
1
5
1
4
4
28
1
1
21
3
1
2
4
1
1
14
4
6
1
1
5
12
3
8
1
4
1
10
12
5
6
1
6
9
1
725
1
17
132
676
588
110
1
163
13712180136795612
1000000000000
16561021906

result:

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