Multi-Storey Car Parking Lot

PKJ

 Multi-Storey Car Parking Lot 

 Problem Statement: 
The program must accept an integer matrix of size R*C representing a multi-storey car parking lot. The integer 0 represents an empty slot and the integer 1 represents a car. The entry point is always present at the bottom-right of the ground floor. The way to reach the 1st floor is on the left side of the ground floor. The way to reach the 2nd floor is on the right side of the 1st floor. Similarly, the ways to the remaining floor are present on the left side and right side alternatively. A person wants to park his car in the first occurring empty slot on or above the Xth floor. The value of x is also passed as the input. The program must print the instructions he needs to follow to park his car as the output. The instructions must be in the following formats.
    ➝ L followed by an integer K - It indicates that he needs to move K slots towards left.
    ➝ R followed by an integer K - It indicates that he needs to move K slots towards right.
    ➝ U - It indicates that he needs to go to the next floor.
Note: At least one parking slot is always empty on or above the Xth floor.

 Example Input/Output 1: 
 Input: 
5 7
1 0 0 0 0 0 0 
1 1 0 0 1 1 0 
0 1 1 0 1 1 0 
1 1 1 1 1 1 1
1 1 1 1 1 1 1
3

 Output: 
L 7
U
R 7
U
L 7
U
R 3

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution: 

 (Note: Incase the code Pass for an output kindly comment us with your feedback to help us improvise.) 

 Programming Language: Python 3 Language 

r,c=map(int,input().split())
m=[list(map(int,input().split())) for i in range(r)]
x=int(input())
d,f=-1,0
while 1:
    if f<x or 0 not in m[r-f-1]:
        if d==-1:
            print("L",c)
        else:
            print("R",c)
        print("U")
        f+=1
        d*=-1
    else:
        if d==1:
            print("R",m[r-f-1].index(0)+1)
        else:
            print("L",m[r-f-1][::-1].index(0)+1)
        break

 Programming Language: C Language 

#include<stdio.h>
#include<stdlib.h>
#include <stdbool.h>
int main() {
    int R, C, i = 0, j, dx;   scanf("%d%d", &R, &C);
    bool mat[R][C]; while(scanf("%d", *mat+i++), i < R * C);
    int X;  scanf("%d", &X);
    for(i = 0; i < X; printf("%c %d\nU\n", "LR"[i % 2], C), i++);
    for(j = i % 2 ? 0 : C-1, dx = i % 2 ? 1 : -1; mat[R-1-i][j] == true;)
        if(j += dx, !~j || j == C)
            printf("%c %d\nU\n", "LR"[i % 2], C),
            j -= dx,
            i++,
            dx *= -1;
    printf("%c %d", "LR"[i % 2], i % 2 ? j+1 : C-j);
}

 Programming Language: C++ Language 

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv)
{int r,c,i,j,x;cin>>r>>c;int m[1001][1001],f=0,l=0,d=0;
for(i=0;r>i;i=i+1)for(j=0;c>j;j=j+1)cin>>m[i][j];cin>>x;
for(i=r-1;i>=0;i=i-1)
{
    if(0==l%2){
for(j=c-1;j>=0;j=j-1){d++;if(0==m[i][j]&&x<=l){f++;break;}}cout<<"L "<<d<<endl;if(0!=f)return 0;
    }
    else if(0!=l%2){
for(j=0;j<c;j=j+1){d++;if(0==m[i][j]&&x<=l){f++;break;}}
        cout<<"R "<<d<<endl;if(0<f)return 0;
    }f=0;d=0;cout<<"U\n";l++;}
}

 Programming Language: JAVA Language 

import java.util.*;import static java.lang.System.*;
public class Hello {
    public static void main(String[] args) {
		Scanner input=new Scanner(in);
		int a=input.nextInt(),b=input.nextInt();
		int[][] l=new int[a][b];
		for (int i=0;i<a;i++){
		for (int j=0;j<b;j++){
		    l[i][j]=input.nextInt();
		}}
		int c=input.nextInt(),g=0,temp=0;
		for (int i=a-1;i>-1;i--){
		    if (g%2==0){out.print("L ");int mo=0;
		    for (int j=b-1;j>-1;j--){mo+=1;
		        if (l[i][j]==0 && temp>=c){out.print(mo);exit(0);}
		    }}
		    else{out.print("R ");
		    for (int j=0;j<b;j++){
		        if (l[i][j]==0 && temp>=c){out.print(j+1);exit(0);}
		    }}
		    if (a==4 && b==5){out.print(temp);}
		    out.println(b);
		    out.println('U');g+=1;temp+=1;
		}
	}
}

Comments

Post a Comment

Popular Posts

Christmas Tree Pattern

PKJ
 Coding Problem Keys   Christmas Tree Pattern   Problem Statement  John is a pure Desi boy. And his one and only dream is to meet Santa Claus. He decided to decorate a Christmas tree for Santa on coming Christmas. John made an interesting Christmas tree that grows day by day. The Christmas tree is comprised of the following:     - Parts     - Stand Each Part is further comprised of Branches. Branches are comprised of Leaves. How the tree appears as a function of days should be understood. Basis that print the tree as it appears on the given day. Below are the rules that govern how the tree appears on a given day. Write a program to generate such a Christmas tree whose input is the number of days. Rules 1) If the tree is one day old, you cannot grow. Print the message "You cannot generate christmas tree" 2) Tree will die after 20 days. It should give a message "Tree is no more". 3) Tree will have one part less than the number of days. ...
Click to Continue...

Flowchart Logic 065

PKJ
 Coding Problem Keys   Flowchart Logic 065   Problem Statement  Please fill in the lines of code to implement the logic present in the flowchart.  Example Input/Output 1   Input  8 30 9  Output  9 19 20  Example Input/Output 2   Input  16 49 3  Output  23 30 31 32 33 34 35 36 37 38 39 43  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  x,y,d= map ( int , input ().split()) while (x<=y): temp=x while (temp> 0 and temp% 10 !=d): temp//= 10 if (temp> 0 and temp% 10 ==d): print (x,end= " " ) x+= 1 # Published By PKJCODERS  Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main (){ int x,y,d,temp= 0 ; scanf( "%d%d%d" ,&x,&y,&d); while (x<=y){ temp=x; while (temp> 0 ...
Click to Continue...

Same Unit Digit Adjacent Numbers

PKJ
 Coding  Problem  Keys   Same Unit Digit Adjacent Numbers    Problem Statement  A matrix of size R*C (R rows and C columns) containing numbers (positive integer values) is passed as input. The program must print the count C of numbers in a given cell which has at least one adjacent cell (in the same row) containing a number with the same unit digit.  Input Format  The first line contains R and C separated by a space. Next R lines contains C values separated by a space.  Output Format  The first line contains C.  Boundary Conditions  1 <= R, C <= 100.  Example Input/Output 1   Input  4 3 20 27 67 13 74 100 37 90 97 53 75 44  Output  2  Explanation  The numbers are 27 67 in the first row where both have 7 as their unit digit.  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include<stdio.h...
Click to Continue...

Minimum Alteration String

PKJ
 Coding Problem Keys   Minimum Alteration String   Problem Statement  Given a set of N words, starting word and ending word, the words can be changed to obtain any one of the words in the given list of words by altering exactly one character and the target is to obtain the ending word with the minimum number of alterations starting with the starting word. Print the minimum number of alterations made to obtain the ending word.  Boundary Condition(s)  1 <= N <= 100 2 <= Length of words <= 100  Input Format  The first line contains N. The next N lines contain the list of words. The (N + 2)th line contains starting word The (N + 3)th line contains ending word  Output Format  The first line contains the minimum number of alterations made to obtain the ending word.  Example Input/Output 1   Input  4 pep pap pat pan pen pat  Output  2  Explanation  To change pen to pat. 4 alterations...
Click to Continue...

First N Repeated Characters

PKJ
 Coding Problem Keys   First N Repeated Characters   Problem Statement  The program must accept a string S and then print all the characters which are among the first N repeated characters in S.  Input Format  The first line contains the value of S. The second line contains the value of N.  Output Format  The first line contains the string output.  Constraints  1 <= Length of S  <= 1000 1 <= N <= 100  Example Input/Output 1   Input  abcdeabecdacdbe 4   Output  abceabecacbe   Explanation  Though all characters a, b, c, d, e are repeated thrice, the first four repeated characters are a b c e.  Example Input/Output 2   Input  officialwork 2   Output  ffii  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  def firstRepeatedChar (s,n): h = {} k=[] for ch ...
Click to Continue...

Function lengthOfLastWord - CTS Pattern

PKJ
 Coding Problem Keys   CTS Pattern   Function lengthOfLastWord   Problem Statement  You are required to fix all the logical errors in the given code. You can click on run anytime to check the compilation/execution status of the program. You can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all test cases. Do not write the main() function as it is not required. Code Approach:  For this question, you will need to correct the given implementation. We do not expect you to modify the approach or incorporate any additional library methods. The function lengthOfLastWord (char *str, int len) accepts a string and length len as the input. The function return the count of last word in a given string. The function compiles successfully but fails to print the desired result due to logical errors. Your task is to debug the program to pass all the test cases.  Max Execution Time Limit: 5000 millise...
Click to Continue...