OJ Board

Darko

It took a while but it is done now.

Darko

Darko

It is as simple as checking all possible starting positions and checking all 8 directions.

Something is wrong with your implementation.

How about this one:

Code: Select all

2
AA
AA
AAA
0

Darko

Here is another case:

Code: Select all

1000000000 11
E 12
E 9999
N
E 100000001
N
E 10
E 13
E 100000001
N
N
N
0 0

Code: Select all

Darko

Not sure why I even tried this - I have no idea what is wrong with my code. Sorry about the custom I/O, remnants of the old UVa... Also - I used dynamic array sizes, hence a lot of checks. import java.io.IOException; import java.util.ArrayList; import java.util.List; public class Main { private stat...

Darko

This one was re-judged recently and my "solution" was not accepted anymore. I am assuming that someone "fixed" the I/O but I am not quite sure how it is fixed when the statement itself is still ambiguous. In the description section, it is mentioned that roads are visited only onc...

Darko

I apologize if that was me that deleted the account - I had something like "if joined in last 5 days and has more than 5 posts, delete".
I eyeballed the account names, none of them looked legit so I might have missed yours.

Sorry about that.

Darko

Darko

To OP: You are making an assumption that is not stated anywhere - that 0000 is unlocked.
You only start at 0000 and you will only unlock it if it is in the list of keys.

Look at the third example, your solution will produce 24 instead of 26.

Try:
1
2 0001 0009

The answer is 3, not 2.

Darko

Here is one case that I originally failed, maybe it can help others:

Code: Select all

Code: Select all

10 20
10 10

Darko

Code: Select all

public boolean findNum(int[] nums, int theNum)
{
  return Arrays.binarySearch(nums, theNum) >= 0;
}

Darko

OK, this seems to be a bad solution but we will go back to forcing people to go through Q&A every time.

We just cannot keep up with spam.

Darko

Darko

Done.

Darko

This is wrong, PDF should have been changed.

The grammar in its current state does not allow multiplication.

Darko

This one has some precision issues - Can't we remove all the cases where Java and C produce different answers? I just recoded my Java solution in C and got it accepted (after several WAs in Java). Carlos' comment should probably read "If there is an exact answer of 1.225 you should print 1.22 a...

Darko

I am not sure how you think you fixed the start>stop issue but it is not fixed in the code you posted. Try 999999 1 I am not familiar with C++ that much but I am not sure that is how you determine that you reached the end of file. There is a link to a C solution (if you click around the site): http:...

Darko

There is a sticky thread in Volume I but one of the problems you have is that you assume start <= stop.

OJ Board

Search found 579 matches

Re: Forum for Volume XVII and CXXVIII

Re: 422 word search wonder

Re: 12207 - That is Your Queue

Re: 10562 - Undraw the Trees

Re: 10596 - Morning Walk

Re: 10035 - primary arithmetic help!

Re: UVA 1235

Re: What a strange problem: 196!

Re: binary sort in java

Re: bug in board logging in system

Re: Forum for Volume CXXVI

Re: 622 - Grammar Evaluation (pdf error)

Re: 815 - Flooded!

Re: TLE in 3n+1 Problem. Why?

Re: TLE in 3n+1 Problem. Why?