荣耀 2026-05-06 笔试真题 - 通用岗

import sys
input = sys.stdin.readline

def main():
    m, n = map(int, input().split())
    chicks = list(map(int, input().split()))
    raw = list(map(int, input().split()))

    for r in range(n):
        atk, prt = raw[2 * r], raw[2 * r + 1]
        sz = len(chicks)
        if atk > sz:
            continue
        if prt <= sz and atk == prt:
            continue
        del chicks[atk - 1]
        if len(chicks) <= 1:
            break

    if len(chicks) <= 1:
        print(f"Fail! {chicks[0]}")
    else:
        chicks.sort()
        print("Success! " + " ".join(map(str, chicks)))

main()

import sys
import math

def main():
    text = sys.stdin.read()
    inner = text[text.index('[') + 1 : text.rindex(']')]
    grid = []
    for seg in inner.split(';'):
        seg = seg.strip()
        if seg:
            grid.append([float(w) for w in seg.split()])

    rows, cols = len(grid), len(grid[0])

    # 元素变换：ceil(log2(x))
    for i in range(rows):
        for j in range(cols):
            v = grid[i][j]
            if v <= 1:
                grid[i][j] = 0.0
            else:
                grid[i][j] = math.ceil(math.log2(v))

    # 构造 Gram 矩阵（取维度较小的那边以加速）
    dim = min(rows, cols)
    g = [[0.0] * dim for _ in range(dim)]
    if rows >= cols:
        for r in range(rows):
            for ci in range(cols):
                for cj in range(ci, cols):
                    g[ci][cj] += grid[r][ci] * grid[r][cj]
        for ci in range(cols):
            for cj in range(ci):
                g[ci][cj] = g[cj][ci]
    else:
        for ri in range(rows):
            for rj in range(ri, rows):
                acc = 0.0
                for c in range(cols):
                    acc += grid[ri][c] * grid[rj][c]
                g[ri][rj] = g[rj][ri] = acc

    # Jacobi 旋转迭代求特征值
    tol = 1e-12
    for _ in range(200 * dim * dim):
        mx, mi, mj = 0.0, 0, 0
        for i in range(dim):
            for j in range(i + 1, dim):
                if abs(g[i][j]) > mx:
                    mx = abs(g[i][j])
                    mi, mj = i, j
        if mx < tol:
            break

        ii, jj, ij = g[mi][mi], g[mj][mj], g[mi][mj]
        theta = (jj - ii) / (2.0 * ij)
        sgn = 1.0 if theta >= 0 else -1.0
        t = sgn / (abs(theta) + math.sqrt(1.0 + theta * theta))
        cos = 1.0 / math.sqrt(1.0 + t * t)
        sin = t * cos

        for k in range(dim):
            if k == mi or k == mj:
                continue
            old_ki = g[k][mi]
            old_kj = g[k][mj]
            g[k][mi] = g[mi][k] = cos * old_ki - sin * old_kj
            g[k][mj] = g[mj][k] = sin * old_ki + cos * old_kj

        g[mi][mi] = cos * cos * ii - 2.0 * sin * cos * ij + sin * sin * jj
        g[mj][mj] = sin * sin * ii + 2.0 * sin * cos * ij + cos * cos * jj
        g[mi][mj] = g[mj][mi] = 0.0

    # 伪逆的奇异值 = 1 / 原奇异值
    inv_sv = []
    for i in range(dim):
        ev = g[i][i]
        if ev > 1e-8:
            inv_sv.append(1.0 / math.sqrt(ev))
    inv_sv.sort(reverse=True)

    print(" ".join(f"{x:.2f}" for x in inv_sv[:5]))

main()

import sys

WORK_DAYS = 22

def check_spaced_high(daily):
    """贪心：能否在22天中选出>=4天步数>30000且相邻选中天间隔>4"""
    picked, prev = 0, -100
    for d in range(WORK_DAYS):
        if daily[d] > 30000 and d - prev > 4:
            picked += 1
            prev = d
            if picked >= 4:
                return True
    return False

def classify(daily):
    """按4条规则依次判断，命中即返回"""
    if check_spaced_high(daily):
        return 1, "excellent"
    above_10k = sum(1 for x in daily if x > 10000)
    if above_10k > 15:
        return 2, "excellent"
    mid_range = sum(1 for x in daily if 5000 < x < 10000)
    if mid_range > 15:
        return 3, "good"
    below_5k = sum(1 for x in daily if x < 5000)
    if below_5k > 18:
        return 4, "bad"
    return 0, None

def main():
    lines = sys.stdin.read().splitlines()
    records = []
    any_valid = False

    for idx, raw in enumerate(lines):
        raw = raw.strip()
        if not raw:
            continue
        any_valid = True
        colon = raw.index(':')
        name = raw[:colon]
        nums_str = raw[colon + 1:].strip()
        nums = [int(x) for x in nums_str.split()] if nums_str else []

        total = sum(nums)
        daily = (nums + [0] * WORK_DAYS)[:WORK_DAYS]

        pri, tag = classify(daily)
        if tag is not None:
            records.append((pri, -total, idx, name, tag, total))

    if not any_valid:
        print("There is no data.")
        return

    records.sort()

    groups = {"excellent": [], "good": [], "bad": []}
    for pri, _, _, name, tag, total in records:
        groups[tag].append(f"{name}:{tag} {total}")

    for cat in ("excellent", "good", "bad"):
        if groups[cat]:
            for line in groups[cat]:
                print(line)
        else:
            print(f"{cat} is null")

main()