蓝桥·算法赛——第04场

1-验题人的生日

2-蓝桥小课堂—海伦公式

3-压缩矩阵

n, q = map(int, input().split())
for _ in range(q):
    x = int(input())
    i = (x + 1) // 3 + 1
    j = x + 3 - 2 * i
    print("{0} {1}".format(i, j))

4-恒纪元

5-充能计划

n, m, q = map(int, input().split())
s = [0] + list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(q)]
lst.sort()

diff = [0] * (n + 2) # 差分数组
idx = 0; ind = 0 # 当前何种能量 处在何处
for p, k in lst:
    if p != idx: # 开始下一个能量的计算
        idx = p; ind = k - 1
    if ind >= k + s[p] - 1 or ind >= n: # 能量相当于没加
        continue
    left = max(ind + 1, k); right = min(k + s[p] - 1, n)
    # 将[left, right]整体加1
    diff[left] += 1; diff[right + 1] -= 1
    ind = right
# 前缀和
score = 0
for i in range(1, n + 1):
    score += diff[i]
    print(score, end = " ")

6-大风起兮

from bisect import bisect

n = int(input())
p = list(map(float, input().split()))
q = int(input())
# 将 x 转换为对应的数值
px = list(p[i - 1] for i in map(int, input().split()))
p.sort()
for i in range(q):
    del p[bisect(p, px[i]) - 1]
    n -= 1
    if n % 2 == 0:
        print((p[n // 2 - 1] + p[n // 2]) / 2, end=" ")
    else:
        print(p[n // 2], end=" ")

7-时空追捕