OJ Board

Got 4 WAs to find out that the last line of output should be equal to an empty line...

Some help for others:
Input #1: Input #2: Good luck!

Finally solved it. :lol: Used JAVA BitSet to check if we already visited point... and thanks for idea about combining 2 integers. really nice! Got AC in 1.020 import java.util.BitSet; import java.io.InputStreamReader; import java.io.IOException; import java.io.BufferedReader; import java.io.OutputSt...

wow! thanks for such idea about combining two integers... I'll try ! I optimized my JAVA code and got AC in 1.084 sec. I used BufferedReader and BufferedWriter. A faster way to combine two integers is to use shift and bitwise and. I kept the distance in it's own 2-D array and placed x and y into the...

Can you show your JAVA solution? maybe we can make it faster?
and the last question: my algo is ok?

brianfry713 wrote:My C++ code that got AC in 0.752 sec I rewrote in JAVA and got TLE.

hey! Its really impossible to solve this problem using class Pair and each time creating a new object... so I decided to encode coordinates X, Y and distance in one number (it was "long"). I took 1997 because it doesnt matter at all... I have just tested and had all the time TLE. But for s...

Nothig... just TLE... is it possible to solve in java? I am using BFS from all the points from the first mall and when I rich any point from second mall - output the answer and exit. am I doing something wrong? or I have TLE 'cause the input data is so large? Thanks. Here is my code: http://paste.ub...

Nothing wrong, but we should remember that second line (aka MST of K+M edges) should be min(cost_before, cost_after).

Shafaet_du wrote:Whats wrong with problem description? just add the costs of first N-1 inputs,and thats the first output. find MST of last K+M inputs,thats the 2nd output.

brianfry713 wrote:Your input is not valid. The malls do not intersect, even in one point. I tested the judge's input.

thank you very much! Ill try with this ...

Thank you for replying! But why its 1 instead of 0 or 2 on this test case: 4 0 0 0 1 1 1 1 0 6 3 2 3 1 2 1 1 1 1 2 2 2 we have 2 blocks which intersect just in 1 dot, so what we should count - minimal blocks which should walk Kim or minimal crosses of streets/avenues ? My AC output for the input you...

Can someone help me with this problem? I am always getting WAs... is this output|input data is correct? INPUT 4 0 0 0 1 1 1 1 0 6 4 3 4 2 3 2 2 2 2 3 3 3 4 0 0 0 1 1 1 1 0 6 3 2 3 1 2 1 1 1 1 2 2 2 4 0 0 0 1 1 1 1 0 6 2 2 2 1 1 1 0 1 0 2 1 2 0 OUTPUT: 2 2 1 Here is my code: http://paste.ubuntu.com/1...

huh... solved
remember, that last line should be an empty line.

good luck!

Hai! Thanks for reply. When I send my code, I change System.getProperty("ONLINE_JUDGE") != null); to console(true);//System.getProperty("ONLINE_JUDGE") != null); and it uses console... so its not a problem. I am getting crazy solving this problem... :evil: Don't read and write to...

realy crazy output :lol: had to submit for 100500 time ... LAST line should be empty in your output. I thought that the problem was in reading input... but its ok. first you can read all input data except empty lines... after that - parse it and solve. example from my code: ArrayList<String> input =...

I am getting crazy solving this problem... :evil: here is my code: http://paste.ubuntu.com/1023130/ I have tested ALL data that I found here... I have checked my algo with all possible and impossible test cases... works OK... but system shows me WA. Really need help. Thx. import java.io.*; //import ...

I have send many codes for http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=400&mosmsg=Submission+received+with+ID+10174951 problem... Why I have WA instead of RE ? import java.io.*; //import java.math.BigInteger; import jav...