QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#546228#9134. Building a Fencepengpeng_fudanWA 1ms3624kbC++20672b2024-09-03 21:15:362024-09-03 21:15:37

Judging History

你现在查看的是最新测评结果

  • [2024-09-03 21:15:37]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3624kb
  • [2024-09-03 21:15:36]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
using ll=long long;
void solve() {
    int w,h,s;
    cin>>w>>h>>s;
    if(w>h) swap(w,h);
    if(w>=s)    {cout<<2*(h+w)/s+((2*(h+w))%s?1:0)<<'\n';return ;}
    if(h<=s)    {
        if(w+h==s)  cout<<"2\n";
        else if(2*(w+h)==3*s)   cout<<"3\n";
        else cout<<"4\n";
        return ;
    }
    if(2*w+h>=s) {cout<<2*(h+w)/s+((2*(h+w))%s?1:0)<<'\n';return ;}
    if(2*(w+h)==3*s)    cout<<'3\n';
    else cout<<"4\n";
    return ;  
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0);
    int _ = 1;
    cin >> _;
    while(_--) solve();
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3552kb

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: 3624kb

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
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
3
4
2
4
4
4
4
4
4
4
4
4
4
4
4
4
16
8
6
4
4
3
4
2
4
4
4
4
4
4
4
4
4
4
4
4
18
9
6
5
4
3
3
4...

result:

wrong answer 24th numbers differ - expected: '3', found: '4'