QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#142781#6130. Plants vs. ZombiesNyansWA 71ms2788kbC++14636b2023-08-19 21:51:032023-08-19 21:51:06

Judging History

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

  • [2023-08-19 21:51:06]
  • 评测
  • 测评结果:WA
  • 用时:71ms
  • 内存:2788kb
  • [2023-08-19 21:51:03]
  • 提交

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 = 1e9, R = 1e9, mid;
		for (int i = 1; i <= n; ++i) scanf("%d", a + i), L > a[i]? L = a[i]: 0;
		R = L + m / 2 + 1;
		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: 71ms
memory: 2788kb

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
12
3
2
9
1
4
0
4
2
6
0
4
12
3
15
11
0
2
3
0
6
4
6
2
2
6
12
12
1
4
3
0
4
8
6
4
2
7
0
2
2
7
16
2
1
1
11
8
0
15
3
11
7
2
1
0
4
2
2
0
5
2
2
0
0
1
5
1
5
5
12
3
0
14
3
1
2
4
2
0
10
4
8
1
0
6
10
3
9
1
4
0
10
12
6
8
2
6
7
1
601
10
17
132
582
250
110
0
163
5910826
500000100001
16561021906

result:

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