C(clang 3.9) 解法, 执行用时: 226ms, 内存消耗: 1016K, 提交时间: 2020-01-22 14:26:11

#include<stdio.h>
int main()
{
	int t;
	scanf("%d",&t);
	for(int i=0;i<t;i++)
	{
        long long hp1,hp2,atk1,atk2,m,a=0;
		scanf("%d%d%d%d%d",&hp1,&hp2,&atk1,&atk2,&m);
		if(hp1%atk2!=0) a=1;
		a+=hp1/atk2;
		if(hp2<=atk1) puts("Yes");
		else
		if(a*atk1>=hp2+(a-1)*m)
		puts("Yes");
		else
		puts("No");
	}
	return 0;
 } 

C++14(g++5.4) 解法, 执行用时: 159ms, 内存消耗: 8672K, 提交时间: 2020-03-31 21:24:50

#include<cstdio>
int T,hp1,hp2,at1,at2,m;
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d%d%d",&hp1,&hp2,&at1,&at2,&m);
        if(hp2<=at1)puts("Yes");
        else if(m>=at1)puts("No");
        else if((hp2-at1-1)/(at1-m)<(hp1-1)/at2)puts("Yes");
        else puts("No");
    }
return 0;
}

C++11(clang++ 3.9) 解法, 执行用时: 548ms, 内存消耗: 10784K, 提交时间: 2020-08-01 00:23:09

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
	ll t,a,b,c,d,e;
	cin>>t;
	while(t--)
	{
		cin>>a>>b>>c>>d>>e;
		if(b<=c)cout<<"Yes"<<endl;
		else if(e>=c)cout<<"No"<<endl;
		else if((b-c-1)/(c-e)<(a-1)/d)cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	    
	} 
}

Python3(3.5.2) 解法, 执行用时: 1627ms, 内存消耗: 6976K, 提交时间: 2020-04-09 19:42:13

for ___ in [0] * int(input()):
    h1, h2, a1, a2, m = map(int, input().split())
    suc = False
    if a1 >= h2:
        suc = True
    if (h1 + a2 - 1) // a2 * (a1 - m) + m >= h2:
        suc = True
    print('Yes' if suc else 'No')