Search found 1332 matches

by Jan
Thu Nov 04, 2010 4:52 pm
Forum: Volume 118 (11800-11899)
Topic: 11861 - Explosion
Replies: 6
Views: 4142

Re: 11861-Explosion

2 1 3 means that 2 people are invited and they are 1 and 3. Hope it answers your question.
by Jan
Wed Jul 14, 2010 12:56 pm
Forum: Algorithms
Topic: how to construct all LIS
Replies: 2
Views: 2694

Re: how to construct all LIS

After finding the B[] values for all items in arr[], you can find the max in B[]. Say its index is i. Then the algorithm would be 1) Check from i - 1 to 0 and find the item j such that arr[j] < arr , and B[j] = B - 1. 2) Let i = j and go to step 1. Using this procedure you can find a sequence. For a...
by Jan
Wed Jul 14, 2010 12:49 pm
Forum: Algorithms
Topic: Articulation Point in directed graph.
Replies: 2
Views: 3265

Re: Articulation Point in directed graph.

Can you elaborate a bit? What is the definition of articulation points for directed graph? Say a graph is 1 -> 2 2 -> 3 3 -> 4 4 -> 1 Since if any node is removed, the connectivity gets changed. For example, if 1 is removed we can't go from 4 to 2. So, according to your definition all the nodes are ...
by Jan
Wed Jul 14, 2010 12:14 pm
Forum: Volume 117 (11700-11799)
Topic: 11718 - Fantasy of a Summation
Replies: 2
Views: 2598

Re: 11718 - Fantasy of a Summation

pow() will not work

P.S Use code tags.
by Jan
Tue Jul 06, 2010 2:41 pm
Forum: Volume 116 (11600-11699)
Topic: 11626 - Convex Hull
Replies: 5
Views: 3777

Re: 11626 --getting WA

The output is not same, since the problem states that Start with the point on the hull whose x-coordinate is minimal. If there are multiple such points, start with the one whose y-coordinate is minimal. I am adding some cases including serur's. Input: 3 12 0 0 Y 2 0 Y 1 0 Y 3 0 Y 3 3 Y 1 3 Y 2 3 Y 3...
by Jan
Tue Jun 29, 2010 9:29 pm
Forum: Volume 117 (11700-11799)
Topic: 11735 - Corner the Queens
Replies: 3
Views: 2426

Re: 11735 - Corner the Queens

My idea is same, and it takes .064. I think no constant solutions are available. May be your code is not efficient enough.
by Jan
Tue Jun 29, 2010 6:48 pm
Forum: Volume 117 (11700-11799)
Topic: 11725 - Colorful Board
Replies: 3
Views: 2232

Re: 11725-Colorful Board

My timing is .136.

The idea is, say you have 4 columns, then if the previous row contains (1, 1, 2, 3) or (2, 2, 1, 3) or (2, 2, 1, 4) the result is same. So, calculate once for each pattern.
by Jan
Tue Jun 29, 2010 1:55 pm
Forum: Bugs and suggestions
Topic: Cleaning the Forum
Replies: 1
Views: 2563

Cleaning the Forum

This issue is old, but its necessary. I think that users shouldn't be given permissions to open new threads in the 'Help on the Problemset' section. When new problems will be added, then the moderators will open threads for the problems. Otherwise its tough to maintain the forum clean. I have cleane...
by Jan
Tue Jun 29, 2010 1:25 pm
Forum: Bugs and suggestions
Topic: 489 - Hangman Judge
Replies: 1
Views: 2760

Re: 489 - Hangman Judge

If you think that the data sets are not good enough, you can always send some critical i/o to the admins.
by Jan
Tue Jun 29, 2010 1:22 pm
Forum: Bugs and suggestions
Topic: Problems without Dataset
Replies: 1
Views: 3115

Problems without Dataset

There are some problems which don't have any datasets. Without submitting, its not possible to know whether they have data sets or not. In previous system there was the flag system. But now, its not easy to know whether a problem contains data set or not. Mainly I remember in volume 9, there are man...
by Jan
Tue Jun 29, 2010 1:15 pm
Forum: C++
Topic: Question on execution speed (CPU seconds)
Replies: 4
Views: 2868

Re: Question on execution speed (CPU seconds)

There are other ideas, too. mf has shown some. Some more hints 1) Some functions can be made 'inline'. 2) When passing vectors or stl structures to functions, try to use references. 3) Sometimes non recursive functions improve runtime. 4) For better running time, manual structures (non-stl) help a l...
by Jan
Tue Jun 29, 2010 1:09 pm
Forum: Bugs and suggestions
Topic: Broken Link
Replies: 2
Views: 2806

Broken Link

I think this issue is already stated, but not yet fixed. If you click any user's info, say for my info the link we get is.. http://uva.onlinejudge.org/index.php?option=com_onlinejudge&page=show_authorstats&userid=526 And after clicking it I get the message You are not authorised to view this resourc...
by Jan
Tue Jun 29, 2010 12:59 pm
Forum: Volume 117 (11700-11799)
Topic: 11725 - Colorful Board
Replies: 3
Views: 2232

Re: 11725-Colorful Board

How about mathematical solution?
by Jan
Sat Nov 07, 2009 9:19 pm
Forum: Volume 117 (11700-11799)
Topic: 11721 - Instant View of Big Bang
Replies: 12
Views: 5925

Re: 11721 - "Instant View of Big Bang"

Yes there is a wrong test data. I am sorry. I will send them the new data.

@baodog: In the iiuc contest I used the easier version of the problem. Wanted to upload the O(E) version of the problem in uva. I was busy that time, so couldn't send them the updated one. Sorry again.
by Jan
Sun May 17, 2009 12:30 am
Forum: Volume 101 (10100-10199)
Topic: 10176 - Ocean Deep ! - Make it shallow !!
Replies: 37
Views: 11503

Re: 10176 - Ocean Deep! Make it shallow!!

Use long long.

Go to advanced search