摘要:
"洛咕" 题意:在地面上确定一个起点,然后在起点右侧画$n(n include include include include include include include define ll long long using namespace std; inline int read(){ in 阅读全文
摘要:
"洛咕" "双倍经验:洛咕 完全模板题" 例题: "洛咕 地震逃生" "洛咕 [USACO09JAN]全流Total Flow" 题意:如题,给出一个网络图,以及其源点和汇点,求出其网络最大流.$n include include include include include include in 阅读全文
摘要:
"$AcWing$" 题意:给定一个$N$行$M$列的棋盘,已知某些格子禁止放置.问棋盘上最多能放多少个不能互相攻击的車.車放在格子里,攻击范围与中国象棋的“車”一致.$N,M include include include include include include include defin 阅读全文
摘要:
"$AcWing$" 题意:给定一个$N$行$N$列的棋盘,已知某些格子禁止放置.求最多能往棋盘上放多少块的长度为$2$、宽度为$1$的骨牌,骨牌的边界与格线重合(骨牌占用两个格子),并且任意两张骨牌都不重叠.$N include include include include include in 阅读全文
摘要:
"洛咕" 题意:给定一个二分图,结点个数分别为$n,m$,边数为$e$,求二分图最大匹配数.$n,m include include include include include include include define ll long long using namespace std; in 阅读全文
摘要:
"洛咕" 题意:给定一棵$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char 阅读全文
摘要:
"洛咕" 题意:硬币购物一共有$4$种硬币.面值分别为$c_1,c_2,c_3,c_4$.某人去商店买东西,去了$tot$次.每次带$d_i$枚$c_i$硬币,买$s_i$的价值的东西.请问每次有多少种付款方法?$s_i include include include include include 阅读全文