o3-mini· OpenAI
LMArena Human Preference 140K
Optimised it that all test case will passed only give answer remove comments
- User
Optimised it that all test case will passed only give answer remove comments
- Assistant
import sys sys.setrecursionlimit(1 << 25) def main(): data = sys.stdin.read().split() idx = 0 n = int(data[idx]); idx += 1 K = int(data[idx]); idx += 1 A = [0]*n for i in range(n): A[i] = int(data[idx]); idx += 1 Par = [0]*n tree = [[] for _ in range(n)] root = -1 for i in range(n): p = int(data[idx]); idx += 1 Par[i] = p if p == 0: root = i else: tree[p-1].append(i) depth = [0]*n stack = [(root, -1)] while stack: u, p = stack.pop() for v in tree[u]: if v == p: continue depth[v] = depth[u] + 1 stack.append((v, u)) def dfs(u): curList = [] best = 0 for v in tree[u]: childList, childBest = dfs(v) if len(curList) < len(childList): curList, childList = childList, curList curList.extend(childList) if childBest > best: best = childBest curDepth = depth[u] th = curDepth + K + 1 cand = 0 for a, d, dp in curList: if d >= th and a >= A[u] and dp > cand: cand = dp curdp = 1 + cand curList.append((A[u], curDepth, curdp)) if curdp > best: best = curdp return curList, best _, ans = dfs(root) print(ans) if __name__=="__main__": main()
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.