Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def go_sample_data():
- sample_data = [None] * 3
- sample_data[0] = {'n': 6,
- 'M': 3,
- 'Znakomstva': [(0, 1), (1, 2), (4, 5)],
- 'k': 2,
- 'Avtopark': [(3, 2), (5, 1)]}
- sample_data[1] = {'n': 6,
- 'M': 0,
- 'Znakomstva': [],
- 'k': 1,
- 'Avtopark': [(6, 5)]}
- sample_data[2] = {'n': 3,
- 'M': 2,
- 'Znakomstva': [(0, 1), (1, 2)],
- 'k': 1,
- 'Avtopark': [(2, 2)]}
- return sample_data
- def imput():
- n = input()
- try:
- n = int(n)
- except:
- return go_sample_data()
- M = input()
- M = int(M)
- Znakomstva = []
- for i in range(M):
- current_input = input()
- Znakomstva.append((int(current_input[0]), int(current_input[2])))
- k = input()
- k = int(k)
- Avtopark = []
- for i in range(k):
- current_input = input()
- Avtopark.append((int(current_input[0]), int(current_input[2])))
- return [{'Znakomstva': Znakomstva, 'Avtopark': Avtopark, 'n': n, 'M': M, 'k': k}]
- def main_function(n, imput, list_taxi):
- res = []
- for i in range(n):
- res.append({i})
- # print (res)
- # for pair in imput:
- # for i in range(len(res)):
- # if pair[0] in res[i]:
- # a = i
- # if pair[1] in res[i]:
- # b = i
- # if a != b:
- # res[a].update(res[b])
- # res.remove(res[b])
- pairs = imput
- for pair in pairs:
- for index, item in enumerate(res):
- if pair[0] in item:
- a = index
- if pair[1] in item:
- b = index
- if a != b:
- res[a].update(res[b])
- res.pop(b)
- # print (res)
- number = []
- for i in res:
- number.append(len(i))
- number.sort(reverse=True)
- tokse = []
- # for i in list_taxi:
- # for _ in range(i[1]):
- # tokse.append(i[0])
- for taxi in list_taxi:
- cars = [taxi[0]]*taxi[1]
- tokse.extend(cars)
- tokse.sort(reverse=True)
- # print (number)
- # print (tokse)
- if len(number) > len(tokse):
- return 0
- else:
- for i in range(len(number)):
- if number[i] > tokse[i]:
- return 0
- return 1
- # main code
- data = imput()
- for item in data:
- print(main_function(item['n'], item['Znakomstva'],item['Avtopark']))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement