Search found 63 matches

by SRX
Sun Dec 03, 2006 2:46 pm
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 40946

mogers wrote:
SRX wrote:oops ........
if you read input with "scanf" , then it use 3 secs to read ,
so those who got tle shoud find a fast input way ...
by the way, you could tell us how :P :P
ok , if your language is C or C++ , then "gets" will help you :P
by SRX
Sun Dec 03, 2006 6:07 am
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 40946

oops ........
if you read input with "scanf" , then it use 3 secs to read ,
so those who got tle shoud find a fast input way ...
by SRX
Tue Nov 28, 2006 5:25 pm
Forum: Volume 106 (10600-10699)
Topic: 10627 - Infinite Race
Replies: 10
Views: 7141

Can someone give me the correct output of the input in the following ?
thanks!

Code: Select all

50 32 35 20
100 22 13 31 
24 12 41 15
467 35 231 122 
36 12 24 24
0 1 2 3  
by SRX
Sun Oct 29, 2006 7:21 am
Forum: Volume 111 (11100-11199)
Topic: 11140 - Little Ali's Little Brother!
Replies: 28
Views: 14160

Thanks to you , navid_a2b !!!!

Your first test case saved my program , haha :D !
by SRX
Sat Oct 28, 2006 1:51 pm
Forum: Volume 111 (11100-11199)
Topic: 11140 - Little Ali's Little Brother!
Replies: 28
Views: 14160

Can someone give me more test cases ? thanks !!

My program is still "Wrong Answer" and I have tested all test cases in the forum .
by SRX
Mon Oct 16, 2006 5:27 pm
Forum: Bugs and suggestions
Topic: 11021 the judge is wrong ?
Replies: 1
Views: 1318

11021 the judge is wrong ?

Hi , actually I have solved it few months ago , but when I finished "11121" and submitted it to the judge system , I found that I typed a wrong problem number , 11021 . The probelm is that I submitted "11021" problem number by my "11121" program , and I got AC from it with a 0.000000 running time . ...
by SRX
Mon Oct 16, 2006 2:36 pm
Forum: Volume 111 (11100-11199)
Topic: 11125 - Arrange Some Marbles
Replies: 20
Views: 14005

Usually i don't include <cstring>, memset doesn't need it on VC++ and GCC if i remember correctly, but the wierd thing is that i tried to submit the problem now with memset and without including any additional headers and got AC! anyway i'll try cstring the next time i got compilation error for mem...
by SRX
Sun Sep 10, 2006 12:09 pm
Forum: Volume 110 (11000-11099)
Topic: 11088 - End up with More Teams
Replies: 30
Views: 17696

11088 - End up with More Teams

I have solved this problem with backtracking .

But I have some questions .
Can we solve it with greedy algorithm ?
Can someone give me some cases that greedy algorithm dosen't work ??

thanks :D
by SRX
Sun Sep 03, 2006 7:00 pm
Forum: Volume 110 (11000-11099)
Topic: 11082 - Matrix Decompressing
Replies: 28
Views: 12468

matrix entry range [1,20], so i assign capacity 20 to each edge joining row and column, but how to tackle the lower part, if i run simple ford-fulkerson, any matrix entry could be 0, but i have to take care about it, please help me matrix entry range [1,20], so i assign capacity 20 to each edge joi...
by SRX
Wed Aug 16, 2006 6:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11071 - Permutation Representation
Replies: 17
Views: 9624

A little hint: If you keep a pointer at the currently last element (elements n, n-1, ... i+1 are are already placed at their correct position and we don't care about them anymore). Then, we are interested in the number of elements which are in between element i and the currently last element (this ...
by SRX
Wed Aug 16, 2006 2:56 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17219

Hector_Hsu wrote:My prog outputs the same..

any other inputs~? plz >"<
hi , I read my program again and I found one thing .

does your execution maintain dis(i,i)=0 ?
by SRX
Tue Aug 15, 2006 4:05 pm
Forum: Volume 110 (11000-11099)
Topic: 11071 - Permutation Representation
Replies: 17
Views: 9624

Re: 11071 need some explanations

a O ( n^2 ) solution is easy to find out , but n<=200000 .

Can someone give me a little hint about what is the
element in element i ' s final position after we do
(123....n)^an (123....n-1)^an-1 .... (123....i+1)^ai+1

:oops:
thanks .
by SRX
Tue Aug 15, 2006 5:46 am
Forum: Volume 110 (11000-11099)
Topic: 11071 - Permutation Representation
Replies: 17
Views: 9624

Re: 11071 need some explanations

:oops: Because my english is poor , " (724) The product of several cycles is evaluated from right to left. The above permutation can be written as (53)(51)(54) (1354)(1) (1)(1354) " I don't know what is above saying , Can someone give me a example ? thanks , :D Let's put it that way: > You are give...
by SRX
Mon Aug 14, 2006 7:23 pm
Forum: Volume 110 (11000-11099)
Topic: 11071 - Permutation Representation
Replies: 17
Views: 9624

11071 - Permutation Representation

:oops:

Because my english is poor ,

"
(724)
The product of several cycles is evaluated from right to left. The above permutation can be written as
(53)(51)(54)
(1354)(1)
(1)(1354)
"

I don't know what is above saying , Can someone give me a example ?

thanks , :D
by SRX
Mon Aug 14, 2006 6:44 am
Forum: Algorithms
Topic: how to determine point is in the polygon in O ( log n )
Replies: 1
Views: 1379

how to determine point is in the polygon in O ( log n )

yes , I m solving 11072
but , I don't know the how to detemine that whether point is in the polygon in O ( log n )


I only know O(n) solution :oops:

Go to advanced search