QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#39730#2944. Transporting SpaghettiLangdao_ZhangWA 3ms3692kbC++829b2022-07-13 09:19:432022-07-13 09:19:45

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-07-13 09:19:45]
  • 评测
  • 测评结果:WA
  • 用时:3ms
  • 内存:3692kb
  • [2022-07-13 09:19:43]
  • 提交

answer

#include<iostream>
#include<algorithm>

#define lint int64_t

#define gcd __gcd

#define inf 998244353

using
		namespace
					std;

lint a,b,c,d;
lint x,y;

/*

ax-by=d
by>=c
by<=ax

*/

bool judge(){
	
	//31 13 50 28
	
	if(a*x-d<0) return false;
	
	if((a*x-d)%b) return false;
	
	y=(a*x-d)/b;
	
	if(b*y>a*x) return false;
	
	return b*y>=c;
}

signed main(){
	
	cin>>a>>b>>c>>d;
	
	for(x=0;x<200;x++){
		
		if(judge()){
			
			goto print;
		}
	}
	
	x=y=inf;
	
print:
	
	if(x==inf){
		
		printf("No solution.\n");
	}
	else{
		
		printf("We need %lld truck",x);
		if(x!=1) putchar('s');
		printf(" and %lld boat",y);
		if(y!=1) putchar('s');
		printf(".\n");
	}
	
end:
	return EOF+1;
}
/*

31 13 50 28
100 20 30 10
1 1 1 100

100 1 99 1
100 1 23 99
*/

详细

Test #1:

score: 100
Accepted
time: 3ms
memory: 3656kb

input:

31 13 50 28

output:

We need 3 trucks and 5 boats.

result:

ok single line: 'We need 3 trucks and 5 boats.'

Test #2:

score: 0
Accepted
time: 2ms
memory: 3548kb

input:

100 20 30 10

output:

No solution.

result:

ok single line: 'No solution.'

Test #3:

score: 0
Accepted
time: 2ms
memory: 3596kb

input:

1 1 1 100

output:

We need 101 trucks and 1 boat.

result:

ok single line: 'We need 101 trucks and 1 boat.'

Test #4:

score: 0
Accepted
time: 2ms
memory: 3572kb

input:

20 5 5 15

output:

We need 1 truck and 1 boat.

result:

ok single line: 'We need 1 truck and 1 boat.'

Test #5:

score: 0
Accepted
time: 3ms
memory: 3684kb

input:

100 20 100 100

output:

We need 2 trucks and 5 boats.

result:

ok single line: 'We need 2 trucks and 5 boats.'

Test #6:

score: 0
Accepted
time: 2ms
memory: 3588kb

input:

1 1 0 0

output:

We need 0 trucks and 0 boats.

result:

ok single line: 'We need 0 trucks and 0 boats.'

Test #7:

score: 0
Accepted
time: 2ms
memory: 3644kb

input:

1 5 10 50

output:

We need 60 trucks and 2 boats.

result:

ok single line: 'We need 60 trucks and 2 boats.'

Test #8:

score: 0
Accepted
time: 3ms
memory: 3692kb

input:

100 1 100 100

output:

We need 2 trucks and 100 boats.

result:

ok single line: 'We need 2 trucks and 100 boats.'

Test #9:

score: -100
Wrong Answer
time: 2ms
memory: 3412kb

input:

1 1 100 100

output:

No solution.

result:

wrong answer 1st lines differ - expected: 'We need 200 trucks and 100 boats.', found: 'No solution.'