better for hackers

2:30am in the East Coast USA :(

and South Korean;

cheer up:D,

I was successful in keeping my green color :) Got +50 points.

oh, y have become green. my congratulations! Soon I will be blue. screen))))

good luck :V

Hope we all have a good rank.I want to become expert too :D

That's why I called Jajceslav)

As it is holiday. So not so bad i think.

Yours too .... bro

you can do it, good luck

It is fixed now, thanks.

Irony is that most questions are two-dimensional xD

And on top of that use (x, y) x for column in C and (i, j) i for row in E, genius

https://stackoverflow.com/questions/19753134/get-the-points-of-intersection-from-2-rectangles
First find how many white and black are initially on board.
For both rectangles(white cand black colored) calculate its area (say W and B).(number of cells)
Then find the intersection of two rectangles that many cells will be deducted from W count.(black color will overwrite white color)
Now from this 3 information you can find final answer.

judge overlap

If no intervals overlap

I think u can solve it，its not very hard

If exist， initialize the overlap, that is, turn the white part back to black.

my code seem very stupid.....

I spent almost of the time just to find the overlap area oh god, first i had thought it 's really simple :(

C title topic: At the beginning, there is a checkerboard with black and white colors. Initially, the area of ​​area one (x1 y1) (x2 x2) (the points in the lower left and lower right corners form a rectangular area) are all painted white. Then apply the area of ​​area two (x3 y3) (x4 y4) to black. Find the number of black and white grids on the final board.

answer:

In the calculation area one (x1 y1) (x2 y2), there is a white grid w1 black grid b1 at the beginning. In the calculation area two (x3 y3) (x4 y4) area, there is a white grid w3 black grid b3 Calculate the area where the two areas intersect. The three (x5 y5) (x6 x6) area begins with a white grid w2 black grid b2

At the beginning, there are orw white plaids on the board. Orb black plaids. 1. The area is painted white. orw += b1, orb -= b1 2. The area where the area two intersects with the area one or two is painted black. 2.1 Get the white of area two orb += w3, orw -= w3 2.2 Obtain the black of the intersecting part orb += b2, orw -= b2

The number of black grids added on orb is w3 + b2 — b1 Corresponding. The number of white lattices reduced on orw is -(w3 + b2 — b1)

Rectangles not ovelapping.

just try 'long long int' instead of 'int', my code was also failing on pretest 2 as i was using int. but total blocks could be ~ 10^18 so int wont work. hope it helps!

What's wrong with problem C ?

There was nothing related chess moves, just a rectangle in which adjacent colors are different, So you can't call it that.

I think codeforces can perform about 2e9 simple operations in 1 second.

I lost 100 positions because of him

Undefined behavior is a thing.

If the solution is not passed on pretest 1. Then the submission will not be considered as a submission or wrong submission. If solution passes at least one pretest then it will be counted as a submission and will be considered as wrong submissions if it doesn't pass all the test.

May be after 4 hours. A ICPC Regional in running in GYM.

Btw I can see other user's submissions.
Edit — Above comment was edited.

Probably want to surprise us by showing "Contest finished" at once!

I can tell you, but it was told to not discuss problems before systests. :(

Edit:

-Make a segment tree where in every node you keep a set containing the pair {left border, the minimum right border of an interval that starts after the current one(including the current one)} for every interval corresponding to that node

-We can construct this tree in n log^2 n time and answer every query online in log^2 n by using the lower_bound operation on the set in the segment tree nodes.

There is an log n per query solution too but this works too

System testing is in process, at last.

The two problems are very similar...

wow, why so many downvotes:( ? i just want to point out that the problem is copy-paste able (just add extra code for query and - f(l-1)) so codeforces will be more careful to choose problem, me and my friends who solved 486A just copy paste and modify the submission, maybe i should more clear about what i trying to say...

poor U !

AC O((n*m)^2) 420ms. 46184740