Python代码限时1000内解决SBACT - Slow Growing Bacteria问题
```python def bacteria_growth(grid, n, k, m): time = 0 total_population = sum(sum(row) for row in grid) while total_population < m: new_grid = [[0 for _ in range(n)] for _ in range(n)] for i in range(n): for j in range(n): if grid[i][j] >= k or (i > 0 and grid[i - 1][j] >= k) or (i < n - 1 and grid[i + 1][j] >= k) or (j > 0 and grid[i][j - 1] >= k) or (j < n - 1 and grid[i][j + 1] >= k): new_grid[i][j] = grid[i][j] + 1 else: new_grid[i][j] = grid[i][j] grid = new_grid total_population = sum(sum(row) for row in grid) time += 1 if time > 1000: return "Not possible" return time t = int(input()) for _ in range(t): n, k, m = map(int, input().split()) grid = [] for _ in range(n): grid.append(list(map(int, input().split()))) print(bacteria_growth(grid, n, k, m)) ``` ######[AI问答 | 321点数解答 | 2025-04-11 13:12:04]
- Python代码限时1000内解决SBACT - Slow Growing Bacteria问题(字节豆包 | 321点数解答 | 2025-04-11 13:12:04)212
- Python 运行报错:urllib3 网络连接创建失败,原因及排查建议(字节豆包 | 161点数解答 | 2024-10-31 00:39:36)458
- 数值与字典序:999 与 1000 大小比较的不同答案(字节豆包 | 141点数解答 | 2025-03-23 22:06:18)237
- C3期末:精准求解 3 - 20 范围内数列第 k 项值及注意要点(字节豆包 | 242点数解答 | 2025-06-15 11:26:19)135
- C++求解:查找3 - 20项数列第k项值及注意要点(字节豆包 | 325点数解答 | 2025-06-15 11:27:11)155
- Python 实战:学生信息列表转字典、遍历、深拷贝及数据修改全流程(GPT | 422点数解答 | 2024-10-29 15:43:54)414
- Python实战:学生成绩列表转字典,深拷贝与数据修改操作全解析(字节豆包 | 254点数解答 | 2024-10-29 16:01:39)405
- DBA必看:巧用MySQL慢日志解决CPU占用过高难题(百度文心 | 548点数解答 | 2023-11-09 18:10:05)118
- 洛谷:根据邮件重量与加急情况精准计算邮费(字节豆包 | 88点数解答 | 2024-11-09 15:33:30)402
- Python实现:根据邮件重量与加急选择精准计算邮费(阿里通义 | 554点数解答 | 2024-11-09 15:34:05)402
- 1000元存5年,哪种存款方式收益最高?答案惊人!(GPT | 1222点数解答 | 2024-11-13 18:03:09)181
- 1000元存5年,5种存款方式本息大比拼!(字节豆包 | 646点数解答 | 2024-11-13 18:03:18)163