第1题-基于决策树预判资源调配优先级 - problem_ide - CodeFun2000

主要是把题看懂
python
class Node:
def __init__(self,feature_index,threshold,left,right,label):
self.feature_index = feature_index
self.threshold = threshold
self.left = left
self.right =right
self.label =label
f,m,n = map(int,input().split())
tree = []
for _ in range(m):
fi,thr,l,r,lbl = input().split()
tree.append(Node(int(fi),float(thr),int(l),int(r),int(lbl)))
for _ in range(n):
features = list(map(float,input().split()))
current = 0
while True:
node = tree[current]
if node.feature_index == -1:
print(node.label)
break
if features[node.feature_index] <= node.threshold:
current = node.left
else:
current = node.right