编程介的小学生 2019-12-31 17:59 采纳率: 0.2%
浏览 47

Parking Log

Problem Description
The parking lot in the center of the capital has N parking spaces. You are asked to develop a program to write the parking log of the lot. The program is required to record such two operations which may happen in the lot:

A: A motorcade with Mi cars applies for Mi parking spaces in a row, namely, continuous spaces [Si,Si+Mi-1]. A special constraint is that the number of free spaces between the coming motorcade and the last car parking before Si, should not be larger than Li. Note that, this constraint has no effect if there is no car before Si. What's more, the number of free spaces between the coming motorcade and the first car parking after Si+Mi-1 should not be larger than Ri. Also, you should ignore this constraint when Si+Mi-1 is last occupied space. The space with the smallest Si is selected when there are several candidate start places. The motorcade will leave if there are no spaces satisfying the conditions. After one motorcade is parked, its parking limits Li and Ri can be ignored when finding parking places for later coming motorcades. Your task is to find the Si, and return it as result.

B. The k-th motorcade counted from left to right leaves the lot. Ignore this operation if there are no more than k motorcades in the parking lot.

In the very beginning, the spaces in the lot are all free.

Input
First line of the input is a single integer T(T <= 10), indicates there are T test cases.
For each test case, the first line is two integers N(1 <= N <= 50000) Q(1 <= Q <= 100000), representing the size of the lot and the number of operations.
The following Q lines give the operations, in which lines with one char and three integers as "A M L R" (0 < M,L,R <= 50000) representing operations of type A, and lines with one char and a single number are of type B.

Output
For each test case, you should output "Case #k:" first. After that, your program should output the result place for each operation A, -1 if no place available.

Sample Input
2
90 5
A 77 2 2
B 3
B 1
A 53 2 3
A 7 3 3
7 15
A 3 1 1
A 1 1 1
B 1
A 1 1 1
A 1 1 1
B 2
A 2 1 1
A 1 1 1
A 2 1 1
A 1 1 1
B 4
B 3
B 2
A 1 1 1
A 2 1 1

Sample Output
Case #1:
1
1
54
Case #2:
1
4
2
1
2
5
6
-1
-1
3

  • 写回答

1条回答 默认 最新

  • 你知我知皆知 2024-07-27 10:26
    关注

    以下回答参考 皆我百晓生、券券喵儿 等免费微信小程序相关内容作答，并由本人整理回复。

    # Parking Log
#
# Problem Description:
#   The parking lot in the center of the capital has N parking spaces.
#   You are asked to develop a program to write the parking log of the lot.
#   The program is required to record such two operations which may happen in the lot:
#       A: A motorcade with Mi cars applies for Mi parking spaces in a row,
#           namely, continuous spaces [Si,Si+Mi-1].
#           A special constraint is that the number of free spaces between the
#           coming motorcade and the last car parking before Si, should not be
#           larger than Li.
#           Note that, this constraint has no effect if there is no car before Si.
#           What's more, the number of free spaces between the coming motorcade
#           and the first car parking after Si+Mi-1 should not be larger than Ri.
#           Also, you should ignore this constraint when Si+Mi-1 is last
#           occupied space.
#       B: The k-th motorcade counted from left to right leaves the lot.
#       Ignore this operation if there are no more than k motorcades in the
#       parking lot.
#
# In the very beginning, the spaces in the lot are all free.
#
# Input:
#   First line of the input is a single integer T(T <= 10), indicates there are T test cases.
#   For each test case, the first line is two integers N(1 <= N <= 50000)
#   Q(1 <= Q <= 100000), representing the size of the lot and the number of operations.
#   The following Q lines give the operations, in which lines with one char and three integers
#   as "A M L R" (0 < M,L,R <= 50000) representing operations of type A, and lines with one
#   char and a single number are of type B.
#
# Output:
#   For each test case, you should output "Case #k:"
#   After that, your program should output the result place for each operation A,
#   -1 if no place available.
#
# Constraints:
#   1 <= T <= 10
#   1 <= N, Q <= 50000
#
# Sample Input:
#   2
#   90 5
#   A 77 2 2
#   B 3
#   B 1
#   A 53 2 3
#   A 7 3 3
#   7 15
#   A 3 1 1
#   A 1 1 1
#   B 1
#   A 1 1 1
#   A 2 1 1
#   A 1 1 1
#   B 4
#   B 3
#   B 2
#   A 1 1 1
#   A 2 1 1
#
# Sample Output:
#   Case #1:
#     1
#     1
#     54
#   Case #2:
#     1
#     4
#     2
#     1
#     2
#     5
#     6
#     -1
#     -1
#     3

    #' Parking Log
#' @param N number of parking spaces
#' @param Q number of operations
#' @return
#' 1. Result place for operation A
#' 2. -1 if no place available
#' @examples
#' parking_log <- parking_log(N = 90, Q = 5)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2))
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2, B = 4)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4)
#' parking_log <- parking_log(N = 90, Q = 5, A = c(77, 2, 2), B = 3, B = 1, B = 1, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4, B = 3, B = 2, B = 4
    评论

报告相同问题？

  • Parking Log
    2017-11-24 09:47
    回答 1 已采纳 https://www.nowcoder.com/questionTerminal/24ac8a49b01f402783f1e697f884138f
  • Tower Parking
    2017-11-29 11:09
    回答 1 已采纳 http://blog.csdn.net/geekcome/article/details/6852187
  • Parking Lot
    2017-08-06 17:21
    回答 1 已采纳 https://www.nowcoder.com/questionTerminal/32129dcffc1e48d1afb783e26b18e65c
  • Parking.rar_Java编程_Java_
    2021-08-12 05:17
    标题中的"Parking.rar"暗示了这是一个关于停车管理系统的项目，主要使用Java编程语言来实现。描述中提到的停车场系统有m个入口，n个出口，以及k个停车位，且要求在任何时刻只有一个车辆能通过入口进入。此外，系统还...
  • Optimal Parking
    2017-01-01 14:32
    回答 1 已采纳 http://blog.csdn.net/yaohaonan/article/details/21107269
  • 关于这里这个的四个分类的判断，输出不完全，C语言怎么实现 erlang golang r语言
    2019-01-20 15:30
    回答 1 已采纳 https://blog.csdn.net/weixin_34008805/article/details/93871992
  • 一个数字的乘法问题，用C语言怎么实现这个算法的优化呢？ erlang golang r语言
    2018-12-16 12:13
    回答 1 已采纳 https://blog.csdn.net/xiexingshishu/article/details/77584177
  • Simple Parking Lot Management System
    2023-11-08 19:52
    在这个系统中，JavaScript作为主要的编程语言，用于处理用户交互、数据管理和逻辑控制。JavaScript是一种广泛应用于Web开发的脚本语言，尤其在前端开发中，它的作用不可或缺。 1. **JavaScript基础**： - ...
  • 在一个线程中使用logback占位符打印信息出现程序无故终止 java
    2022-07-26 17:22
    回答 2 已采纳 你可以看看这个https://blog.csdn.net/forthefuture_/article/details/108346216单元测试好像测试多线程好像就是有点问题。
  • 这个代码的流程图怎么做 c语言 有问必答
    2022-07-17 20:06
    回答 2 已采纳 这不是我给你写的代码吗，流程图如下： 没啥问题的话，请帮忙采纳一下，谢谢。给你代码的那个问题也请帮忙采纳一下，谢谢。
  • parkingLot
    2021-03-31 18:47
    在这个项目中，使用了Java编程语言来实现，这表明其背后是基于Java的后端服务架构。 Java是一种广泛使用的面向对象的编程语言，以其跨平台的特性、丰富的类库和强大的性能而闻名。在"parkingLot"项目中，Java可能被...
  • 编程语言选型时，你需要考虑的几个方面
    2018-08-17 10:11
    ArthurKingYs的博客 产品在开发之前都会面临一个常见问题，即技术选型，首当其冲的是采用哪门编程语言来开发我们的产品。我的第一家公司是UCloud，三位老板都来自于腾讯，所以第一批员工不少都是腾讯兵，腾讯的主要开发语言是 C++ ，...
  • java-parking
    2021-03-25 21:50
    在本项目"java-parking"中，我们主要探讨的是如何使用Java编程语言来解决一个基础的停车场管理系统的问题。这个系统可能会涉及到车辆的进入、离开、查找空闲停车位以及计费等功能。通过使用JUnit进行单元测试，我们...
  • Car-parking-project
    2021-03-13 17:39
    本文将深入探讨一个名为“Car-parking-project”的项目，该项目使用Java编程语言构建，旨在实现高效、自动化的停车服务。下面，我们将详细解析这个项目的各个关键知识点。 1. **Java基础**：Java作为项目的基础，它...
  • Java 并发编程
    2022-12-05 23:11
    2档的博客 Java 并发编程
  • 编程语言选型时，你需要考虑的事情
    2018-08-24 09:39
    zzzzzzBIUBIU的博客 产品在开发之前都会面临一个常见问题，即技术选型，首当其冲的是采用哪门编程语言来开发我们的产品。我的第一家公司是UCloud，三位老板都来自于腾讯，所以第一批员工不少都是腾讯兵，腾讯的主要开发语言是 C++ ，...
  • 宏定义编程软件_什么是计算机编程？ 定义软件开发。
    2020-08-15 00:53
    cumian8165的博客 宏定义编程软件My five year old son, Ramy, approached me one day while I was working from home and asked, “What are you doing Mama?” 我五岁的儿子拉米有一天在我在家工作时走近我，问道：“你在做什么妈妈...
  • 并发编程之死锁问题介绍
    2023-02-26 15:44
    MarkusZhang的博客 死锁问题在并发编程中是一个非常致命的问题，问题一旦产生，只能通过重启机器、修改代码来修复问题，本篇我们通过一小段内容介绍下死锁以及如何死锁的预防
  • MATLAB算法实战应用案例精讲-【图像处理】数字图像海报化（附Java、python、matlab和R语言代码实现）
    2023-02-07 10:37
    林聪木的博客 选择的工具 应用与开发： 代码实现 python Java matlab R语言 前言 所谓的海报化其实就是将每一个像素的分量与224进行与运算，而244的16进制表示可以表示成0xe0，前面介绍了一个像素的分量的范围在0-255范围内，所以...
  • 崔荣容老师Pocket语法学习笔记！！！
    2024-01-01 23:01
    freshman_y的博客 学习英语真的很重要！虽然也许不会与外国人交流，但是你可能会因为编程学习或者阅读英语资料苦恼，既然看到了不如就从现在开始好好学英语吧！Nothing is impossible to a willing heart（有志者事竟成）!
  • 没有解决我的问题, 去提问

悬赏问题

  • ¥200 csgo2的viewmatrix值是否还有别的获取方式
  • ¥15 Stable Diffusion，用Ebsynth utility在视频选帧图重绘，第一步报错，蒙版和帧图没法生成，怎么处理啊
  • ¥15 请把下列每一行代码完整地读懂并注释出来
  • ¥15 pycharm运行main文件，显示没有conda环境
  • ¥15 寻找公式识别开发，自动识别整页文档、图像公式的软件
  • ¥15 为什么eclipse不能再下载了？
  • ¥15 编辑cmake lists 明明写了project项目名，但是还是报错怎么回事
  • ¥15 关于#计算机视觉#的问题：求一份高质量桥梁多病害数据集
  • ¥15 特定网页无法访问，已排除网页问题
  • ¥50 如何将脑的图像投影到颅骨上