My Accepted Program shows that
Case #15: 0.6875
Case #24: 0.6875
On 2013/5/5 2:33, zach polansky wrote:
Can someone tell me what is wrong???
Input:
100
20 -2 4
3 -2 0
12 0 0
14 4 0
18 2 0
10 -4 0
5 0 2
16 0 0
18 0 4
11 0 0
17 0 2
15 4 0
6 -1 1
6 -2 2
10 3 1
5 0 2
1 0 682
10 2 2
5 9996 0
12 2 0
I think you can use
System.setIn(new FileInputStream(code_jam_input_file.txt));
System.setOut(new PrintStream(code_jam_output_file.txt));
These two line should let you read from txt file and write to a txt file.
Parker
On 2013/3/30 21:37, Chandra Sekhar wrote:
Hi All,
I am going to
Hey, you forgot to clear Weight[i] for different test case before
pushing new edges for new cities ! !
:)
and FastIO is not needed.
Parker
On 2012/12/23 11:25, thefourtheye dIVi wrote:
Hi,
I think this is one of the simple problems which would have got a lot
TLEs.
This is what I do,
which gets me WA?
But 19998 is a very valid input... :(
On Mon, Dec 17, 2012 at 3:40 AM, ZHANG Xiongqi, Parker
zhangxion...@gmail.com mailto:zhangxion...@gmail.com wrote:
Hi thefourtheye dIVi,
Basically your idea is correct and this problem can be solved
using BFS.
However
Hi thefourtheye dIVi,
Basically your idea is correct and this problem can be solved using BFS.
However, it is not sufficient to use unsigned long long to solve this
problem because the answer to 19998 is
0 which is much larger than the
maximum number that
The concatenating of list(si) would have a size of O(mn) at worst case
and even the O(n logn) algorithm for solving the longest increasing
subsequence will not be fast enough.
Please tell me I am wrong. =w=
Parker
On 2012/12/17 9:28, Luís Fernando Dorelli de Abreu wrote:
Given the limits,
Agree with Neal
To read till the end of file, I would suggest to use
while (cin str1 str2) {
..
}
and then there is no need to take care of the last 'endl'.
the following code give me accepted.
http://ideone.com/ORzXcK
Parker
On 2012/12/13 13:34, Neal Zane wrote:
Not sure but could be
Basically, you have a wrong comparator for the sort function.
/***
int cmp (point item1, point item2)
{
if (item1.x == item2.x)
{
return (item1.y = item2.y);
}
return item1.x item2.x;
}
***/
This is what you truly need.
Parker
On 2012/12/5 14:36, thefourtheye dIVi
To Amir Hossein Sharifzadeh,
You should always name your class as Main (case sensitive, not main or
MAIN) as online judge will put your code into the file named Main.java
i.e. you should write the following class
public class Main {
}
Parker
On 2012/12/6 5:50, Morgan Bauer wrote:
Exactly
same here.
I still have not received.
2012/10/27 Luís Fernando Dorelli de Abreu lfdore...@gmail.com
mailto:lfdore...@gmail.com
Is it only me or there is someone else who still haven't got the
T-shirt?
2012/9/19 Bartholomew Furrow fur...@gmail.com
mailto:fur...@gmail.com
10 matches
Mail list logo
