Submission #6612

#	Time	Username	Problem	Language	Result	Execution time	Memory
6612		Qwaz	쌍둥이 독수리 (GA7_twineagles)	C++98	100 / 100	0 ms	1088 KiB

twineagles

#include <cstdio>
#include <algorithm>

using namespace std;
typedef long long ll;
const ll INF = 1234567890LL;

ll attack, sa, sb, ra, rb;

void solve(){
	ll res = INF * INF;

	int i;
	for(i = 0; i<2; i++){
		ll day = max((sa-ra-1)/(2*attack-ra), 0LL);

		ll remain = sb + rb*day;
		if(sa + ra*day <= 2*attack*(day+1) - attack) remain -= attack;

		if(remain > 0){
			day++;
			remain += rb;

			day += (remain-rb-1)/(2*attack-rb);
		}

		res = min(res, day);

		swap(sa, sb);
		swap(ra, rb);
	}

	printf("%lld\n", res+1);
}

int main(){
	scanf("%d%d%d%d%d", &attack, &sa, &sb, &ra, &rb);

	solve();

	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 9 / 9
• Subtask 4: 14 / 14
• Subtask 5: 48 / 48