Comments
+16

I wish your code was readable.
0

Sounds so true!
+5

Rating changes in Edu rounds usually take around 24 hours.
+4

It says Test 3, not the subtest 3 of test 1.
0

There are many good ways of computing n choose k.
+1

You can actually pick any of them. Consider a case where you only have 2 of them. Let x1 and x2 be their coordinates (x1 < x2).

All people to the right of x2 move towards x2, and all people to the left of x1 move towards x1. The middle ones can move in any direction, but that doesn't matter because they aren't the extremes.

You can easily generalize this notion by induction for >2 people with same dressing time.
+12

My approach for B: Let idx be the index of the person with the maximum dressing time. Now, until this person gets dressed, move all other people "towards" person with index idx(only for the remaining time). Finally, just output (min + max)/2.
0

I think you made the same mistake I kept on making for an hour. Basically, (a+b)/c, where c is a double and a, b are ints, returns a double in scientific notation. You need to convert that scientific notation to a decimal.
0

The updated ratings will be available soon.
0

Once you consume a slime, you can't consume that again.
0

Use sets, check out my submission here at https://codeforces.me/contest/1722/submission/170192052
0

They are usually updated around 10 PM (IST)
0

Seems like you got hacked!
0

It won't generate duplicate numbers. Observe that all the numbers except the number you inserted, at last, are <= 2^30. The last number you inserted xor ^ temp, will actually be > 2^30, so it won't be duplicated