QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #496907 | #9134. Building a Fence | ucup-team4361# | WA | 0ms | 3600kb | C++20 | 848b | 2024-07-28 16:54:05 | 2024-07-28 16:54:05 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
inline int Work(int a, int b, int c) {
if (a < b) swap(a, b);
if ((a + b) * 2 % c == 0 && (a + b) * 2 / c > 1) return (a + b) * 2 / c;
if (c >= a) {
if (c == a + b) return 2;
if (c == 2 * a || c == 2 * b) return 3;
if (2 * (c - a) == b || 2 * (c - b) == a) return 3;
return 4;
}
return (2 * (a + b) + c - 1) / c;
}
int main() {
int T = read();
while (T--) {
int a = read(), b = read(), c = read();
cout << Work(a, b, c) << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
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: 0ms
memory: 3592kb
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 4 4 2 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 12 6 4 3 4 2 4 4 4 3 4 4 4 4 4 4 4 4 4 4 14 7 5 4 3 4 2 4 4 4 4 3 4 4 4 4 4 4 4 4 16 8 6 4 4 3 4 2 4 4 4 4 4 3 4 4 4 4 4 4 18 9 6 5 4 3 3 4...
result:
wrong answer 105th numbers differ - expected: '4', found: '3'