Google Code Jam 2015 Round 1A: Problem B. Haircut

蒟蒻看到这一题只想到了模拟==看了analysis后才恍然大悟竟然是二分==其实单调性也挺明显的额肯定是时间越长serve的人越多。><

首先,对于每一个时间点time,可以求出来此刻serve的人数。num=sum(time/m[i]+1),+1是因为time和m[i]不能整除时,time时刻还在serve一个人,time和m[i]可以整除时,time时刻即将serve一个人。所以此时求出的sum是个上界,会比N大。

二分的上界是max(m[i])*N,即只有一个barber而且serve时间最长的case。注意二分的上界最大可以是1e15,所以计算sum时要用long long存,我之前脑残一看N才是1e9,然后就用int存sum了==然后WA了好久。==

求出time后,官方的analysis是说当前时刻会同时serve多个人,所以需要先相减求出该时刻serve的总人数然后遍历m[i]看哪个正好到N就是ans。

后来偷偷滴看了dreamoon男神的代码后发现,也可以直接遍历m[i],保存恰好整除的barber,然后ans就是第倒数sum-N个。

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<stdlib.h>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<ctype.h>
#include<map>
#include<time.h>
#include<bitset>
#include<set>
#include<list>
using namespace std;
//gcj R1A pro B 

const int maxn=1010;
int T;
int N;
int m[maxn];
int B;
int upbound;
int ans;
long long servednumber(long long time)//因为time是从1e15开始二分的,所以返回int会溢出
{
    if(time<0)
    {
        return 0;
    }
    long long ret=0;
    for(int i=1;i<=B;i++)
    {
        ret+=time/m[i]+1;//what if %m[i]==0?
    }
    return ret;
}
long long binarysearch()
{
    long long l=0;
    long long r=(long long)upbound*(long long)N;
    while(l<r)
    {
        long long mid=(l+r)/2;
        if(servednumber(mid)<N)
        {
            l=mid+1;
        }
        else
        {
            r=mid;
        }
    }
    //cout<<"time: "<<l<<endl;
   // cout<<l<<" "<<r<<endl;
    return min(l,r);
    //return r;
}
void solve()
{
    long long time=binarysearch();
//    long long sum=0; //it's also fine
//    vector<int>d;
//    for(int i=1;i<=B;i++)
//    {
//        sum+=time/m[i]+1;
//        if(time%m[i]==0)
//        {
//            d.push_back(i);
//        }
//    }
    //cout<<sum<<" "<<N<<endl;
//ans=d[d.size()-(sum-N)-1];
    int servedbefore=servednumber(time-1);
    int servednow=N-servedbefore;
    for(int i=1;i<=B;i++)
    {
        if(time%m[i]==0)
        {
            servednow--;
            if(servednow==0)
            {
                ans=i;
                break;
            }
            else if(servednow<0)
            {
                ans=i;
                break;
            }
        }
    }
}
int main()
{

    //freopen("input.txt","r",stdin);
    freopen("B-large-practice.in","r",stdin);
    freopen("out1.txt","w",stdout);
    scanf("%d",&T);
    for(int ca=1;ca<=T;ca++)
    {
        memset(m,0,sizeof(m));
        upbound=0;
        ans=0;
        scanf("%d %d",&B,&N);
        for(int i=1;i<=B;i++)
        {
            scanf("%d",&m[i]);
            upbound=max(upbound,m[i]);
        }
        solve();
        printf("Case #%d: %d\n",ca,ans);
    }
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
UCF101是一个动作识别数据集,包含101个不同的动作类别。每个类别有不同数量的样本,具体数目如下: 1. ApplyEyeMakeup: 145 2. ApplyLipstick: 114 3. Archery: 145 4. BabyCrawling: 132 5. BalanceBeam: 134 6. BandMarching: 167 7. BaseballPitch: 150 8. Basketball: 134 9. BasketballDunk: 137 10. BenchPress: 148 11. Biking: 150 12. Billiards: 145 13. BlowDryHair: 123 14. BlowingCandles: 100 15. BodyWeightSquats: 175 16. Bowling: 146 17. BoxJump: 131 18. BoxingPunchingBag: 147 19. BoxingSpeedBag: 148 20. BreastStroke: 148 21. BrushingTeeth: 146 22. CleanAndJerk: 151 23. CliffDiving: 141 24. CricketBowling: 145 25. CricketShot: 150 26. CuttingInKitchen: 150 27. Diving: 147 28. Drumming: 166 29. Fencing: 145 30. FieldHockeyPenalty: 156 31. FloorGymnastics: 173 32. FrisbeeCatch: 143 33. FrontCrawl: 156 34. GolfSwing: 166 35. Haircut: 139 36. HammerThrow: 139 37. HandstandPushups: 137 38. HandstandWalking: 166 39. HeadMassage: 144 40. HighJump: 145 41. HorseRace: 155 42. HorseRiding: 150 43. HulaHoop: 140 44. IceDancing: 147 45. JavelinThrow: 148 46. JugglingBalls: 166 47. JumpingJack: 151 48. JumpRope: 154 49. Kayaking: 116 50. Knitting: 100 51. LongJump: 140 52. Lunges: 146 53. MilitaryParade: 138 54. Mixing: 147 55. MoppingFloor: 151 56. Nunchucks: 118 57. ParallelBars: 149 58. PizzaTossing: 100 59. PlayingCello: 150 60. PlayingDaf: 100 61. PlayingDhol: 100 62. PlayingFlute: 149 63. PlayingGuitar: 147 64. PlayingPiano: 150 65. PlayingSitar: 100 66. PlayingTabla: 100 67. PlayingViolin: 148 68. PoleVault: 145 69. PommelHorse: 145 70. PullUps: 150 71. Punch: 150 72. PushUps: 150 73. Rafting: 100 74. RockClimbingIndoor: 155 75. RopeClimbing: 141 76. Rowing: 150 77. SalsaSpin: 150 78. ShavingBeard: 144 79. Shotput: 146 80. SkateBoarding: 144 81. Skiing: 146 82. Skijet: 100 83. SkyDiving: 144 84. SoccerJuggling: 133 85. SoccerPenalty: 152 86. StillRings: 145 87. SumoWrestling: 145 88. Surfing: 147 89. Swing: 150 90. TableTennisShot: 145 91. TaiChi: 106 92. TennisSwing: 145 93. ThrowDiscus: 145 94. TrampolineJumping: 145 95. Typing: 144 96. UnevenBars: 144 97. VolleyballSpiking: 149 98. WalkingWithDog: 152 99. WallPushups: 145 100. WeightedSquat: 147 101. Windsurfing: 143
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值