QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#587479#9134. Building a FencexydCatGirl#WA 2ms3696kbC++14722b2024-09-24 20:10:152024-09-24 20:10:19

Judging History

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

  • [2024-09-24 20:10:19]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3696kb
  • [2024-09-24 20:10:15]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

int T, w, h, s;

int calc2(int s, int w, int h) {
	if (w + h == s) return 2;
	if (2 * w == s || 2 * h == s) return 3;
	if (2 * w + h == s || 2 * h + w == s || 2 * (h + w) == 3 * s) return 3;
	return 4;
}

int calc(int s, int w, int h) {
	if (w > h) std::swap(w, h);
	if (s <= w) return (2 * (w + h) - 1) / s + 1;
	if (s >= h) return calc2(s, w, h);
	if ((s - w) * 2 <= h) return (2 * (w + h) - 1) / s + 1;
	return calc2(s, w, h);
}

void solve() {
	std::cin >> w >> h >> s;
	std::cout << calc(s, w, h) << "\n";
}

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

	std::cin >> T;
	while (T--) solve();

	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

7
7 9 4
1 1 2
1 1 4
4 6 2
3 3 5
10 6 4
1 11 5

output:

8
2
4
10
4
8
5

result:

ok 7 numbers

Test #2:

score: -100
Wrong Answer
time: 2ms
memory: 3696kb

input:

8000
1 1 1
1 1 2
1 1 3
1 1 4
1 1 5
1 1 6
1 1 7
1 1 8
1 1 9
1 1 10
1 1 11
1 1 12
1 1 13
1 1 14
1 1 15
1 1 16
1 1 17
1 1 18
1 1 19
1 1 20
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1 2 6
1 2 7
1 2 8
1 2 9
1 2 10
1 2 11
1 2 12
1 2 13
1 2 14
1 2 15
1 2 16
1 2 17
1 2 18
1 2 19
1 2 20
1 3 1
1 3 2
1 3 3
1 3 4
1 3 5
1 3...

output:

4
2
3
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
6
3
2
3
3
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
8
4
4
2
3
3
3
4
4
4
4
4
4
4
4
4
4
4
4
4
10
5
4
4
2
3
4
3
3
4
4
4
4
4
4
4
4
4
4
4
12
6
4
3
4
2
3
4
4
3
3
4
4
4
4
4
4
4
4
4
14
7
5
4
4
4
2
3
4
4
4
3
3
4
4
4
4
4
4
4
16
8
6
4
4
4
4
2
3
4
4
4
4
3
3
4
4
4
4
4
18
9
6
5
4
3
4
4...

result:

wrong answer 3rd numbers differ - expected: '4', found: '3'