The contest submissions aren't made public and there is no editorial so I am asking here about the approaches for these 2 problems:
Thanks!
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
The contest submissions aren't made public and there is no editorial so I am asking here about the approaches for these 2 problems:
Thanks!
I wanted some insights on how to solve this problem.
My WA Approach: I thought all the non-leaf nodes in centroid decomposed tree would be the answer (with the exception of n = 1 where answer would be 1)
In order to study rotating calliper technique this website is listed at many places, but it is not working anymore.
http://cgm.cs.mcgill.ca/~orm/rotcal.html
Is it down temporarily or that resource is no more available?
In this problem Coprimes I saw some solutions using mobius function. Can anyone throw some light on how mobius function can be used in this problem. Thank you!
I had a vector of pairs. I wanted it sorted in descending according to the first value of the vector.
sort(a.begin(),a.end(),[](pair<int,int> &left, pair<int,int> &right){
return left.first >= right.first;
});
This gave me TLE. Sorting it normally
sort(a.begin(),a.end());
and iterating from the end worked.
Why does the first sorting function give TLE? Do I have to implement it some other way?
I read that there are many great problems on POI. But the website is not loading. POI.Where can I find these problems ?
Thank You.
My approach for ChessMetric is to find all the positions reachable from position start, then put them in a queue of tuples where first and second elements are the co-ordinates and the third is number of moves. But it is giving Memory limit exceeded. Any idea how to make this efficient? I used unsigned short int for co-ordinates and number of moves.
Thank You.
In this question http://codeforces.com/contest/330/problem/B I want to ask why the star graph would give minimum number of paths. Thank You.
Name |
---|