OJ Board

You have to read from standard input.

Answer is floor(log2(n))

How to solve using dp? I'm stuck at it.
dp(i,j) = min guess (i numbers with at most j strikes). Answer is obviously dp(n,m-1).
if our first guess is k then numbers divided to 0..k-1 and k+1..n-1. Numbers in 0 to k-1 need one strike but k+1..n doesn't need.
so dp(i,j) = min ( max( dp(k,j-1) , dp(n ...

Your tests are incorrect, in each coordinate x+y+z must equal to n

Problem is asking the given directed graph is connected or not.
You can solve it using Tarjan's algorithm.

Let's denote cover(mask) = true if nodes in mask and their neighbours can cover all nodes. Now problem asks divide all nodes into maximum number of subsets such that all of their cover() = true.

It can solved using dynamic programming.
DP(mask) = maximum number of subsets we can divide into ( using ...

I agree, spam is really annoying. When i see new thread and open - it's another spam. Too bad

I didn't go through your code, but the answer is some edges those aren't included in Minimum Spanning Tree.

I just got AC (3s) with O(M*sqrt(N)) algorithm.

Thanks your hint rushel.
I missed this part

Due to the limited number of seats, a department can send at most 3 members.

I think your input has 10 test cases, output is 12.
And my AC code returns
Case 1: 7 26 7 7
Case 2: 33 26 40 40
Case 3: 954724928 522243248 868722089 868722089
Case 4: 476968169 522243248 259687412 259687412
Case 5: 476968169 518586234 259687412 259687412
Case 6: 945782367 500437378 491146889 ...

Let a[j] = Number of arithmetic subset using number 1 to j and last two number is i'th and j'th.
O(N^3)

I'm 17 and solved 200. Registered 1 year ago and started from February.

Naani wrote:My O(sqrt(n)) solution is timing out. Any hints are appreciated. I just dont see any different algorithm.
TIA
Vinay Emani

My O(sqrt(S)) algorithm got AC in 1.3s

wallace wrote:this case:
4 4 3000
pA 9000 44
pB 9000 100
pC 9000 400
pD 9000 100
Joker 4000 pB
Penguin 8000 pD
TwoFace 6000 pC
feroz 4000 pA
0 0 0



answer: No

why?

Because you must destroy villains and use powers input order.