Search found 109 matches

by mmonish
Mon Aug 03, 2009 6:14 am
Forum: Volume 116 (11600-11699)
Topic: 11645 - Bits
Replies: 9
Views: 4172

Re: 11645 - Bits

>>andysoft

My Accepted code gives the same output.

regards,
Monish
by mmonish
Mon Nov 03, 2008 2:54 pm
Forum: Volume 115 (11500-11599)
Topic: 11550 - Demanding Dilemma
Replies: 12
Views: 5176

Re: 11550 - Demanding Dilemma

try this case
Input:

Code: Select all

1
3 2
1 1
1 0
0 1
My AC output:

Code: Select all

Yes
hope this helps..
by mmonish
Tue Oct 28, 2008 11:59 am
Forum: Volume 115 (11500-11599)
Topic: 11546 - Olympic Swimming
Replies: 6
Views: 1123

Re: 11546 Olympic Swimming

>>Vytenis
thx for ur reply. I found my mistake. i will try it another way..
by mmonish
Mon Oct 27, 2008 4:39 pm
Forum: Volume 115 (11500-11599)
Topic: 11546 - Olympic Swimming
Replies: 6
Views: 1123

Re: 11546 Olympic Swimming

still i am getting WA.anyone please check the following I/O.. 15 3 5 0 7 9 11 12 4 2 6 8 12 5 4 5 8 9 12 20 5 2 0 19 3 0 18 19 2 15 16 3 14 15 19 3 18 19 2 50000 30 5 4 8 6 7 9999 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 ...
by mmonish
Sun Oct 26, 2008 3:28 pm
Forum: Volume 115 (11500-11599)
Topic: 11546 - Olympic Swimming
Replies: 6
Views: 1123

11546 - Olympic Swimming

I have been trying this prob but getiing WA many times.anyone please check my code and tell me what is wrong here..
here is my code..
removed...
by mmonish
Wed Oct 22, 2008 2:57 am
Forum: Volume 115 (11500-11599)
Topic: 11534 - Say Goodbye to Tic-Tac-Toe
Replies: 10
Views: 3016

Re: 11534 - Say Goodbye to Tic-Tac-Toe

>>SerailHydra
SG value for this trree subgames are 2,0and 1.
>>Leonid
I don't know is there any similar probs in UVA.But u can try this prob https://www.spoj.pl/problems/TRIOMINO/ in spoj.it is quite similar this one..
by mmonish
Wed Oct 22, 2008 2:51 am
Forum: Volume 115 (11500-11599)
Topic: 11530 - SMS Typing
Replies: 41
Views: 8117

Re: WA: 11530: SMS Typing

try this case..
Input:

Code: Select all

1
  a
Output:

Code: Select all

Case #1: 3
hope this helps..
by mmonish
Tue Oct 21, 2008 3:32 pm
Forum: Volume 115 (11500-11599)
Topic: 11534 - Say Goodbye to Tic-Tac-Toe
Replies: 10
Views: 3016

Re: 11534 - Say Goodbye to Tic-Tac-Toe

suppose u r playing 3 nim games here 1. ..O 2. O.X 3. X. each game canbe represented by three values.first length of the game , second value on the left side and third value on the right side. for each game u can place a X or O in positions from 0 to len-1 and split the game into 2 subgames.The grun...
by mmonish
Tue Oct 21, 2008 1:54 pm
Forum: Volume 115 (11500-11599)
Topic: 11534 - Say Goodbye to Tic-Tac-Toe
Replies: 10
Views: 3016

Re: 11534 - Say Goodbye to Tic-Tac-Toe

>>baodog
thx for ur help. Now i have got AC.. Silly mistake in my coding..
by mmonish
Tue Oct 21, 2008 11:16 am
Forum: Volume 115 (11500-11599)
Topic: 11534 - Say Goodbye to Tic-Tac-Toe
Replies: 10
Views: 3016

Re: 11534 - Say Goodbye to Tic-Tac-Toe

I am getting WA in this prob. Anyone please check the following cases or give any tricky case. Input 12 .. ........................ .....X...O....XO . ...XOXOXOXO ...X..........O...X....O..O.....X....XO XOXO ...XOX ............................................................ XOXOXOXOXOXOXOXOXO.........
by mmonish
Tue Oct 21, 2008 11:07 am
Forum: Volume 115 (11500-11599)
Topic: 11537 - Secret Problemsetters' Union
Replies: 4
Views: 2838

Re: 11537 - Secret Problemsetters' Union

u wouldn't need to check this condition.
by mmonish
Wed Oct 08, 2008 3:23 am
Forum: Volume 115 (11500-11599)
Topic: 11503 - Virtual Friends
Replies: 49
Views: 17066

Re: 11503-Virtual Friends

>>sabir
my algorithm is same as ur's. I think u should use efficient data structure for ur check() function. in worst case ur complexity is O(n^2) where n = 100000. For this i use stl map. Hope this helps u.....
by mmonish
Tue Oct 07, 2008 7:56 pm
Forum: Volume 115 (11500-11599)
Topic: 11512 - GATTACA
Replies: 23
Views: 9156

Re: 11512 - GATTACA

>>azk84
thx for ur reply.silly mistake in my lexiographic compare function.My AC time is 2.110 sec but some people solve this
prob in less than 0.1sec. I want to know the better approach for this prob.anyone help me please....
by mmonish
Tue Oct 07, 2008 12:43 pm
Forum: Volume 115 (11500-11599)
Topic: 11512 - GATTACA
Replies: 23
Views: 9156

11512 - GATTACA

I checked a lot of small cases but couldn't find any wrong.Anyone please give me some tricky case..

Code: Select all

AC.....
by mmonish
Sat Sep 27, 2008 2:17 pm
Forum: Volume 114 (11400-11499)
Topic: 11491 - Erasing and Winning
Replies: 14
Views: 6173

Re: 11491 - Erasing and Winning

But my time is something about 0.880, and I see guys with absolute zero time and 0.020 and so on. My question is, how to improve the solution so that it counts answer in such a minimal time? What solution method was used to get such a small time? I used link list(manually by pointer) which takes .1...

Go to advanced search