Advertisement
manish

crap code

Oct 28th, 2019
466
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.55 KB | None | 0 0
  1. n, m = map(int, input().split())
  2. a = list(map(int, input().split()))
  3.  
  4. di = {}
  5. di2 = {}
  6. l = []
  7. for i in range(n):
  8.     di[i+1] = (i,i,i)
  9.     l += [i+1]
  10.     di2[i] = i+1
  11.  
  12.  
  13. for x in a:
  14.     if di[x][2] == 0:
  15.         continue
  16.     else:
  17.         di[x] = [min(di[x][0], di[x][2] - 1), di[x][1], di[x][2]-1]
  18.         di[di2[di[x][2]]] = [di[di2[di[x][2]]][0], max(di[di2[di[x][2]]][2]+1, di[di2[di[x][2]]][1]), di[di2[di[x][2]]][2]+1]
  19.         di2[di[x][2]], di2[di[x][2]+1] = di2[di[x][2]+1], di2[di[x][2]]
  20.  
  21. for p in di:
  22.     print(di[p][0]+1, di[p][1]+1)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement