1010-Bragging Dice
题目大意:
两名玩家杯子里有数量相同的骰子,点数双方都已知,双方轮流声明,在特殊规则下,判断先手玩家是否会赢
思路:
可以发现,除非两个杯子都触发规则3,杯子里视为没有任何骰子,否则只要先手的人声明最多数量的点数的骰子就必赢,则只要判断是否两个杯子都触发规则3即可
#include <iostream>
#include <string.h>
#include <algorithm>
#pragma warning(disable:4996)
using namespace std;
int cup[3][7], sum[7];
int main() {
int t;
cin >> t;
while (t--) {
memset(cup, 0, sizeof(cup));
memset(sum, 0, sizeof(sum));
int n;
scanf("%d", &n);
for (int j = 1; j <= 2; j++) {
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
cup[j][temp]++;
sum[temp]++;
}
}
bool if3[3] = { 0 }; //是否符合规则3
if (n <= 6) {
for (int i = 1; i <= 2; i++) {
bool flag = 1;
for (int j = 1; j <= 6; j++) {
if (cup[i][j] > 1) {
flag = 0;
break;
}
}
if (flag) if3[i] = 1;
}
}
if (if3[1] && if3[2]) {
cout << "Just a game of chance." << endl;
continue;
}
else {
cout << "Win!" << endl;
continue;
}
//for (int i = 1; i <= 2; i++) {
// if (if3[i]) { //清零
// for (int j = 1; j <= 6; j++) {
// sum[j] -= cup[i][j];
// cup[i][j] = 0;
// }
// }
// else { //否则看是否符合规则2
// for (int j = 1; j <= 6; j++) {
// if (cup[i][j] == n) {
// cup[i][j]++;
// sum[j]++;
// break;
// }
// }
// }
//}
}
return 0;
}
1012-Buy Figurines
题目大意:
若干个人排队买东西,每个人选择当前队伍人数最少且队伍标号尽量靠前的排队,求最后一个人买完的时间
思路:
模拟即可,注意开long long
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma warning(disable:4996)
#define ll long long
using namespace std;
struct node {
ll l, r;
}peo[200005];
bool cmp(node a, node b) {
return a.l < b.l;
}
int main() {
int t, n, m, a, s;
cin >> t;
while (t--) {
scanf("%d %d", &n, &m);
vector<queue<node>> qs(m);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &a, &s);
peo[i].l = a;
peo[i].r = a + s;
}
sort(peo + 1, peo + 1 + n, cmp); //左端点递增排序
ll ans = 0;
for (int i = 1; i <= n; i++) { //遍历所有区间(顾客)
//最短队列的元素个数 最短队列下标
int minSize = n + 1, index = 0;
bool flag = 0;
for (int j = 0; j < m; j++) { //遍历所有m个队列
//更新队列,即弹出以消费完的顾客
while (!qs[j].empty() && peo[i].l >= qs[j].front().r) {
qs[j].pop();
}
//若当前队列没人排队,则可直接插入(因为必定为人最少且最靠前的队列)
if (qs[j].size() == 0) {
qs[j].push(peo[i]);
ans = max(ans, peo[i].r);
flag = 1;
break;
}
//否则更新minSize和index,找出最少人排队且尽量靠前的队列
if (qs[j].size() < minSize) {
minSize = qs[j].size();
index = j;
}
}
/*若当前peo[i]还没有插入,说明要插入的队列一定还有元素,
且要插入的元素紧跟队列最后*/
if (!flag) {
s = peo[i].r - peo[i].l;
peo[i].l = qs[index].back().r;
peo[i].r = peo[i].l + s;
qs[index].push(peo[i]);
ans = max(ans, peo[i].r);
}
}
cout << ans << endl;
}
return 0;
}