Codeforces #280 (Div. 2)D Vanya and Computer Game (二分 + 模拟)

D - Vanya and Computer Game
Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

Vanya and his friend Vova play a computer game where they need to destroy n monsters to pass a level. Vanya's character performs attack with frequency x hits per second and Vova's character performs attack with frequency y hits per second. Each character spends fixed time to raise a weapon and then he hits (the time to raise the weapon is 1 / x seconds for the first character and 1 / y seconds for the second one). The i-th monster dies after he receives ai hits.

Vanya and Vova wonder who makes the last hit on each monster. If Vanya and Vova make the last hit at the same time, we assume that both of them have made the last hit.

Input

The first line contains three integers n,x,y (1 ≤ n ≤ 1051 ≤ x, y ≤ 106) — the number of monsters, the frequency of Vanya's and Vova's attack, correspondingly.

Next n lines contain integers ai (1 ≤ ai ≤ 109) — the number of hits needed do destroy the i-th monster.

Output

Print n lines. In the i-th line print word "Vanya", if the last hit on the i-th monster was performed by Vanya, "Vova", if Vova performed the last hit, or "Both", if both boys performed it at the same time.

Sample Input

Input
4 3 2
1
2
3
4
Output
Vanya
Vova
Vanya
Both
Input
2 1 1
1
2
Output
Both
Both

Hint

In the first sample Vanya makes the first hit at time 1 / 3, Vova makes the second hit at time 1 / 2, Vanya makes the third hit at time 2 / 3, and both boys make the fourth and fifth hit simultaneously at the time 1.

In the second sample Vanya and Vova make the first and second hit simultaneously at time 1.

题意: Vanya每秒钟可以砍x刀,Vova每秒可以砍y刀, 有n次询问,给你一个怪兽的血量为ai,然后问你最后发出一刀是谁补的刀, 同时最后使出一刀,输出Both



思路一(模拟):我们只要一一枚举(x + y)中的数据,知道找到一个可以变为both的血量,将这个血量之前的都保存,然后只要用怪兽的血量模这个数据,输出之前取得结果即可

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int MAXN = 1e5 + 5;
const int MAXM = 2e6 + 5;
typedef long long LL;
int n, x, y;
LL A[MAXN];
int B[MAXM];
int main() {
	while(~scanf("%d%d%d", &n, &x, &y)) {
		memset(B, 0, sizeof(B));
		LL a = 0, b = 0, bs = 0;
		for(int i = 1; i <= (x + y) * 3; i ++) {
			if((a + 1LL) * (LL)y < (b + 1LL) * (LL)x) {
				B[i] = 1;
				a ++;
				continue;
			} else if((a + 1LL) * (LL)y == (b + 1LL) * (LL)x) {
				bs = i + 1;
				break;
			}
			b ++;
		}
		for(int i = 0; i < n; i ++) {
			scanf("%lld", &A[i]);
			if(A[i] % bs == 0 || A[i] % bs == bs - 1) {
				printf("Both\n");
			} else {
				puts(B[A[i] % bs] ? "Vanya" : "Vova");
			}
		}
	}
	return 0;
}


思路二(二分):
我们可以对最后干掉怪兽的时间进行二分枚举,很明显,这是一个积线函数,所以二分走起
首先是对第一个人每秒砍x刀,第二个每秒砍y刀进行处理,变为第一个人y秒砍1刀,第二个人x秒砍1刀。
然后二分时间
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 5;
const int MAXM = 2e6 + 5;
const LL INF = 1e15;

int n;
LL k, x, y;
bool C(LL m) {
	return  m / x + m / y >= k;
}
int main() {
	while(~scanf("%d%lld%lld", &n, &x, &y)) {
		for(int i = 0; i < n; i ++) {
			LL lb = -1, ub = INF;
			scanf("%lld", &k);
			while(ub - lb > 1) {
				LL mid = (ub + lb) >> 1;
				if(C(mid)) {
					ub = mid;
				} else {
					lb = mid;
				}
			}
			if(ub % x == 0 && ub % y == 0) {
				puts("Both");
			} else if(ub % x ==0) {
				puts("Vova");
			} else {
				puts("Vanya");
			}
		}
	}
	return 0;
}



  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值