QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#593931#9134. Building a Fencekongksora#WA 12ms3660kbC++14872b2024-09-27 17:07:072024-09-27 17:07:08

Judging History

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

  • [2024-09-27 17:07:08]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:3660kb
  • [2024-09-27 17:07:07]
  • 提交

answer

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int t;
int w,h,s,ans=0;
int main(){
	cin>>t;
	while(t--){
		cin>>w>>h>>s;
		ans=0;
		if(w<h) swap(w,h);
		if(w>=s&&h>=s){
			int tmp=2*(w+h);
			ans+=tmp/s+(tmp%s!=0);
			cout<<ans<<"\n";
			continue;
		}
		if(w>=s&&h<s){
			ans+=2;
			int tmp=s-h;
			if(w>=2*tmp){
				if(w==2*tmp) ans+=w/s+(w%s!=0);
				else{
					int num=w-2*tmp;
					ans+=num/s+(num%s!=0);
					num=s-num%s;
					int o1=w-num;
					ans+=o1/s+(o1%s!=0);
				}
			}
			else{
				int num=w-tmp;
				if(num*2==s) ans++;
				else ans+=2;
			}
			cout<<ans<<"\n";
			continue;
		}
		if(w<s&&h<s){
			if(w+h==s) ans+=2;
			else{
				if(2*w==s||2*h==s) ans+=3;
				else{
					if(2*w+h==2*s||2*h+w==2*s) ans+=3;
					else ans+=4;
				}
			}
		}
		cout<<ans<<"\n";
	}
	return 0;
}

详细

Test #1:

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

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

result:

wrong answer 62nd numbers differ - expected: '5', found: '4'