随笔分类 -  图论-2-sat

摘要：从这里开始 题目目录 感觉每天打比赛都在丢人。感觉离滚蛋不远的次数 +1 Day 1 Problem A ビルの飾りつけ 4 猜想可行的数量是某个区间。然后 dp 即可。 Code #include <bits/stdc++.h> using namespace std; typedef bool 阅读全文

摘要：题目传送门 唯一的传送门 题目大意 给定$n$个串，每个串只包含 '0','1','?' ，其中 '?' 至多在每个串中出现1次，它可以被替换为 '0' 或 '1' 。问是否可能任意两个不同的串不满足一个是另一个的前缀。 题目传送门 唯一的传送门 题目大意 给定$n$个串，每个串只包含 '0','1 阅读全文

摘要：John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who 阅读全文

摘要：liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy 阅读全文