A1095 Cars on Campus (30)

Powered by:NEFU AB-IN
Link

  
A1095 Cars on Campus (30)

题意

Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus, and at the end of the day find the cars that have parked for the longest time period.
思绪

给出每个人的车的收支情况，求一个时间内里有多少车，最长的累加停车时间是多少？
会有进出的噪音数据，取最晚进，最早出的时间，这就是一次的停车时间，然后利用差分，统计车的数目
此题也涉及到时间的转换，以及打印
代码

1. # 3.8.19 import
2. import random
3. from collections import Counter, defaultdict, deque
4. from datetime import datetime, timedelta
5. from functools import lru_cache, reduce
6. from heapq import heapify, heappop, heappush, nlargest, nsmallest
7. from itertools import combinations, compress, permutations, starmap, tee
8. from math import ceil, comb, fabs, floor, gcd, hypot, log, perm, sqrt
9. from string import ascii_lowercase, ascii_uppercase
10. from sys import exit, setrecursionlimit, stdin
11. from typing import Any, Callable, Dict, List, Optional, Tuple, TypeVar, Union
13. # Constants
14. TYPE = TypeVar('TYPE')
15. N = int(2e5 + 10)
16. M = int(20)
17. INF = int(1e12)
18. OFFSET = int(100)
19. MOD = int(1e9 + 7)
21. # Set recursion limit
22. setrecursionlimit(int(2e9))
25. class Arr:
26.     array = staticmethod(lambda x=0, size=N: [x() if callable(x) else x for _ in range(size)])
27.     array2d = staticmethod(lambda x=0, rows=N, cols=M: [Arr.array(x, cols) for _ in range(rows)])
28.     graph = staticmethod(lambda size=N: [[] for _ in range(size)])
31. class Math:
32.     max = staticmethod(lambda a, b: a if a > b else b)
33.     min = staticmethod(lambda a, b: a if a < b else b)
36. class IO:
37.     input = staticmethod(lambda: stdin.readline().strip())
38.     read = staticmethod(lambda: map(int, IO.input().split()))
39.     read_list = staticmethod(lambda: list(IO.read()))
40.     read_mixed = staticmethod(lambda *types: [t(v) for t, v in zip(types, IO.input().split())])
43. class Std:
44.     pass
47. # ————————————————————— Division line ——————————————————————
49. def convert_time(time: str) -> int:
50.     h, m, s = map(int, time.split(":"))
51.     return h * 3600 + m * 60 + s
54. def convert_index(x: int) -> str:
55.     return f"{x // 3600:02}:{x % 3600 // 60:02}:{x % 60:02}"
58. n, k = IO.read()
59. diff_ = Arr.array(0, convert_time("24:00:01"))
61. map_ = defaultdict(lambda: {
62.     "in": [],
63.     "out": []
64. })
66. for _ in range(n):
67.     string, time, status = IO.read_mixed(str, str, str)
68.     map_[string][status].append(time)
70. max_ = Counter()
71. max_val = 0
73. for user, dict_ in map_.items():
74.     in_ = dict_["in"]
75.     out_ = dict_["out"]
76.     res = []
78.     res.extend([(convert_time(item), "in") for item in in_])
79.     res.extend([(convert_time(item), "out") for item in out_])
81.     res.sort(key=lambda x: x[0])
83.     pre_in, pre_out = -1, -1
84.     for index, st in res:
85.         if st == "in":
86.             pre_in = index
87.         if st == "out":
88.             pre_out = index
90.         if pre_in != -1 and pre_out != -1 and st == "out" and index > pre_in:
91.             diff_[pre_in] += 1
92.             diff_[index] -= 1
93.             val = index - pre_in
94.             max_[user] += val
95.             max_val = Math.max(max_val, max_[user])
96.             pre_in, pre_out = -1, -1
99. for i in range(1, len(diff_)):
100.     diff_[i] += diff_[i - 1]
102. for _ in range(k):
103.     time = IO.input()
104.     print(diff_[convert_time(time)])
106. users_ = [user for user in max_.keys() if max_[user] == max_val]
107. users_.sort()
109. print(" ".join(users_), convert_index(max_val))

复制代码

免责声明：如果侵犯了您的权益，请联系站长，我们会及时删除侵权内容，谢谢合作！更多信息从访问主页：qidao123.com:ToB企服之家，中国第一个企服评测及商务社交产业平台。