Problem

You are waiting in a long line to get a haircut at a trendy barber shop. 
The shop has B barbers on duty, and they are numbered 1 through B.
It always takes the kth barber exactly Mk minutes to cut a customer's hair,
and a barber can only cut one customer's hair at a time. Once a barber
finishes cutting hair, he is immediately free to help another customer. While the shop is open, the customer at the head of the queue always goes
to the lowest-numbered barber who is available. When no barber is available,
that customer waits until at least one becomes available. You are the Nth person in line, and the shop has just opened. Which barber
will cut your hair? Input The first line of the input gives the number of test cases, T. T test cases
follow; each consists of two lines. The first contains two space-separated
integers B and N -- the number of barbers and your place in line.
The customer at the head of the line is number 1, the next one is number 2,
and so on. The second line contains M1, M2, ..., MB. Output For each test case, output one line containing "Case #x: y",
where x is the test case number (starting from 1) and y is the number of the barber who will cut your hair. Limits 1 ≤ T ≤ 100.
1 ≤ N ≤ 109.
Small dataset 1 ≤ B ≤ 5.
1 ≤ Mk ≤ 25.
Large dataset 1 ≤ B ≤ 1000.
1 ≤ Mk ≤ 100000.
Sample Input Output 3
2 4
10 5
3 12
7 7 7
3 8
4 2 1 Case #1: 1
Case #2: 3
Case #3: 1 In Case #1, you are the fourth person in line, and barbers 1 and 2 take 10 and 5 minutes,
respectively, to cut hair. When the shop opens, the first customer immediately has the
choice of barbers 1 and 2, and she will choose the lowest-numbered barber, 1. The second
customer will immediately be served by barber 2. The third customer will wait since there
are no more free barbers. After 5 minutes, barber 2 will finish cutting the second
customer's hair, and will serve the third customer. After 10 minutes, both barbers 1 and
2 will finish; you are next in line, and you will have the choice of barbers 1 and 2, and will choose 1.

  

题目很简短,也很好理解。

如果用最朴素的方法,不管是暴力还是用 STL 里的 SET ,都需要从 1 遍历到 N (10^9) 那么肯定是不行的

我想到了既然人数那么多说不定有规律可循,过了小数据, TLE 了大数据... 【姿势不对啊

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <vector>
#include <algorithm>
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
#define MOD 1000000007
#define pi acos(-1.0) using namespace std; typedef long long ll ;
typedef unsigned long long ull ;
typedef unsigned int uint ;
typedef unsigned char uchar ; template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}
template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;} const double eps = 1e- ;
const int M = * ;
const ll P = 10000000097ll ;
const int MAXN = ;
const int INF = 0x3f3f3f3f ; int B, N;
int a[], cur[];
int ans[]; int main(){
std::ios::sync_with_stdio(false);
int i, j, t, k, u, v, numCase = ; ofstream fout ("B-large-practice.out");
ifstream fin ("B-large-practice.in"); fin >> t;
int T = t;
for (T = ; T <= t; ++T) {
cout << T << endl;
fin >> B >> N;
for (i = ; i <= B; ++i) {
fin >> a[i];
}
memset (cur, , sizeof (cur));
int flag = ;
int sum = ;
for (i = ; i < N; ++i) {
cur[flag] += a[flag];
ans[sum++] = flag;
int MIN = INF;
for (j = ; j <= B; ++j) {
if (cur[j] < MIN) {
MIN = cur[j];
flag = j;
}
}
for (j = ; j < B; ++j) {
if (cur[j] ^ cur[j + ]) {
break;
}
}
if (j == B) {
break;
}
}
if (i == N) {
flag = ;
for (i = ; i <= B; ++i) {
if (cur[i] < cur[flag]) {
flag = i;
}
}
} else {
if (N % sum == ) {
flag = ans[sum - ];
} else {
flag = ans[N % sum - ];
}
} fout << "Case #" << ++numCase << ": " << flag << endl;
} return ;
}

Naive Solution

正确解法如下:

对于已知的B 位理发师,我们可以知道,在第 t 时间单位的时候,可以有 number 个数的人已经理发

因为我们要求的是第 n 个人是哪个理发师给他理发,那么从这里开始想下去

可以考虑对时间进行二分

找到第 t 时间单位,在那个时间点保证第 n 个人理发完毕

好,那么我们有个这个时间 t

接下来就是找,是第几个理发师理的头发

这时候需要一个新的变量 tt = t - 1, 表示在前一秒,我们可以在这里进行模拟

如果 tt % a[i] == 0, 意思就是如果在 tt 的时间单位时第 i 个理发师可以理发,那么作累加

直到刚刚好某个理发师碰到 第 n 个人的时候 break 输出答案即可。

Source Code:

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <vector>
#include <algorithm>
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
#define MOD 1000000007
#define pi acos(-1.0) using namespace std; typedef long long ll ;
typedef unsigned long long ull ;
typedef unsigned int uint ;
typedef unsigned char uchar ; template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}
template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;} const double eps = 1e- ;
const int M = ;
const ll P = 10000000097ll ;
const int INF = 0x3f3f3f3f ;
const int MAX_N = ;
const int MAXSIZE = ; const int MK = ; const int N = ; int b; ll n, a[N]; ll cal(ll n) { //求出[0,n - 1] 时间内所有理发师理发的总人数
ll ret = ;
for (int i = ; i < b; ++i) {
ret += (n - + a[i]) / a[i]; //n - 1 表示(n - 1) 的时间, 表达式表示第i个理发师在前(n-1)时间内理发的人数
}
return ret;
} int main() {
ofstream fout ("B-large-practice.out");
ifstream fin ("B-large-practice.in"); int T, i, j, k;
fin >> T;
while (T--) {
fin >> b >> n;
for (i = ; i < b; ++i) {
fin >> a[i];
}
ll l = , r = n * MK;
while (l < r) {
ll mid = l + r >> ;
if (cal(mid) < n) {
l = mid + ;
} else {
r = mid;
}
}
int last = cal(l - ), ans = ;
for (i = ; i < b; ++i) {
if ((l - ) % a[i] == ) {
++last;
if (last == n) {
ans = i + ;
break;
}
}
}
static int numCase = ;
fout << "Case #" << ++numCase << ": " << ans << endl;
}
return ;
}

Google Code Jam Round 1A 2015 Problem B. Haircut 二分的更多相关文章

  1. Google Code Jam Round 1A 2015 解题报告

    题目链接:https://code.google.com/codejam/contest/4224486/ Problem A. Mushroom Monster 这题题意就是,有N个时间点,每个时间 ...

  2. Google Code Jam Round 1C 2015 Problem A. Brattleship

    Problem You're about to play a simplified "battleship" game with your little brother. The ...

  3. [Google Code Jam (Round 1A 2008) ] A. Minimum Scalar Product

    Problem A. Minimum Scalar Product   This contest is open for practice. You can try every problem as ...

  4. 【二分答案】Google Code Jam Round 1A 2018

    题意:有R个机器人,去买B件商品,有C个收银员,每个收银员有能处理的商品数量上限mi,处理单件商品所需的时间si,以及最后的装袋时间pi. 每个收银员最多只能对应一个机器人,每个机器人也最多只能对应一 ...

  5. 【贪心】Google Code Jam Round 1A 2018 Waffle Choppers

    题意:给你一个矩阵,有些点是黑的,让你横切h刀,纵切v刀,问你是否能让切出的所有子矩阵的黑点数量相等. 设黑点总数为sum,sum必须能整除(h+1),进而sum/(h+1)必须能整除(v+1). 先 ...

  6. Google Code Jam 2014 资格赛:Problem B. Cookie Clicker Alpha

    Introduction Cookie Clicker is a Javascript game by Orteil, where players click on a picture of a gi ...

  7. Google Code Jam 2014 资格赛:Problem D. Deceitful War

    This problem is the hardest problem to understand in this round. If you are new to Code Jam, you sho ...

  8. [刷题]Google Code Jam 2017 - Round1 C Problem A. Ample Syrup

    https://code.google.com/codejam/contest/3274486/dashboard Problem The kitchen at the Infinite House ...

  9. Google Code Jam 2014 资格赛:Problem C. Minesweeper Master

    Problem Minesweeper is a computer game that became popular in the 1980s, and is still included in so ...

随机推荐

  1. c风格字符串函数

    十一.C 风格字符串  1)字符串操作  strcpy(p, p1) 复制字符串  strncpy(p, p1, n) 复制指定长度字符串  strcat(p, p1) 附加字符串  strncat( ...

  2. 将默认首页设置成index.do的方法

    变态欺骗法,今天csdn一个前辈的,学习了,公司服务器是weblogic的,也可以欺骗. 但是我又非常迫切.非常盼望.非常渴望使用index.do做首页,怎么办? Tomcat中用一段注释: When ...

  3. BZOJ 3038 上帝造题的七分钟2 (并查集+树状数组)

    题解:同 BZOJ 3211 花神游历各国,需要注意的是需要开long long,还有左右节点需要注意一下. #include <cstdio> #include <cmath> ...

  4. linux 多线程编程笔记

    一, 线程基础知识 1,线程的概念 线程是进程的一个实体,是CPU调度和分派的基本单位,它是比进程更小的能独立运行的基本单位.线程自己基本上不拥有系统资源,只拥有一点在运行 中必不可少的资源(如程序计 ...

  5. 读取jar包里面的文件

    一.最近做项目的时候,师兄要求读取jar包里面的java文件.在网上查了各种文件以后,终于完成了,在这里和各位朋友分享一下. (一)找到jar包所在的位置. String path="XXX ...

  6. JavaSE学习总结第01天_Java概述

      01.01 计算机概述 计算机(Computer):全称电子计算机,俗称电脑. 是一种能够按照程序运行,自动.高速处理海量数据的现代化智能电子设备. 由硬件和软件所组成,没有安装任何软件的计算机称 ...

  7. 一种解决h5页面背景音乐不能自动播放的方案

    场景:微信.浏览器.App 普通解决方案:采用audio标签的autoplay属性 现象: 大部分IOS系统和少部分Android微信不支持自动播放 $解决方案:监听WeixinJSBridgeRea ...

  8. ThinkPHP第六天(正则表达式)

    1.正则表达式:原子 ①a-z,A-Z,0-9,_ ②用(abc)圆括号括起来的单元符号,表示括号里面的作为一个完整的组合,必须完成匹配,不被拆分来 ③用方括号括起来[abc][^abc]称之为原子表 ...

  9. nginx启动

    查看nginx的进程 ps -ef | grep nginx 重启nginx的3种办法1.service nginx restart2.改了配置文件让其生效办法 nginx -s reload3.到n ...

  10. MacOS + Linux + Nginx

    Asp.Net Core 发布和部署( MacOS + Linux + Nginx ) 前言 在上篇文章中,主要介绍了 Dotnet Core Run 命令,这篇文章主要是讲解如何在Linux中,对 ...