zoukankan      html  css  js  c++  java
  • hdu1350Taxi Cab Scheme (最小路径覆盖)

    Taxi Cab Scheme

    Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 712 Accepted Submission(s): 337


    Problem Description
    Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as soon as possible, there is also a need to schedule all the taxi rides which have been booked in advance. Given a list of all booked taxi rides for the next day, you want to minimise the number of cabs needed to carry out all of the rides.

    For the sake of simplicity, we model a city as a rectangular grid. An address in the city is denoted by two integers: the street and avenue number. The time needed to get from the address a, b to c, d by taxi is |a - c| + |b - d| minutes. A cab may carry out a booked ride if it is its first ride of the day, or if it can get to the source address of the new ride from its latest, at least one minute before the new ride’s scheduled departure. Note that some rides may end after midnight.

    Input
    On the first line of the input is a single positive integer N, telling the number of test scenarios to follow. Each scenario begins with a line containing an integer M, 0 < M < 500, being the number of booked taxi rides. The following M lines contain the rides. Each ride is described by a departure time on the format hh:mm (ranging from 00:00 to 23:59), two integers a b that are the coordinates of the source address and two integers c d that are the coordinates of the destination address. All coordinates are at least 0 and strictly smaller than 200. The booked rides in each scenario are sorted in order of increasing departure time.

    Output
    For each scenario, output one line containing the minimum number of cabs required to carry out all the booked taxi rides.

    Sample Input
    2 2 08:00 10 11 9 16 08:07 9 16 10 11 2 08:00 10 11 9 16 08:06 9 16 10 11

    Sample Output
    1 2

    Source
    #include<stdio.h>
    #include<string.h>
    struct nn
    {
        int st,endt;
        int x1,y1,x2,y2;
    }node[505];
    int vist[505],match[505],map[505][505],M;
    int find(int i)
    {
        for(int j=1;j<=M;j++)
        if(vist[j]==0&&map[i][j])
        {
            vist[j]=1;
            if(match[j]==0||find(match[j]))
            {
                match[j]=i; return 1;
            }
        }
        return 0;
    }
    int abs(int a)
    {
        return a>0?a:-a;
    }
    int main()
    {
        int t,h,f;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&M);
            for(int i=1;i<=M;i++)
            {
                scanf("%d:%d %d%d%d%d",&h,&f,&node[i].x1,&node[i].y1,&node[i].x2,&node[i].y2);
                node[i].st=h*60+f;
                node[i].endt=node[i].st+abs(node[i].x1-node[i].x2)+abs(node[i].y1-node[i].y2);
            }
            memset(map,0,sizeof(map));
            for(int i=1;i<=M;i++)
            for(int j=1;j<=M;j++)
            if(j!=i&&node[i].endt+abs(node[j].x1-node[i].x2)+abs(node[j].y1-node[i].y2)<node[j].st)
            map[i][j]=1;
            int ans=0;
            memset(match,0,sizeof(match));
            for(int i=1;i<=M;i++)
            {
                memset(vist,0,sizeof(vist));
                ans+=find(i);
            }
            printf("%d
    ",M-ans);
        }
    }
    


  • 相关阅读:
    eureka 注册中心(单机版)
    金蝶实际成本培训01
    查看WIN10内核
    金蝶K3 WISE 15.0 GUID
    win10卸载系统自带office365
    金蝶K3wise15.0BOM维护默认只能查看登录账户作为建立人的BOM清单
    阿里云邮箱代收邮件
    金蝶寄售业务流程
    转-商品流通企业代销商品核算方法
    转-ERP待检仓、代管仓、赠品仓
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/3997061.html
Copyright © 2011-2022 走看看