OJ Board

mak(cse_DU)

WoW.
Great.......
No need to think pass.
Just ignore 'K' or put K=0 always.

"Soha" && "Tara"

mak(cse_DU)

I am not able to figure it out your DP.

for(i=0...i<=k , j=k-i ) result+=DP1[i][MM] + DP2[j][M] ;

you can simply discover that result must be
result+=DP1[MM] * DP2[j][M] ;

At first define DP1 and DP2 carefully.

mak(cse_DU)

I solved it with O(Testcase*K+N*K). I got idea from my Academic elder brother (Jane Alam Jan). "Thanks Jan vai" let n be length, A[0 to (n-1)] P= number of characters where a = a[n-i-1]; Q= number of characters where a != a[n-i-1]; Then Independently calculate DP(P,K); and DP2(Q,K); Hope you have go...

mak(cse_DU)

My solution 500*1000 for each case.
But still TLE.
No Of test case 5000. (huge).
Is it needed to solve in linear time?

mak(cse_DU)

Thanks Jan vai.
Your's one was 2 times faster than me.
I found that my code calls a binary search function 16 times for each case.

mak(cse_DU)

@serur
Try these:
Input:

Code: Select all

zpk
1
2
2
4
5
6
7
8
9
10
11
12
13
14
15
zsrqponmlkjihgfedcya
21
1
6613313319248080000
6613313319248070040

AC output:

Code: Select all

15
k
kp
kp
kz
kzp
p
pk
pkz
pz
pzk
z
zk
zkp
zp
zpk
6594882320481860667
acdefghijklmnopqrsz
a
zysrqponmlkjihgfedc
zysrqponmlkjichedaf

Hope it will help

mak(cse_DU)

OMG...i forgot to reinitialize my cost array... :roll: Thnx a lot for finding out such a foolish mistake. :D :lol: (i've edited the code above) But the problem still continues...Wrong Answer again :( I've read the code again & again but cant find out any other (such foolish :D ) mistake... :( Try t...

mak(cse_DU)

@Jan vai:
There have some forbidden cells. So I did DP using row Masking Idea.
would you illustrate your Idea briefly?
Thanks in advance

mak(cse_DU)

@Sachin Actually I tried to figure out the Runtime error ignoring the wrong answer. Anyway try below multiple cases input: 2 3 11 Ja 5 Tan Sid Sam Sha Tan 1 Ja 1 Ja 1 Ja 1 Ja 3 11 Ja 5 Tan Sid Sam Sha Tan 1 Ja 1 Ja 1 Ja 1 Ja Compare two output and think how big mistake you have done. :D

mak(cse_DU)

for(i=0;i<k[mymap[name]]-1;i++) ar[mymap[name]] =ar[mymap[name]][i+1]; ar[mymap[name]][i+1]=save; Check these above lines carefully. when k[mymap[name]]==20, After the loop i will be 19. Then "ar[mymap[name]][ 19+1 ]=save;" which is wrong And also it will create RE . Because ar[5][20] allow ar[0-4]...

mak(cse_DU)

Thanks guru.

Need a reply on
http://acm.uva.es/board/viewtopic.php?f ... 77#p126602

mak(cse_DU)

Using cin I got TLE(3s).
After using Scanf It AC in 0.348s.

mak(cse_DU)

Some one please share Idea for this problem.
I solved it but timing(0.504s) was so much poor.

Thanks in advance.

mak(cse_DU)

At first I read the link: http://sps.nus.edu.sg/~limchuwe/cgt/cgt1.htm Then I calculated all losing position. Then for every test case I need O( 2*log2(690000) ) Iterations.(twice binary search) But Time limit 1.000 second. Have any constant solution ?? My AC time: 0.112s some Intput/output: 10 41 4...

mak(cse_DU)

Input:

Code: Select all

AC output:

Code: Select all

Case 1: -1
Case 2: -1
Case 3: 0
Case 4: -1
Case 5: -1

OJ Board

Search found 72 matches

11863 - Prime Game

Re: 11828 - Palindrome Again

Re: 11828 - Palindrome Again

Re: 11828 - Palindrome Again

Re: 11735 - Corner the Queens

Re: 11708 -- Lex Ranking

Re: 11797-WA!

Re: 11725-Colorful Board

Re: 11797-WA!

Re: 11797-WA!

Re: 11779 - Lost File

11779 - Lost File

11725 - Colorful Board

11735 - Corner the Queens

Re: 11730 - Number Transformation