OJ Board

Actually the problem limits are too loose. It should disallow O(V^2) type of solutions. It should be O(V).

1) The better solution is first construct SCC (strongly connected components), as well as the DAG after SCC decomposition.

2) Perform bellman ford negative cycle detection on only one node ...

Would you like to share your approach for this problem?

@gaurav2289: My approach is like, extract the kernel DAG of the graph using Tarjan's algorithm. Then, run Bellmann-Ford for each strongly connected component (aka: SCC) and see if there is a negative cycle. If there is, then the cycle is ...

@gaurav2289:

I think you are idea is correct when there is only one negative cycle. Try with:


1000 9
10 11 -10
11 12 -10
12 10 10
998 999 -10
999 998 9
800 12 1000
750 999 1000
750 111 -1000
111 750 1000


The correct output is:


Case 1: 10 11 12 111 750 800 998 999


@admins:

I think the ...

The auto-login works in google chrome.

Hi people.

This is just to report a small bug in the problem statement (http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=8&category=14&page=show_problem&problem=1190). In the Output section:


In case of a successful arrangement print M additional lines where the i ...

Carlos wrote:That manual is phpbb2, we're using phpbb3.

I've modified the cookies setting, can you please try again to see if it works now?

No, not working yet. I checked the cookie settings in my browser, and they are ok. Let me see if I can try that in our forum.

I found something about the auto-login configuration in the phpBB documentation:

http://www.phpbb.com/support/documentat ... ction3_2_2

Read the item labeled "Allow automatic logins", have you tried this?

The only problem I found is that the Auto-Login does not work, even if I mark the check box before logging in, when I open the forum I have to login again. Is this intentional? We (our university judge team) started a private forum like this one (using this phpBB version), and the auto-login does ...

A1 wrote:I want to add some more:
[*] In browse problem page, If it is possible then please make the default display number = 50.(I think it is not going to cost much)

I think that changing it to 100 would be even better .

thx for ur reply
but actually i did use int main() {...return 0;} and still got CE
i'm now confused

I've got some compilations errors too, but I managed to discover where. For example, this code gives CE (in C++):


struct XXX {
static const int YYY = 10;
};


Instead, you have to do ...

The admins added it . Thanks to the admins, now I will have 75% less REs.

mf wrote:So there must something wrong with the input file, or new server. Or maybe his buffer sizes are just too small.

I doubt it is my buffer size, I use the same size in my AC program.

Hi everybody. Can someone check the input for this problem. I submitted this code to the new server:

#include "stdio.h"

int main() {
static char buffer[1000000];
int cnt = 0;
while (fgets(buffer, 1000000, stdin) != NULL)
+cnt;
if (cnt % 2 != 0) {
char* c = NULL;
*c = '\0';
}
return 0 ...

Hi everybody. In the old system you used to define a ONLINE_JUDGE macro to make reading from file at home and from stdin at the OJ without problems. However, that flag is not declared anymore in the new sysem. Will it be added?

I used differents formulas for the King and the Knight.