Codeforces Round 810 (Div. 2)

Solutions for Codeforces Round 810 (Div. 2) (contest 1711). 1/2 problems verified against sample I/O. Difficulty range: 800-1300.

2 items

Codeforces Round 810 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1300 | Time: 10m 13s

Problem Name Rating Tags Solve Time Verified
A Perfect Permutation 800 constructive-algorithms 8m 4s ✗
B Party 1300 brute-force, graphs 2m 9s ✓
Practice › Codeforces Solutions › Codeforces Round 810 (Div. 2) ›

CF 1711A - Perfect Permutation

The provided solution is not failing because of a small implementation bug. It is failing because the core reduction is incorrect, and the code path that tries to approximate the answer is internally inconsistent.
codeforces competitive-programming constructive-algorithms Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 810 (Div. 2) ›

CF 1711B - Party

We are asked to organize a party for a club with $n$ members. Each member has a potential unhappiness value if they are not invited. The club also tracks friendships among members, where each pair of friends eats a cake if both are present.
codeforces competitive-programming brute-force graphs Jun 9, 2026