状压DP
文章平均质量分 84
Mitsuha_
Rush to the dead summer
展开
-
2018 ACM-ICPC Syrian Collegiate Programming Contest(部分题解,待补)
传送门2018 ACM-ICPC 叙利亚大学生程序设计竞赛Problem A: Hello SCPC 2018!签到题Problem B: Binary Hamming简单题#include<bits/stdc++.h>using namespace std;const int MAX=1e6+10;const int原创 2018-11-25 00:03:39 · 1777 阅读 · 0 评论 -
2017-2018 ACM-ICPC, Asia Tsukuba Regional Contest(部分题解)
传送门Problem A:Secret of Chocolate Poles思路:简单dp。d[i][0/1]d[i][0/1]d[i][0/1]表示高度为i时,顶层圆盘是0/1颜色时的方案数。#include<bits/stdc++.h&amp原创 2018-11-16 13:37:09 · 1389 阅读 · 2 评论 -
NAIPC-2016:Greetings!(状压DP+枚举子集)
Your greeting card company makes unique greeting cards. The sizes of these greeting cards vary widely because of the whims of card designers. There are a lot of different types of cards, and each has ...原创 2018-10-17 18:09:58 · 463 阅读 · 0 评论 -
HDU-6497:Pop the Balloons(状压DP)
Pop the Balloons Time Limit: 7000/7000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem Description Recently, an interesting balloon-popping game can be commonly found near the...原创 2018-08-20 09:18:49 · 660 阅读 · 0 评论 -
2018 Multi-University Training Contest 3:Problem C. Dynamic Graph Matching(状压DP)
Problem C. Dynamic Graph Matching Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Problem Description In the mathematical discipline of graph theory, a matching ...原创 2018-07-31 09:41:51 · 269 阅读 · 0 评论 -
Wannafly挑战赛8-C:小C打比赛(状压DP)
时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32768K,其他语言65536K64bit IO Format: %lld题目描述 小C现在要参加一场wannafly挑战赛,一场挑战赛一共有n道题,一共有m分钟。对于第i道题,小C解决它需要恰好j分钟的概率是pi,j。小C每次会选择某一道没做完的题,然后把它解决(不能中途放弃),之后再决策下一原创 2018-01-20 12:51:03 · 569 阅读 · 0 评论 -
hihocoder#1486 : 物品价值
hihocoder#1486 : 物品价值 小Hi现在有n个物品,每个物品都有一个价值。并且这n个物品总共有m个不同的属性,每个物品都具有其中若干属性。小Ho要从中选出若干物品,满足每个属性都正好有奇数个物品拥有,且被选出的物品价值总和最大。你能帮助小Ho完成任务么?原创 2017-09-12 13:24:47 · 970 阅读 · 0 评论 -
2017百度之星程序设计大赛 - 复赛 HDU-6149:Valley Numer II
2017百度之星程序设计大赛 - 复赛 HDU-6149:Valley Numer II为了形成山谷,首先要将一个图的顶点标记为高点或者低点。标记完成后如果一个顶点三元组<X, Y, Z>中,X和Y之间有边,Y与Z之间也有边,同时X和Z是高点,Y是低点,那么它们就构成一个valley。度度熊想知道一个无向图中最多可以构成多少个valley,一个顶点最多只能出现在一个valley中。原创 2017-08-28 21:08:58 · 428 阅读 · 0 评论 -
HDU - 4628:Pieces(状压DP)
HDU - 4628:Pieces(状压DP)原创 2017-08-05 21:03:10 · 492 阅读 · 2 评论 -
LightOJ - 1021 :Painful Bases
LightOJ - 1021 :Painful Bases As you know that sometimes base conversion is a painful task. But still there are interesting facts in bases.For convenience let's assume that we are dealing with the bases from 2 to 16. The valid symbols are 0, 1, 2, 3, 4,原创 2017-08-04 16:11:20 · 467 阅读 · 0 评论 -
HDU - 3182:Hamburger Magi(状压DP)
Hamburger Magi Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-08-04 09:00:36 · 389 阅读 · 0 评论 -
CodeForces - 8C:Looking for Order
CodeForces - 8C:Looking for Order Girl Lena likes it when everything is in order, and looks for order everywhere. Once she was getting ready for the University and noticed that the room was in a mess — all the objects from her handbag were thrown about th原创 2017-08-03 08:19:57 · 511 阅读 · 0 评论 -
HDU - 5418:Victor and World
Victor and World Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)原创 2017-08-02 19:38:20 · 752 阅读 · 0 评论 -
HDU 4529:郑厂长系列故事——N骑士问题(状压DP)
郑厂长系列故事——N骑士问题 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)原创 2017-08-02 11:23:30 · 670 阅读 · 0 评论 -
CSU 1129:送货到家
CSU 1129:送货到家懒惰的巫女Reimu因为各种原因在香霖堂的店主Rinnosuke那儿欠下了很多债,于是乎只好靠帮他在幻想乡中送货来偿还掉微不足道的一小部分。懒归懒,Reimu还是很聪明的,她希望送货的总路程尽可能的短,同时任何一个地方不经过两次。简而言之,便是在一张图上找一个边权和最小经过所有点恰好一次的封闭回路。原创 2017-08-01 09:14:33 · 481 阅读 · 0 评论