QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#142782#6130. Plants vs. ZombiesNyansWA 101ms2772kbC++14593b2023-08-19 21:52:212023-08-19 21:52:25

Judging History

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

  • [2023-08-19 21:52:25]
  • 评测
  • 测评结果:WA
  • 用时:101ms
  • 内存:2772kb
  • [2023-08-19 21:52:21]
  • 提交

answer

#include <cstdio>
int T, n, a[100010];
long long m, b[100010];
long long check(long long up) {
	for (int i = 1; i <= n; ++i) b[i] = (up + a[i] - 1) / a[i] - 1;
	long long ans = n - 1;
	for (int i = 1; i <= n; ++i) if (b[i] > 0)
		ans += b[i] * 2, b[i + 1] -= b[i];
	return ans;
}
int main() {
	for (scanf("%d", &T); T--; ) {
		scanf("%d%lld", &n, &m);
		long long L = 0, R = m * 1e5, mid;
		for (int i = 1; i <= n; ++i) scanf("%d", a + i);
		while (L <= R) {
			mid = (L + R) / 2;
			if (check(mid) <= m)  L = mid + 1;
			else R = mid - 1;
		}
		printf("%lld\n", R);
	}
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 1548kb

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: 101ms
memory: 2772kb

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
20
3
2
14
1
4
-1
4
2
6
-1
4
32
3
30
12
-1
2
3
-1
6
4
6
-1
2
6
24
28
1
4
3
-1
4
10
6
4
2
10
-1
2
2
7
30
2
-1
1
16
8
-1
30
3
30
8
2
1
-1
4
-1
2
-1
5
2
-1
-1
-1
-1
5
-1
5
6
28
-1
-1
21
3
1
2
4
-1
-1
14
4
8
1
-1
6
14
3
9
-1
4
-1
10
12
6
8
2
6
12
-1
725
-1
17
132
680
588
110
-1
163
137121801367...

result:

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