OJ Board

I am getting the same output but uva judge giving me wrong answer :lol:



/* @JUDGE_ID: 60332ER 11151 Java "Easy algorithm" */

import java.io.*;
import java.util.*;

class Main{
static int[][] result;
static String ReadLn (int maxLg) {
byte lin[] = new byte [maxLg];
int lg = 0, car = -1 ...

sclo wrote: Here, it is not hard to see what the states are and how to go from one state to another state.

.. still i dont understand why it is meant by state. i tried to use insertion sort algorithm, but got WA. can you explain a bit more how I can use graph??

having skimmed through all the replies, i found no easier solution than using C. I also tried with java for my first problem and voila!. Time Limit Exceed.
Actually, it will take me less time to rewrite my code in C/C++ than making my java code faster.

so GO FOR C.. atleast for 24 hours judge.

getting TLE, any idea?? :evil:



would appreciate some help on it, looking forward to write in C if it helps!![code]code removed.. even though not accepted yet!! [/code]

it has been a week here in acm.uva.es, i havent solved a single one

it depends, when it is a football worldcup, i like football. when it is cricket, i like cricket. But as said before, i like programming partly because of the brevity of my social activities ( no offense )

Hi I have been in acm site for 1 week. so i am pretty novice.
i cannot understand the fact how you can use BFS or a Graph for instance in this problem? can anyone explain in brief? :D