蒟蒻的最后的倔强

The main fact is that the number of colors is less than 20, which allows us to use exponential solutions. For each pair of colors (i,j), we can calculate cnt[i][j] — the number of swaps required to p...

https://www.cometoj.com/contest/68/problem/D1?problem_id=3936 入学考试 (简单版) 枚举 已经做完的卷子数量 然后 剩下的时间 我们二分它最多每个卷子可以做多少题 然后剩下的时间我们自己在补进去 #include <bits/stdc++.h> using namespace std; const int N = 1e5 +...