拼多多 7.2 笔试真题 - 大模型算法岗

import sys
input = sys.stdin.readline

def solve():
    m, n = map(int, input().split())
    mat = [list(map(int, input().split())) for _ in range(m)]

    res = []
    for g in range(m + n - 1):
        d = (m - 1) - g
        lo = max(0, d)
        hi = min(m - 1, n - 1 + d)
        order = range(hi, lo - 1, -1) if g % 2 == 0 else range(lo, hi + 1)
        for i in order:
            res.append(mat[i][i - d])

    print(" ".join(map(str, res)))

solve()

import sys
input = sys.stdin.readline

def solve():
    n = int(input())
    watch = [[] for _ in range(n + 1)]
    for _ in range(n):
        parts = list(map(int, input().split()))
        x, m = parts[0], parts[1]
        watch[x] = parts[2:2 + m]

    monitored_by = [set() for _ in range(n + 1)]
    for j in range(1, n + 1):
        for r in watch[j]:
            if 1 <= r <= n and r != j:
                monitored_by[r].add(j)

    alive = [i > 0 for i in range(n + 1)]
    cnt = n

    def kill(i):
        nonlocal cnt
        alive[i] = False
        cnt -= 1
        for r in watch[i]:
            if 1 <= r <= n:
                monitored_by[r].discard(i)

    changed = True
    while changed:
        changed = False
        for i in range(1, n + 1):
            if alive[i] and not monitored_by[i]:
                kill(i)
                changed = True
        if changed:
            continue
        for i in range(1, n + 1):
            if alive[i] and len(monitored_by[i]) == 1:
                j = next(iter(monitored_by[i]))
                if alive[j] and monitored_by[j] == {i}:
                    kill(i)
                    kill(j)
                    changed = True
                    break

    print("SUCCESS" if cnt == 0 else cnt)

solve()

import sys
from collections import deque
input = sys.stdin.readline

def solve():
    n = int(input())
    c = [0] + list(map(int, input().split()))
    a = [0] + list(map(int, input().split()))

    indeg = [0] * (n + 1)
    for i in range(1, n + 1):
        indeg[a[i]] += 1

    # 拓扑剥离：入度为 0 的是树枝末端
    removed = [False] * (n + 1)
    q = deque(i for i in range(1, n + 1) if indeg[i] == 0)
    while q:
        u = q.popleft()
        removed[u] = True
        v = a[u]
        indeg[v] -= 1
        if indeg[v] == 0 and not removed[v]:
            q.append(v)

    # 遍历每个环取最小代价
    visited = [False] * (n + 1)
    ans = 0
    for i in range(1, n + 1):
        if not removed[i] and not visited[i]:
            mn = c[i]
            visited[i] = True
            x = a[i]
            while x != i:
                visited[x] = True
                if c[x] < mn:
                    mn = c[x]
                x = a[x]
            ans += mn

    print(ans)

solve()

import sys
import json
import numpy as np

def solve():
    data = json.loads(input())
    img = np.array(data['image_embeds'], dtype=np.float64)
    txt = np.array(data['text_embeds'], dtype=np.float64)
    temperature = float(data['temperature'])

    logits = img @ txt.T / temperature

    def cross_entropy(mat):
        row_max = mat.max(axis=1, keepdims=True)
        log_sum = row_max[:, 0] + np.log(np.exp(mat - row_max).sum(axis=1))
        diag = np.diag(mat)
        return float((log_sum - diag).mean())

    loss = (cross_entropy(logits) + cross_entropy(logits.T)) / 2.0
    print(f"{loss:.6f}")

solve()