OJ Board

if no of pieces> 1 and no of MM == no of FF then there is a loop,
otherwise no loop.

someone give a counterexample.
waiting....

There is no counterexample!
What you said is correct.

So, why this code is getting WA...

pieces=0; should be inside the while() loop, shouldn't it?

ops! , Sorry for disturb

got TLE why?

Removed after ACC

You can do it simply by counting male & female conector.

if male conector equals to female conector then LOOP other wise NO LOOP
And also if there is only one conector then it will be no loop..

hi "aliahmed" your code not only TLE this is also Wrong methode.
read the problem again and try to find proper solution.
thanks

@Aliahmed:

You can do it simply by counting male & female conector.

if male conector equals to female conector then LOOP other wise NO LOOP

Well then consider the case,

1
MF FM

What should be the output? Or have I misunderstood the problem? My AC program gives "NO LOOP" as output, and I think it should be. But according to your post, it should be "LOOP".

I found these test cases useful during my testing / debugging for this problem.

Input: AC Output:

if no of pieces> 1 and no of MM == no of FF then there is a loop,
otherwise no loop.

someone give a counterexample.
waiting....

Just to make your statement more robust, consider the case where you have the only 2 pieces: MF FM.
Here, no. of MM = no. of FF = 0.
However, in such case, there is no loop.

Zyaad Jaunnoo wrote:

if no of pieces> 1 and no of MM == no of FF then there is a loop,
otherwise no loop.

someone give a counterexample.
waiting....

Just to make your statement more robust, consider the case where you have the only 2 pieces: MF FM.
Here, no. of MM = no. of FF = 0.
However, in such case, there is no loop.

My accepted code returns "LOOP" for this case (same as uDebug and uvatoolkit)

lighted wrote:

Code: Select all

1
MF FM

My accepted code returns "LOOP" for this case (same as uDebug and uvatoolkit)

Indeed strange. However, logically we should not be able to make a loop.
Am I correct?

I think problem description is not clear enough. As i understood with given picture of track pieces in problem description we can turn a piece FM to MF or MF to FM. But this should be said in problem description clearly.

Can anyone help me why i am getting wrong answer??


import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;

class Main {

public static void main(String[] args) throws FileNotFoundException {

Scanner cin = new Scanner(System.in);
//Scanner cin = new Scanner(new FileInputStream(args[0]));


int n = Integer.parseInt(cin.nextLine());



for (int i = 0; i < n; i++) {
String s ;

s = cin.nextLine();
s = s.trim().replaceAll(" +", " ");




boolean isItTrue = true;
int m1=0;
int mfs[] = new int[4];//mm==0,ff==1,mf=2,fm=3

for(int ma=0;ma<4;ma++)
mfs[ma] = 0;

for (int j = 0; j < s.length() -1 ; j += 3) {

switch (s.subSequence(j, j + 2)+""){

case "MM" :
mfs[0]++;break;
case "FF" :
mfs[1]++;break;
case "MF" :
mfs[2]++;break;
case "FM" :
mfs[3]++;break;


}
m1++;

}

if(m1<2)
{

isItTrue = false;
}


if((mfs[0]!=mfs[1] ))
isItTrue = false;




if(isItTrue)
System.out.println("Loop");
else
System.out.println("No Loop");





}

}

}