Advertisement
Guest User

Untitled

a guest
Oct 18th, 2019
110
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.71 KB | None | 0 0
  1. from sys import stdin
  2. n,m = map(int,input().split())
  3. qw = [[0 for i in range(n+1)] for i in range(m+1)]
  4. pppp = int(input())
  5. c = set()
  6. for i in range(pppp):
  7. a,b = map(int,stdin.readline().split())
  8. c.add((n+1)*(b-1)+a)
  9.  
  10.  
  11. for i in range(m+1):
  12. for u in range(n+1):
  13. if u == i == 0:
  14. continue
  15. q = []
  16. if (n+1)*(i-1)+u in c:
  17.  
  18.  
  19. q.append(qw[i-1][u-1]+1)
  20. if i != 0:
  21.  
  22.  
  23. q.append(qw[i-1][u])
  24. if u != 0:
  25.  
  26.  
  27. q.append(qw[i][u-1])
  28. qw[i][u] = max(q)
  29. print(int(round((n+m-max(q)*2)*100 + max(q) * (100**2+100**2)**0.5,0)))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement