MBOARD - Editorial

anton_lunyov · February 13, 2013, 7:04pm

NZEC means non-zero exit code. So try to check whether you return zero at the end of the execution.

deepai_dutta · February 13, 2013, 7:23pm

No my question is what is the frequency that I store in the BIT used here .Is it all the time of the column or row which was last set to 0,1 ??

prakhs123 · February 13, 2013, 9:19pm

Thanks very much!

pragrame · February 15, 2013, 10:49pm

Well yes, there is another slight trick one needs in that problem.
Look at it this way: you have x <= 10^9 agreed, but you have only Q (<= 2*10^5) possible ‘x’ to worry about.
Just a hint good luck.

bugkiller · February 16, 2013, 7:32am

@anton_lunyov is right on the spot in explaining things easily from his code. That is why the solutions to the Jan Long Contest are having a great readability.
Nevertheless, the explanation is nice here Coding can be done too.

saikrishna173 · February 16, 2013, 4:20pm

@pragrame I am still unable to solve the problem ORDERSET using BIT, Can you explain how to solve it using BIT?

prakash1529 · February 16, 2013, 9:47pm

Finally an accept. Stupid bug !! Nice problem, nice editorial

madmax3 · February 17, 2013, 12:48am

Thanks, I cant figure out why in java I am getting RTE non-zero exit code …

bugkiller · February 17, 2013, 3:23pm

@pragrame >> you’re Naveen Sir’s student, right?

betlista · February 22, 2013, 12:57am

What do you mean when you write “fast input and cin”? It’s written in FAQ, that

The second most common cause of TLE is that your method of reading input and writing output is too slow. In Java, do not use a Scanner; use a BufferedReader instead. In C++, do not use cin/cout - use scanf and printf instead.

pragrame · February 24, 2013, 10:56am

A “ColSet i x” operation will require you to update values of all data[0][i]. Thats O(N) right there.