QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #500731 | #9134. Building a Fence | Liberty12619 | WA | 1ms | 3704kb | C++20 | 860b | 2024-08-01 19:10:25 | 2024-08-01 19:10:25 |
Judging History
answer
#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int,int> PII;
const int N = 510,M=2e4+10,mod = 998244353,INF = 1e18;
void solve()
{
int w,h,s;
cin>>w>>h>>s;
if(h>w) swap(h,w);
if(s-h%s>w)
{
if(2*w==s) cout<<3<<"\n";
else cout<<4<<"\n";
return;
}
int ans = (2*(w+h)+s-1)/s;
if(h%s==0)
{
cout<<ans<<"\n";
return;
}
if(2*w<3*s-2*(h%s))
{
ans++;
if((s-h%s==w)||(2*h+w==2*s)||(2*w+h==2*s))ans--;
}
cout<<ans<<"\n";
}
signed main()
{
int T=1;
cin.tie(0)->sync_with_stdio(false);
//init();
cin>>T;
while(T--)
{
solve();
}
return 0;
}
/*
7
7 9 4
1 1 2
1 1 4
4 6 2
3 3 5
10 6 4
1 11 5
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3704kb
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: 1ms
memory: 3568kb
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 4 4 2 4 4 4 4 3 4 4 4 4 4 4 4 4 16 8 6 4 4 4 4 2 4 4 4 4 4 3 4 4 4 4 4 4 18 9 6 5 4 3 4 4...
result:
wrong answer 866th numbers differ - expected: '3', found: '4'