fork download
  1. import sys
  2.  
  3. id = sys.stdin.read().split()
  4.  
  5. n = int(id[0])
  6.  
  7. jobs = []
  8. curr = 1
  9. for _ in range(n):
  10. s = int(id[curr])
  11. f = int(id[curr + 1])
  12. v = int(id[curr + 2])
  13. jobs.append([s, f, v])
  14. curr += 3
  15.  
  16. jobs.sort(key=lambda x: x[1])
  17.  
  18. sdj = [[-1, -1, 0]] + jobs
  19.  
  20. q = [0] * (n + 1)
  21.  
  22. for j in range(1, n + 1):
  23. sj = sdj[j][0]
  24. for i in range(j - 1, 0, -1):
  25. fi = sdj[i][1]
  26. if fi <= sj:
  27. q[j] = i
  28. break
  29. else:
  30.  
  31. q[j] = 0
  32.  
  33. for j in range(1, n + 1):
  34. print(f"q {j} = {q[j]}")
  35.  
Success #stdin #stdout 0.09s 14024KB
stdin
10
3 9 2
5 6 3
1 10 4
4 5 3
6 13 5
4 8 5
3 19 8
6 16 6
9 11 4
3 8 6
stdout
q 1 = 0
q 2 = 1
q 3 = 0
q 4 = 0
q 5 = 0
q 6 = 0
q 7 = 5
q 8 = 2
q 9 = 2
q 10 = 0