When iterations where answer exists work immediately, and time-limit cut-off need only for last iteration where no answer exist, there is no need for any optimization.

In my solution you need only values of and K! for N ≤ 10⁶ and K  ≤ 5000. Both can be calculated with no problem. C(N, K) can be also calced becouse we need them for fixed N and small K. So we can calc them as product of O(K) numbers, with time of K².

No, such problems are often apears on TopCoder too.

Where did you get information from?

In this problem letters typed independently.

Fixed.

Yes, it wil be translated tommorow.

Yes.

Contest haven't start yet.

See this post about raiting and this about colors.

If you lock your code you can't resabmit it. In any other situation you can do it, but the score on this problem wiil be less, becose of time between submitions and 50-points penalty.

it is both for div 2 and div 1.

Well, I don't know how to solve the problem. The only idea that i have (ans it's enough) to transponate matrix a (solve for matrix simetric to it). There is no test where both sizes are 3*k+2

Maybe you didn't understand what is sum?

a[][] is what you had write.

Oh, there is an error. We should not count prexix sums. We shoud count sums of connected bloks of 3 cells.

I had 100 on this problem.
My solution is iterative. Firstly we should know how to solve this problem when m=1. It's not difficult. Mines' location uniquely determined by the presence of mines in the first cell.

Second we should understand how to calc sum of third line prefixes. sum[i]=a[i][1]-a[i][0]. Indexes are 0-based. a is array with mines number and sum is number of mines neer ith position in third line. Now we can find mines position in third line. Using this idea we can find positions of mines in line with 0-based 3*k+2 lines for all k. If the last of these lines is last or there is only one line after it we can find location in other lines using this idea.

If there are too lines after last line we can use it for columns instead of rows. And there is no tests when algorithm don't work both on rows and columns.

Sorry for my bad english.

In Wiindows version of g++(MinGW) you should use %I64d not %lld for reading and writing long longs.

Про уведомление вообще впервые слышу и никогда не замечал. по поводу почты я, например, всегда отключаю сразу все уведомления( может кроме как соревнованиях). Хотя в принципе нужно просто быть внимательнее.

А еще было бы удобно если бы показывалось что у тебя есть сообщения (окошко выплывало, просто циферка стояла рядом или что-то еще такое). А то можно очень долго ждать ответа на сообщение.

Of course firstly i mae them smaller. the absolute value are not necessary. So you can say that malist value is 1, next is 2 and etc. So values should be not more 5x10^5.

I have sorted by first parametr and then make rmq where indexes were second parametr and value is third. Becouse of stecific rmq request you can use Fenvik tree insted of interval tree and I have done it.

your problems was with erase 0 or something like that.