Google - Foobar challenge

h_sh · May 2, 2020, 7:59am

Here is my code
I thought to solve this using mirror image so I create all 8 mirror of given position and then try to find distance between guard_position in every mirror with some constrain as per question but something is went wrong can you help me?
Here is a question link

github.com

nkapliev/google-foo.bar/blob/master/problems/4.1_bringing_a_gun_to_a_guard_fight.py

"""
Bringing a Gun to a Guard Fight
===============================

Uh-oh - you've been cornered by one of Commander Lambdas elite guards! Fortunately, you grabbed a beam weapon from an abandoned guardpost while you were running through the station, so you have a chance to fight your way out. But the beam weapon is potentially dangerous to you as well as to the elite guard: its beams reflect off walls, meaning youll have to be very careful where you shoot to avoid bouncing a shot toward yourself!

Luckily, the beams can only travel a certain maximum distance before becoming too weak to cause damage. You also know that if a beam hits a corner, it will bounce back in exactly the same direction. And of course, if the beam hits either you or the guard, it will stop immediately (albeit painfully).

Write a function answer(dimensions, your_position, guard_position, distance) that gives an array of 2 integers of the width and height of the room, an array of 2 integers of your x and y coordinates in the room, an array of 2 integers of the guard's x and y coordinates in the room, and returns an integer of the number of distinct directions that you can fire to hit the elite guard, given the maximum distance that the beam can travel.

The room has integer dimensions [1 < x_dim <= 1000, 1 < y_dim <= 1000]. You and the elite guard are both positioned on the integer lattice at different distinct positions (x, y) inside the room such that [0 < x < x_dim, 0 < y < y_dim]. Finally, the maximum distance that the beam can travel before becoming harmless will be given as an integer 1 < distance <= 10000.

For example, if you and the elite guard were positioned in a room with dimensions [3, 2], you_position [1, 1], guard_position [2, 1], and a maximum shot distance of 4, you could shoot in seven different directions to hit the elite guard (given as vector bearings from your location): [1, 0], [1, 2], [1, -2], [3, 2], [3, -2], [-3, 2], and [-3, -2]. As specific examples, the shot at bearing [1, 0] is the straight line horizontal shot of distance 1, the shot at bearing [-3, -2] bounces off the left wall and then the bottom wall before hitting the elite guard with a total shot distance of sqrt(13), and the shot at bearing [1, 2] bounces off just the top wall before hitting the elite guard with a total shot distance of sqrt(5).

Languages
=========

To provide a Python solution, edit solution.py
To provide a Java solution, edit solution.java

This file has been truncated. show original

import math
def solution(dimensions, your_position, guard_position, distance):
    our_p =[]
    our_p.append(your_position)
    ux=your_position[0]
    uy=your_position[1]+2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    our_p.append(ex)
    
    ux=-your_position[0]
    uy=your_position[1]+2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    our_p.append(ex)
    
    ux=your_position[0] +  2*(dimensions[1]-your_position[1])
    uy=your_position[1] +2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    our_p.append(ex)
    
    ux=your_position[0] +  2*(dimensions[1]-your_position[1])
    uy=-your_position[1] #+2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    our_p.append(ex)
    
    ux=-your_position[0] #+  2*(dimensions[1]-your_position[1])
    uy=-your_position[1] #+2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    our_p.append(ex)

    
    dx=your_position[0]
    dy=-your_position[1]
    ex = []
    ex.append(dx)
    ex.append(dy)
    our_p.append(ex)

    ly=your_position[1]
    lx=-your_position[0] #-2*(dimensions[0]-your_position[0])
    ex = []
    ex.append(lx)
    ex.append(ly)
    our_p.append(ex)
    
    ly=your_position[1]
    lx=your_position[0] + 2*(dimensions[0]-your_position[0])
    ex = []
    ex.append(lx)
    ex.append(ly)
    our_p.append(ex)
    # print our_p
    
    guard_p=[]
    guard_p.append(guard_position)
    
    
    ux = guard_position[0]
    uy=guard_position[1]+2*(dimensions[1]-guard_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    guard_p.append(ex)
    
    dx=guard_position[0]
    dy=-guard_position[1]
    ex = []
    ex.append(dx)
    ex.append(dy)
    guard_p.append(ex)

    ly=guard_position[1]
    lx=-guard_position[0] #-2*(dimensions[0]-your_position[0])
    ex = []
    ex.append(lx)
    ex.append(ly)
    guard_p.append(ex)
    
    ly=guard_position[1]
    lx=guard_position[0] + 2*(dimensions[0]-guard_position[0])
    ex = []
    ex.append(lx)
    ex.append(ly)
    guard_p.append(ex)
    
    
    
    
    
    
    ux=-guard_position[0]
    uy=guard_position[1]+2*(dimensions[1]-guard_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    guard_p.append(ex)
    
    ux=guard_position[0] +  2*(dimensions[1]-guard_position[1])
    uy=guard_position[1] +2*(dimensions[1]-guard_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    guard_p.append(ex)
    
    ux=guard_position[0] +  2*(dimensions[1]-guard_position[1])
    uy=-guard_position[1] #+2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    guard_p.append(ex)
    
    ux=-guard_position[0] #+  2*(dimensions[1]-your_position[1])
    uy=-guard_position[1] #+2*(dimensions[1]-your_position[1])
    ex = []
    ex.append(ux)
    ex.append(uy)
    guard_p.append(ex)
    
    # print guard_p
    count=0
    
    for j in guard_p:
        # print i,j
        # print(math.sqrt( abs((i[0]-j[0])*(i[0]-j[0])  ) + abs((i[1]-j[1])*(i[1]-j[1]) )))
        k=0
        no=0
        for i in our_p:
            if k==0:
                k+=1    
                continue
            d1=math.sqrt( abs((your_position[0]-i[0])*(your_position[0]-i[0])  ) + abs((your_position[1]-i[1])*(your_position[1]-i[1]) ) )
            d2=math.sqrt( abs((i[0]-j[0])*(i[0]-j[0])  ) + abs((i[1]-j[1])*(i[1]-j[1]) ) )
            d3=math.sqrt( abs((your_position[0]-j[0])*(your_position[0]-j[0])  ) + abs((your_position[1]-j[1])*(your_position[1]-j[1]) ) )
            
            if(d3==d1+d2):
                # print d1+d2
                no=1
                continue
        if(no==1):
            continue
        if(math.sqrt( abs((your_position[0]-j[0])*(your_position[0]-j[0])  ) + abs((your_position[1]-j[1])*(your_position[1]-j[1]) ) ) <=distance):
            count+=1
    # count = count - 2
    # print count
    return count
    
    
print(solution([3,2], [1,1], [2,1], 4))