zoukankan      html  css  js  c++  java
  • 1016. Phone Bills

    1016. Phone Bills (25)

    时间限制
    400 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    A long-distance telephone company charges its customers by the following rules:

    Making a long-distance call costs a certain amount per minute, depending on the time of day when the call is made. When a customer starts connecting a long-distance call, the time will be recorded, and so will be the time when the customer hangs up the phone. Every calendar month, a bill is sent to the customer for each minute called (at a rate determined by the time of day). Your job is to prepare the bills for each month, given a set of phone call records.

    Input Specification:

    Each input file contains one test case. Each case has two parts: the rate structure, and the phone call records.

    The rate structure consists of a line with 24 non-negative integers denoting the toll (cents/minute) from 00:00 - 01:00, the toll from 01:00 - 02:00, and so on for each hour in the day.

    The next line contains a positive number N (<= 1000), followed by N lines of records. Each phone call record consists of the name of the customer (string of up to 20 characters without space), the time and date (mm:dd:hh:mm), and the word "on-line" or "off-line".

    For each test case, all dates will be within a single month. Each "on-line" record is paired with the chronologically next record for the same customer provided it is an "off-line" record. Any "on-line" records that are not paired with an "off-line" record are ignored, as are "off-line" records not paired with an "on-line" record. It is guaranteed that at least one call is well paired in the input. You may assume that no two records for the same customer have the same time. Times are recorded using a 24-hour clock.

    Output Specification:

    For each test case, you must print a phone bill for each customer.

    Bills must be printed in alphabetical order of customers' names. For each customer, first print in a line the name of the customer and the month of the bill in the format shown by the sample. Then for each time period of a call, print in one line the beginning and ending time and date (dd:hh:mm), the lasting time (in minute) and the charge of the call. The calls must be listed in chronological order. Finally, print the total charge for the month in the format shown by the sample.

    Sample Input:
    10 10 10 10 10 10 20 20 20 15 15 15 15 15 15 15 20 30 20 15 15 10 10 10
    10
    CYLL 01:01:06:01 on-line
    CYLL 01:28:16:05 off-line
    CYJJ 01:01:07:00 off-line
    CYLL 01:01:08:03 off-line
    CYJJ 01:01:05:59 on-line
    aaa 01:01:01:03 on-line
    aaa 01:02:00:01 on-line
    CYLL 01:28:15:41 on-line
    aaa 01:05:02:24 on-line
    aaa 01:04:23:59 off-line
    
    Sample Output:
    CYJJ 01
    01:05:59 01:07:00 61 $12.10
    Total amount: $12.10
    CYLL 01
    01:06:01 01:08:03 122 $24.40
    28:15:41 28:16:05 24 $3.85
    Total amount: $28.25
    aaa 01
    02:00:01 04:23:59 4318 $638.80
    Total amount: $638.80
      1 #include<stdio.h>
      2 #include<math.h>
      3 #include<stdlib.h>
      4 #include<string.h>
      5 #include<algorithm>
      6 using namespace std;
      7 
      8 struct custom
      9 {
     10     char id[25];
     11     int mon, day, h, m;
     12     char w[15];
     13 };
     14 custom a[1010];
     15 
     16 bool cmp(custom x, custom y)
     17 {
     18     if(strcmp(x.id, y.id) != 0)
     19         return strcmp(x.id, y.id) < 0;
     20     else if(x.mon != y.mon)
     21         return x.mon < y.mon;
     22     else if(x.day != y.day)
     23         return x.day < y.day;
     24     else if(x.h != y.h)
     25         return x.h < y.h;
     26     else
     27         return x.m < y.m;
     28 }
     29 int main()
     30 {
     31     int n, i, toll[30];
     32     for(i = 0; i < 24; i++)
     33     {
     34         scanf("%d", &toll[i]);
     35     }
     36     scanf("%d", &n);
     37     for(i = 0; i < n; i++)
     38     {
     39         scanf("%s %d:%d:%d:%d %s", a[i].id, &a[i].mon, &a[i].day, &a[i].h, &a[i].m, a[i].w);
     40     }
     41     sort(a, a + n, cmp);
     42     int on = 0, off, next;
     43     while(on < n)
     44     {
     45         int flag = 0;
     46         next = on;
     47         while(next < n && strcmp(a[next].id, a[on].id) == 0)
     48         {
     49             if(flag == 0 && strcmp(a[next].w, "on-line") == 0)
     50             {
     51                 flag = 1;
     52             }
     53             else if(flag == 1 && strcmp(a[next].w, "off-line") == 0)
     54             {
     55                 flag = 2;
     56             }
     57             next++;
     58         }
     59         if(flag == 2)
     60         {
     61             printf("%s %02d
    ", a[on].id, a[on].mon);
     62             int amount = 0;
     63             while(on < next)
     64             {
     65 
     66                 while(on < next - 1 && !(strcmp(a[on].w, "on-line") == 0 && strcmp(a[on + 1].w, "off-line") == 0))
     67                 {
     68                     on++;
     69                 }
     70                 off = on + 1;
     71                 if(off == next)
     72                 {
     73                     on = next;
     74                     break;
     75                 }
     76                 int time = 0, money = 0;
     77                 custom temp = a[on];
     78                 while(temp.day < a[off].day || temp.h < a[off].h || temp.m < a[off].m)
     79                 {
     80                     money += toll[temp.h];
     81                     time++;
     82                     temp.m++;
     83                     if(temp.m == 60)
     84                     {
     85                         temp.m = 0;
     86                         temp.h++;
     87                     }
     88                     if(temp.h == 24)
     89                     {
     90                         temp.h = 0;
     91                         temp.day++;
     92                     }
     93                 }
     94                 printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f
    ", a[on].day, a[on].h, a[on].m, a[off].day, a[off].h, a[off].m, time, money /100.0);
     95                 amount += money;
     96                 on = off + 1;
     97             }
     98             printf("Total amount: $%.2f
    ", amount / 100.0);
     99         }
    100         else
    101         {
    102             on = next;
    103             continue;
    104         }
    105     }
    106     return 0;
    107 }
  • 相关阅读:
    学习ASP.NET Core(11)-解决跨域问题与程序部署
    学习ASP.NET Core(10)-全局日志与xUnit系统测试
    学习ASP.NET Core(09)-数据塑形与HATEOAS及内容协商
    学习ASP.NET Core(08)-过滤搜索与分页排序
    学习ASP.NET Core(07)-AOP动态代理与日志
    学习ASP.NET Core(06)-Restful与WebAPI
    学习ASP.NET Core(05)-使用Swagger与Jwt认证
    基于NACOS和JAVA反射机制动态更新JAVA静态常量非@Value注解
    DES 加密解密 文件工具类
    springboot-mybatis双数据源配置
  • 原文地址:https://www.cnblogs.com/yomman/p/4280276.html
Copyright © 2011-2022 走看看