2019年9月30日
【Codeforces Round #589 D】Complete Tripartite
摘要： "题目链接" Complete Tripartite Introduce You have a simple undirected graph consisting of $n$ vertices and $m$ edges. The graph doesn't contain self loops 阅读全文
posted @ 2019-09-30 16:23 oblivionl 阅读(261) 评论(0) 推荐(0)
【Codeforces Round #589 B】Filling the Grid
摘要： "题目链接" Filling the Grid Introduce Suppose there is a $h×w$ grid consisting of empty or full cells. Let's make some definitions: $r_i$ is the number of 阅读全文
posted @ 2019-09-30 11:42 oblivionl 阅读(504) 评论(0) 推荐(0)
上课
该文被密码保护。 阅读全文
posted @ 2019-09-30 08:05 oblivionl 阅读(7) 评论(0) 推荐(0)