动态规划之状压DP
等我学会后缀自动机
侠影之谜
展开
-
CodeForces 454D Little Pony and Harmony Chest (状压DP+估界)
#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long long#define lrt int l,int r,int rt#define lson l,m...原创 2020-04-26 07:46:46 · 151 阅读 · 0 评论 -
HDU 5711 Ingres (状压DP+优先队列贪心)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5711#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-05 18:12:41 · 209 阅读 · 0 评论 -
HDU 3182 Hamburger Magi (状态压缩DP)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3182#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x,...原创 2018-09-23 09:07:51 · 210 阅读 · 0 评论 -
HDU 5418 Victor and World (状压DP+FLoyd)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5418#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-28 07:32:35 · 201 阅读 · 0 评论 -
HDU 4628 Pieces (状压DP+记忆化搜索)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4628#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-10 17:03:25 · 231 阅读 · 0 评论 -
HDU 6125 Free from square (状压+背包思想)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6125#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-10-28 13:04:26 · 169 阅读 · 0 评论 -
HDU 5117 Fluorescent (状压DP+思维)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5117#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-10-25 23:55:45 · 159 阅读 · 0 评论 -
HDU 6149 Valley Numer II (背包+状压+滚动数组)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6149#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-10-26 20:13:40 · 116 阅读 · 0 评论 -
CodeForces 482C Game with Strings (概率+状压DP 好题)* 第四百篇博文纪念
题目链接:http://codeforces.com/problemset/problem/482/C#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll uns...原创 2018-11-17 09:36:24 · 209 阅读 · 0 评论 -
HDU 3920 Clear all of them (状态压缩+记忆化搜索)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3920#include <algorithm>#include <iostream>#include<cmath>#include<cstring>#include<stdio.h>#define maxn 30#define...原创 2019-01-22 15:03:55 · 146 阅读 · 0 评论 -
HDU 4352 XHXJ's LIS (数位DP+状压DP+LIS)好题*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4352题目大意给定l和r,要求在这个区间内,,满足要求的数字的个数,要求是:数位上最长上升子序列长度为k。题目分析数位DP+状压DP。思维很脑洞,主要是用状压的思想去搞最长上升子序列,首先观察到其最大长度不超过10 ,且每位数字0到9,那么我们可以用1<<1...原创 2019-03-27 00:20:20 · 126 阅读 · 0 评论 -
HDU 1074 Doing Homework (典型状压DP)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1074#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-09-22 08:46:04 · 103 阅读 · 0 评论 -
HDU - 4640 Island and study-sister (状压DP+背包+最短路)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4640#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-11 17:11:33 · 617 阅读 · 0 评论 -
HDU 6321 Problem C. Dynamic Graph Matching(状态压缩DP)
Problem C. Dynamic Graph MatchingTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1662 Accepted Submission(s): 677 Problem Description...原创 2018-08-04 07:00:14 · 162 阅读 · 0 评论 -
UVA 1252 Twenty Questions (记忆化搜索+DP状压)*
Consider a closed world and a set of features that are defined for all the objects in the world. Each feature can be answered with “yes” or “no”. Using those features, we can identify any object from ...原创 2018-08-14 10:20:21 · 133 阅读 · 0 评论 -
牛客网多校练习7 Bit Compression (暴力+map容器的计数使用方法)
链接:https://www.nowcoder.com/acm/contest/145/C来源:牛客网 题目描述A binary string s of length N = 2n is given. You will perform the following operation n times :- Choose one of the operators AND (&),...原创 2018-08-11 23:17:03 · 194 阅读 · 0 评论 -
UVA 10817 校长的烦恼(状压DP+记忆化搜索
The headmaster of Spring Field School is considering employing some new teachers for certain subjects. There are a number of teachers applying for the posts. Each teacher is able to teach one or more ...原创 2018-08-12 20:22:03 · 289 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛 AC Challenge (状态压缩+暴力)
Dlsj is competing in a contest with n(0<n≤20)n (0 < n \le 20)n(0<n≤20) problems. And he knows the answer of all of these problems.However, he can submit iii-th problem if and only if he has...原创 2018-09-01 23:04:22 · 351 阅读 · 0 评论 -
HDU 4539 郑厂长系列故事——排兵布阵 (状压思维题)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4539#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x,...原创 2018-09-24 10:07:16 · 292 阅读 · 0 评论 -
HDU 4529 郑厂长系列故事——N骑士问题 (状态压缩DP)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4529#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x,...原创 2018-09-24 21:41:03 · 360 阅读 · 0 评论 -
HDU 3001 Traveling (状压DP)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3001#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-25 20:20:09 · 139 阅读 · 0 评论 -
HDU 5691 Sitting in Line(状压DP+思维建图)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5691#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-25 22:25:19 · 341 阅读 · 0 评论 -
ZOJ 1346 Comparing Your Heroes (状态压缩dp 精简)*
Comparing Your HeroesTime Limit: 10 Seconds Memory Limit: 32768 KBNowadays many students wouldn't attend classes in university, instead, they stay in dormitory playing Electronic games on com...原创 2018-07-18 11:21:58 · 307 阅读 · 0 评论