Submission #7044

#TimeUsernameProblemLanguageResultExecution timeMemory
7044hongjun7쌍둥이 독수리 (GA7_twineagles)C++98
52 / 100
0 ms1088 KiB
#include <cstdio> typedef long long ll; #define putmin(a,b) ((a)>(b)?(a)=(b):1) ll calc(ll LH,ll S,ll D,ll L,ll B) { ll R = 0; if (S > LH*2) R += (S-LH*2)/(2*LH-L); S -= R*(2*LH-L); if (S > LH*2) R++,S -= (2*LH-L); if (S > LH) D += (++R)*B; else { D += R*B-LH; R++; if (D <= 0) return R; D += B; } if (D > LH*2) { R += (D-LH*2)/(2*LH-B); D -= (D-LH*2)/(2*LH-B)*(2*LH-B); } return R+1+(D>LH*2); } int main() { ll LH,S,D,L,B,res = 99999999999999999LL; scanf("%lld%lld%lld%lld%lld",&LH,&S,&D,&L,&B); putmin(res,calc(LH,S,D,L,B)); putmin(res,calc(LH,D,S,B,L)); printf("%lld",res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...