QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #496728 | #9134. Building a Fence | ucup-team4361# | WA | 3ms | 3648kb | C++14 | 762b | 2024-07-28 15:24:53 | 2024-07-28 15:24:55 |
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 ask(int a,int b)
{
if(b==2*a) return 1;
if(b>=a) return 2;
return (2*a+b-1)/b;
}
inline int Work(int a,int b,int c)
{
if(a<b) swap(a,b);
if(c>=a)
{
if(c==a+b) return 2;
return 4;
}
if(c<b) return (2*(a+b)+c-1)/c;
if(c==2*b) return 1+ask(a,c);
int res=c-b;
if(2*res<=a) return (2*(a+b)+c-1)/c;
return 2+ask(a-res,c);
}
int main()
{
int T=read();
while(T--)
{
int a=read(), b=read(), c=read();
cout<<Work(a,b,c)<<endl;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
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: 3ms
memory: 3588kb
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 4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8 4 4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 10 5 4 4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 12 6 4 3 4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 14 7 5 4 4 4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 16 8 6 4 4 4 4 2 4 4 4 4 4 4 4 4 4 4 4 4 18 9 6 5 4 3 4 4...
result:
wrong answer 22nd numbers differ - expected: '3', found: '4'