QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #495644 | #9134. Building a Fence | ucup-team191# | WA | 2ms | 3616kb | C++14 | 1.0kb | 2024-07-27 22:46:20 | 2024-07-27 22:46:23 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef pair <int, int> pi;
int t, a, b, s;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> t;
while (t--) {
cin >> a >> b >> s;
if (a > b) swap(a, b);
if (s < a) {
cout << (2 * (a + b) + s - 1) / s << '\n';
} else if (b < s) {
if (a + b == s) {
cout << 2 << '\n';
} else if (s == 2 * a || s == 2 * b || 2 * s == 2 * a + b || 2 * s == a + 2 * b || 3 * s == 2 * (a + b)) {
cout << 3 << '\n';
} else {
cout << 4 << '\n';
}
} else {
if (2 * s == 2 * a + b) {
cout << 3 << '\n';
} else if (s == 2 * a || a + b - s >= s) {
cout << (2 * (a + b) + s - 1) / s << '\n';
} else {
cout << (2 * (a + b) + s - 1) / s + 1 << '\n';
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
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: 3616kb
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 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 6 3 2 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8 4 4 2 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 10 5 3 4 2 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 12 6 4 4 4 2 4 4 4 3 4 4 4 4 4 4 4 4 4 4 14 7 5 3 4 4 2 4 4 4 4 3 4 4 4 4 4 4 4 4 16 8 6 4 5 4 4 2 4 4 4 4 4 3 4 4 4 4 4 4 18 9 6 5 3 4 4 4...
result:
wrong answer 63rd numbers differ - expected: '4', found: '3'