QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #724710 | #9134. Building a Fence | xwh_Marvelous | WA | 0ms | 3660kb | C++14 | 687b | 2024-11-08 14:38:07 | 2024-11-08 14:38:08 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
//#define mod 1000000007
//#define N 200005
//#define pii pair<int,int>
//#define fi first
//#define se second
//#define rep(i,j,k) for(int i=j;i<=k;i++)
int t,n,m,s;
signed main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>t;
while(t--){
cin>>n>>m>>s;
if(n>m)swap(n,m);
if((n+m)%s==0){
cout<<2*(n+m)/s<<'\n';
}else if((n*2)%s==0){
cout<<(n*2)/2+(m*2+s-1)/s<<'\n';
}else if((m*2)%s==0){
if(n<s){
int u=s-n;
cout<<2+(m*2-u*2+s-1)/s<<'\n';
}else cout<<(n*2+s-1)/s+(m*2)/s<<'\n';
}else{
cout<<max(4ll,(n*2+m*2+s-1)/s)<<'\n';
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
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: 3660kb
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 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8 4 3 2 4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 10 5 4 3 2 4 4 2 4 4 4 4 4 4 4 4 4 4 4 4 12 6 4 4 3 2 4 4 4 2 4 4 4 4 4 4 4 4 4 4 14 7 5 4 4 3 2 4 4 4 4 2 4 4 4 4 4 4 4 4 16 8 6 4 4 4 3 2 4 4 4 4 4 2 4 4 4 4 4 4 18 9 6 5 4 4 4 3...
result:
wrong answer 24th numbers differ - expected: '3', found: '2'