OJ Board

* Wow, this problem is really my nightmare
*
* "If the number of steps is over 50000 print `more than 50000 steps'."
* at first, I miss this sentence and got a dozen of WA...
*
* I try to store the answer as ANSWER[size++]=(...)
* then I check size>50000, but it's quite wrong
* because the ...

Imti wrote: hi,

here is the output from my ac code hope I'm help to U...

p.s this problem is quite easy if you are brave enough to solve it using brute force~

happy coding~

Hi, Admin

I think my solution for this problem is WRONG but also got AC...
maybe the judge don't have the test case below, which I think is really necessary, and important


1
10 0 0 1

the correct output is

0

but my code output

10

because in my code, I have a silly mistake

if(n==0 ...

I just maintained a boolean array of size 10^6 and for each task marked the corresponding indices. When there is any conflict, I just stopped altogether. With this approach, you will just need 10^6 comparisons - which is small enough to pass the time limit.

:oops: Oooooooops...
how silly I am ...

Oh, my god ! I need help...

this problem isn't seems hard ...
but in fact I can't figure out how to solve it excepted for brute force, which directly cause me getting TLE :o

I know

for any two ONE-TIME task, we can use O(n^2) brute force to check whether they are intersect with each other
for ...

what's wrong with this problem?? f (n) = a x 2 + b x + c .... here what should I think?? Is it b*x or 'x' is here for multiplication.If so....where is other variable?? Again..... test cases are also confusing. 3rd and 4th test case are same but answer is different. :-? Plz...help. I got WA. I didn ...

finally got AC with my previous mention method :D

my method is


* b-search and greedy
*
* if the digits before && after "?" is different, we can change the sequence to
* *0?1* -> *0?1* still don't know
* *0??1* -> *0101* ans>=1
* *0???1* -> *01001* ans>=2
* *0????1* -> *010101* ans>=1 ...

hi, all

after struggle for this problem a few days, I still keep getting WA... :-?

my method is quite simple

b-search the answer and greedy

merge '?' with the previous sequence, util I can't merge them , I try to merge '?' with the successive sequence.

any special test case?

I have try what ...

Hi, mpi


I think your data input is invalid. :(

because in the problem description :

Each case contains one number on a line, each with exactly ten digits.


but I will still print out the output from my accepted program


Input : 3.141592654
1 : 3.141592920 = 355 / 113
2 : 3.141630901 ...

Hi ,receme

Can u plz give me some hints on how 2 solve this problem using GREEDY method?

I can't figure out how to reduce the time complex using dynamic programming, in fact, I got TLE using DP

Maybe I have missed some important condition...

thx so much for you help

Oh, I’m so sorry zobayer…

Actually I mean that :
We should read the data using string format, to avoid float point precision error, then output what we have read. (I think this is the most important part in this problem :)

I do it like this:

double var;
char str[20];

scanf("%s",&str);
sscanf(str ...

now , I got AC...
but still don't know why

I just change my reading to

happy coding~

hi, all :

for this problem, seems quite easy at first sight...

but I keep getting WA during the contest and don't know why

any tricks ?

thx in advance

Finally got Ac

the graph can be disconnected actually

happy coding....

Hi, MRH :wink:

My code have passed your data post above, but I still keep getting WA... and don't know why

My algorithm is quite simple:
delete NODE_U from the graph
if I can't visit NODE_V from 0, then NODE_U is Dominator of NODE_V

and here's my main algorithm code


deleted... after got ac ...