Archery Game

PKJ

 Coding Problem Keys 

 Archery Game 

 Problem Statement 

In an archery game, a bow and arrow is used to aim at the center of the circular target. The points are awarded based on how close the arrow hits the center of the target. The points for a shoot is calculated by the formula (3 - DISTANCE FROM CENTER OF THE TARGET) * 100. The target has radius of 3 units and any arrow hitting outside of the target will result in 0 points. Given N records with archer's name and the arrow's landing coordinates print the leaderboard (sorted by the total points, with highest score first) rounded up to 2 decimal places. The archers name could be repeated as a single archer can shoot multiple times.

 Boundary Conditions 

1 <= N <= 1000.

 Input Format 

First line contains N.
Next N lines contain the archers name and arrow's landing coordinates separated by a space.

 Output Format 

D lines containing the name of the archer and their total points scored separated by a space. D denotes the unique archers count.

 Example Input/Output 1 

 Input 

6
Ravi 1 1
Ravi 2 2
Ram 0.4 0.3
Divya 1.3 2.5
Divya 2.5 3.4
Ram 0.2 0.4

 Output 

Ram 505.28
Ravi 175.74
Divya 18.22

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=int(input());f=[];s=[];k=[]
for i in range(n):
    a,x,y=input().split()
    x=float(x);y=float(y);dis=(x*x+y*y)**0.5
    if int(dis)>=3 or x>3 or y>3:s+=[[a,0]];continue;
    res=(3-dis)*100;s+=[[a,res]]
for i in range(len(s)):
    for j in range(len(s)):
        if i!=j and s[i][0]==s[j][0]:
            s[i][-1]+=s[j][-1]
for i in s:
    if i[0] not in k:
        k.append(i[0])
        f.append(i)
f=sorted(f,key=lambda x:x[-1]);f=f[::-1]
for ele in f:
    print(ele[0],"%.2f"%ele[-1])
#Published By PKJCODERS

 (Note: Incase If the code Doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Integer & Alphabet Pair Pattern

PKJ
 Coding Problem Keys    Integer & Alphabet Pair Pattern    Problem Statement  The program must accept an integer N as the input. The program must print the desired pattern as shown in the Example Input/Output section.  Input Format  The first line contains N.  Output Format  The first N lines containing the desired pattern as shown in the Example Input/Output section.  Boundary Condition(s)  2 <= N < 50  Example Input/Output 1   Input  3   Output  1a 2b 3c 4d 5e 6f 7g 8h 9i  Example Input/Output 2   Input  6   Output  1a 2b 3c 4d 5e 6f 7g 8h 9i 10j 11k 12l 13m 14n 15o 16p 17q 18r 19s 20t 21u 22v 23w 24x 25y 26z 27a 28b 29c 30d 31e 32f 33g 34h 35i 36j  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  n= int ( input ()) s= 0 ;c= 0 k= "abcdefghijklmnopqrstuvwxyz" for i in range (n):...
Click to Continue...

Pattern Printing Middle Letter - Odd Length String

PKJ
 Coding Problem Keys   Pattern Printing Middle Letter - Odd Length String   Problem Statement  An odd length string S is passed as the input. The program must print the pattern as described below. Let L be the length of the string and M denote the middle position of the string S. The characters in the string are a(1),...., a(M), .... a(L).     - The first line will contain the middle letter a(M) of S in the extreme right.     - Then in each subsequent line, the letter after the middle letter from a(M + 1) to a(L) is appended to the line output.     - After the end of the string a(L) is reached, in each subsequent line, the letters from the beginning to the middle letter, a(1) to a(M-1) are appended to the line output. Note: Asterisk * will be used to pad in the front so that each line has L characters.  Input Format  The first line contains the S.  Output Format  L lines as output where L is the length of t...
Click to Continue...

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...

Plant Growth Calculation 001

PKJ
 Coding Problem Keys   Plant Growth Calculation 001   Problem Statement  In a matrix containing R rows and C columns, various plants are planted. The growth of a given plant in a calendar month depends on it's current height at the beginning of the month. If the current height is a prime number, the height by which the plant grows in that month is equal to the current height minus previous prime number (If there is no previous prime number consider the previous prime number as zero). If the current height is not a prime number then the height by which the plant grows in that month is equal to the sum of unit digits of the adjacent plants height at the beginning of the month (If there is no adjacent plant to left or right consider the value as zero). Given the current height of the plants at the beginning of first month, print the height of the plants after N months.  Boundary Condition(s)  1 <= R, C <= 999 1 <= N <= 100 1 <= Initial...
Click to Continue...

Matrix Columns - Largest Integer

PKJ
 Coding Problem Keys   Matrix Columns - Largest Integer   Problem Statement  The program must accept a matrix of size R*C containing distinct values and print the columns which are having a value which is the largest in a given row.  Boundary Condition(S)  2 <= R, C <= 50 1 <= Matrix element value <= 10 ⁵  Input Format  The first line contains  R and C separated by a space. The next R lines, each contains C integers separated by a space.  Output Format  The first R lines contain the integer values based on the given conditions.  Example Input/Output 1   Input  4 5 60 100 59 46 70 90 64 11 91 88 86 51 7 37 89 23 34 32 20 2  Output  100 46 70 64 91 88 51 37 89 34 20 2  Explanation  Max value in Row 1 is 100 which is in column 2 . Max value in Row 2 is 91 which is in column 4 . Max value in Row 3 is 89 which is in column 5 . Max value in Row 4 is 34 which is in column 2...
Click to Continue...

Mango Distribution

PKJ
 Coding Problem Keys   Mango Distribution   Problem Statement  Given a number of mangoes and number of persons. Find the number of ways to distribute the identical mangoes among identical persons.  Input Specification  input1: the number of mangoes input2: the number of persons.  Output Specification  Return the number of ways to distribute identical mangoes among identical persons.  Sample Input/Output 1   Input  input1: 2 input2: 2   Output  Output: 3   Explanation  All possible distributions of 2 identical mangoes to 2 identical persons are (1, 1), (2, 0) and (0, 2). Hence the output is 3.  Sample Input/Output 2   Input  input1: 1 input2: 12  Output  Output: 12   Output  All possible distributions of 1 identical mango to 12 identical persons are 12. Hence the output is 12.  Solution   Programming Language: Python 3 Language  def nu...
Click to Continue...