OJ Board

CDiMa

Or are these invalid test cases? Thanks. First I must say I didn't try to solve this problem. It is assumed, as a simplification, that no coincidences may occur between coordinates of singular points (intersections or end points). I think this implies your test cases are invalid since the intersect...

CDiMa

probably i didn't get the problem correctly ######### #---### #-### ### # i checked some articles here.. but i still don't know why the answer for that case is not 4 but 1.. I'm not experienced in ASCII art but this should show why the answer is 1... ------------------- \#/#\#/#\#/#\#/#\#/ --------...

CDiMa

Krzysztof Duleba wrote:man va_arg

You are right, but stdarg macros permit to implement functions that work like printf(...).
Actually main doesn't have a variable number of arguments so the original post has a question not well defined

Ciao!!!

Claudio

CDiMa

the output is 0000000000. but when I change the code to "int value=1;", the output is 16843009 16843009 16843009 16843009 16843009 16843009 16843009 16843009 16843009 16843009. Why??!! (I use Visual C++ 6.0) 16843009 expressed in binary is 00000001000000010000000100000001 since you're mem...

CDiMa

I've understand what's wrong with my code Thank u,MDima but here's another problem,my code always get TLE now i even change my graph data structure from adj matrix to adj list,but still got TLE,can u tell me why? is there any wired input data in test case?like a node presented by a string? I don't ...

CDiMa

Morning wrote: yeah,it's dfs,actually.
but it isnt why i got WA,is it?

It is:

Code: Select all

4
1 2 2 3 3 4 1 3
1 2 0 0
0

Your program gives 1 nodes not reachable while it should be 0.

Ciao!!!

Claudio

CDiMa

Morning wrote:

Code: Select all

void bfs(int begin,int ttl)
{
	visited[begin] = 1;
	if(ttl == 0) return;
	int i;
	for(i = 0;i < MAX_NODE;i++)
	{
		if(graph[begin][i] == 1 && visited[i] == 0)
		{
			cnt++;
			bfs(i,ttl - 1);
		}
	}
}

If I understand it correctly your bfs isn't a real bfs...

Ciao!!!

Claudio

CDiMa

CDiMa,i'm afraid ur code is wrong just look at this group of input and output u apply to us 5 1 2 2 3 3 1 4 5 6 2147483647 1 1 ur program's output is 5 which should be 4 isn't it? Hmmm, I applied this sample to my program and it replied 4... Then I rerun my program on the big sample and it replied ...

CDiMa

I use some sort of hashing which is logically wrong, I know that :) Even on a simple test case like this one: 4 1 3 2 4 5 7 14 8 0 my ACC program says "YES" while it should say "NO". That's why I think the test cases of the Judge are pretty weak. Probably you don't handle hash c...

CDiMa

I can see there are about 600 accepted programs for problem 10763. These about 600 accepted programs are coming just from 200-250 people. Well, I am wondering how many people have solved this problem with a really ( with a logically ) correct solution . I am pretty sure the Judge's test data is ver...

CDiMa

A1 wrote:Your algo does not work, I think....

I see...
I believe that either fnpc fixed the message in question or the reinstallation of the board fixed the bug...
The overall strategy may work anyway... find a way to break the board...

Ciao!!!

Claudio

CDiMa

misof wrote:Did anyone notice that an admin may win simply by posting here and locking the thread?

There is a way to win without being an admin and then being banned from the board by an admin

Look at this thead and be gentle with the board!!!

Ciao!!!

Claudio

CDiMa

This is a game!
The rule of this game is :
The first poster of this thread will be winner.

Look, I win!!!

Ciao!!!

Claudio

CDiMa

scanf( const char *format, ... ); must be pointer variables like int* , char *, double*, in the "..." so, scanf("%lf", &p); abhijit correctly used the address of integer variables in his scanf. His problem was exactly answered by his followup. In C undeclared functions are a...

CDiMa

Unfortunately my program does not fail on that test you've given. It prints 3.00 as it should. Well, I know this was a problem with the particular algorithm I used. I mentioned it just in case... Why should sets containing colinear points be of any problem. It is simply an MST problem in which we a...

OJ Board

Search found 214 matches

Re: 866

Re: 585 Triangles.. WA..

Re: Watch this simple program, what's wrong?

I win !! (the proper way!!!)

Re: prototype.