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 | tourist | 3851 |

2 | jiangly | 3634 |

3 | Um_nik | 3539 |

4 | slime | 3498 |

5 | ksun48 | 3493 |

6 | djq_cpp | 3486 |

7 | maroonrk | 3471 |

8 | MiracleFaFa | 3466 |

9 | Radewoosh | 3442 |

10 | Petr | 3426 |

# | User | Contrib. |
---|---|---|

1 | -is-this-fft- | 183 |

2 | awoo | 181 |

3 | YouKn0wWho | 177 |

4 | Um_nik | 175 |

5 | dario2994 | 172 |

6 | Monogon | 170 |

6 | adamant | 170 |

8 | maroonrk | 169 |

9 | errorgorn | 166 |

10 | antontrygubO_o | 165 |

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?

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.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/17/2022 14:36:26 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|