zoukankan      html  css  js  c++  java
  • PAT.phone_bills(傻逼题)

    1016 Phone Bills (25分)

     

    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 (≤), 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


    这个题我是真的吐了,题目不是说It is guaranteed that at least one call is well paired in the input. ??????当放屁呢,
    样例二三死活过不了,最后改成如果没有匹配到的通话记录就不输出才过了.......

    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    #include <string>
    #include <map>
    #include <set>
    #include <vector>
    using namespace std;
    
    int _cost[30];
    
    typedef pair <string, string> pss;
    
    map <string, set <pss> > mp;
    
    
    string on = "on-line", off = "off-line";
    
    int get_num(char c1, char c2) {
        return (c1 - '0') * 10 + c2 - '0';
    }
    
    int last_time, total_amount, _val, _sum;
    
    void get_time(string _on, string _off) {
        //Todo: 计算间隔时间,计算本次通话的费用
        int bd, bh, bm, ed, eh, em;
        bd = get_num(_on[3], _on[4]);
        bh = get_num(_on[6], _on[7]);
        bm = get_num(_on[9], _on[10]);
        ed = get_num(_off[3], _off[4]);
        eh = get_num(_off[6], _off[7]);
        em = get_num(_off[9], _off[10]);
        int n;
        last_time = (ed - bd) * 1440 + (eh - bh) * 60 + (em - bm);
        for(int i = 0; i < eh; i ++) _val += _cost[i] * 60;
        _val += _cost[eh] * em;
        for(int i = 0; i < bh; i ++) _val -= _cost[i] * 60;
        _val -= _cost[bh] * bm;
        if(ed > bd) {
            _val += (ed - bd) * _sum * 60;
        }
    }
    
    char *ans1, *ans2, *ans3;
    
    int main() {
        for(int i = 0; i < 24; i ++) {
            cin >> _cost[i];
            _sum += _cost[i];
        }
        int k;
        cin >> k;
        string name, data, _status;
        while(k --) {
            cin >> name >> data >> _status;
            mp[name].insert(make_pair(data, _status));
        }
        bool flag, flag2;
        string _on, _off;
        map <string, set <pss> > :: iterator i;
        for(i = mp.begin(); i != mp.end(); i ++) {
            flag = false;
            flag2 = false;
            total_amount = 0;
            string s = (i -> second).begin() -> first;
            set <pss> :: iterator j;
            for(j = (i -> second).begin(); j != (i -> second).end(); j ++) {
                if(j -> second == on) {
                    _on = j -> first;
                    flag = true;
                } else if(j -> second == off && flag) {
                    _val = 0;
                    flag = false;
                    _off = j -> first;
                    get_time(_on, _off);
                    total_amount += _val;
                    ans1 = (char*)_on.data();
                    ans2 = (char*)_off.data();
                    ans3 = (char*)(i -> first).data();
                    if(!flag2) printf("%s %c%c
    ", ans3, s[0], s[1]);
                    printf("%s %s %d $%.2f
    ", ans1 + 3, ans2 + 3 , last_time, _val * 1.0 / 100);
                    flag2 = true;
                }
            }
            if(flag2) printf("Total amount: $%.2f
    ", total_amount * 1.0 / 100);
        }
        return 0;
    }
     
  • 相关阅读:
    DFS搜索算法--(1)基础图遍历 绝对看!的!懂!
    C++;STL--队列与栈;
    Unity VR-播放demo模型后无法移动视角
    自律
    链表-简单练习题2-数据结构实验之链表二:逆序建立链表
    链表-简单练习题1-数据结构实验之链表一:顺序建立链表 SDUT2117
    链表--笔记
    leetcode--Binary Tree Maximum Path Sum
    leetcode--Single Number II
    leetcode--Single Number
  • 原文地址:https://www.cnblogs.com/bianjunting/p/12534822.html
Copyright © 2011-2022 走看看