构造
文章平均质量分 83
snowy_smile
终于在ICPC World Final里拿到了气球!
再努力一点吧,坚持下去吧,梦想是会实现的! 人生会有低谷,但我更相信,未来也会有更多梦想能够实现~
展开
-
【Codeforces Round 324 (Div 2)C】【构造 讨论】Marina and Vasya 构造c串使得c串与a串b串各有m个字符不同
C. Marina and Vasyatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMarina loves strings of the same length an原创 2015-11-09 20:54:44 · 450 阅读 · 0 评论 -
【HDU5411 2015 Multi-University Training Contest 10F】【矩阵快速幂 加一行构造法】CRB and Puzzle 矩阵的1次方到n次方的数值和
CRB and PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 877 Accepted Submission(s): 351Problem DescriptionCRB is now pl原创 2015-11-20 12:08:05 · 729 阅读 · 0 评论 -
【HDU5573 2015上海赛区B】【构造 二进制思想】Binary Tree 二叉树上走m层加减数使得最后权值恰为n
Binary TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 42 Accepted Submission(s): 25Special JudgeProblem DescriptionThe Old F原创 2015-11-29 11:47:11 · 1419 阅读 · 0 评论 -
【ZSTU4213 2015年12月浙理工校赛 D】【双连通分量tarjan算法】One-Way Roads 无向连通图确定边的方向使得全图任意两点间可达
4213: One-Way RoadsTime Limit: 1 Sec Memory Limit: 128 MB Special JudgeSubmit: 133 Solved: 45DescriptionIn the ACM kingdom, there are N cities connected by M two-way roads. These citi原创 2015-12-23 12:15:03 · 1492 阅读 · 0 评论 -
【Codeforces Round 336 (Div 2) E】【KMP 构造 脑洞 好题 模拟找规律】Marbles 两条路径同时出发前后行走能否恰好同时到终点
E. Marblestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the spirit of the holidays, Saitama has given G原创 2015-12-25 11:49:47 · 1234 阅读 · 0 评论 -
【Codeforces Round 262 (Div 2)D】【构造】Little Victor and Set 集合最多取k数使得异或值尽可能小
Little Victor and Settime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Victor adores the sets theory.原创 2016-03-19 12:38:26 · 559 阅读 · 0 评论 -
【VK Cup 2016 - Round 1 (Div 2 Edition)C】【构造】Bear and Forgotten Tree 3 构造一棵树直径为d且点1的深度为h
Bear and Forgotten Tree 3time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is a connected undirected原创 2016-04-04 18:45:46 · 1149 阅读 · 0 评论 -
【GoogleCodeJam2016D】【构造 找规律】Fractiles LG字符串K字符C次变为S个检测位置找金子
Problem D. FractilesThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guide原创 2016-04-11 16:23:29 · 1604 阅读 · 0 评论 -
【Codeforces Round 375 (Div 2) F】【构造 贪心】st-Spanning Tree 树的特殊最小生成树使得S度不超SD,T度不超TD
F. st-Spanning Treetime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected connected g原创 2016-10-04 10:21:09 · 1397 阅读 · 0 评论 -
【ZOJ3952 The 17th Zhejiang University Programming Contest E】【简单构造 模拟 or汇编】Fibonacci Sequence Chicken
Fibonacci Sequence Chicken EditionTime Limit: 1 Second Memory Limit: 65536 KB Special JudgeYear 2017 is the year of chicken, so in this problem we introduce you an interesting prog原创 2017-04-12 23:21:14 · 1064 阅读 · 0 评论 -
【HDU6150 2017中国大学生程序设计竞赛 - 网络选拔赛 A】【构造】Vertex Cover
Vertex CoverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 131 Accepted Submission(s): 48Special JudgeProblem DescriptionA原创 2017-08-19 20:15:26 · 1081 阅读 · 0 评论 -
【Codeforces Round 335 (Div 2) C】【贪心 脑洞 有趣排序】Sorting Railway Cars 全排列排序可以提前后提后的最小操作数
C. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a trai原创 2015-12-10 13:44:51 · 1093 阅读 · 2 评论 -
【Codeforces Round 269 (Div 2)B】【简单构造】MUH and Sticks 数值升序输出三种可能编号序
B. MUH and Important Thingstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's time polar bears Menshykov an原创 2015-12-11 09:04:14 · 608 阅读 · 0 评论 -
【2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest H】【观察找规律 脑洞 构造】Tourist Guide 关键点作端点最多路径
H. Tourist Guidetime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputIt is not that easy to create a tourist guide as one might expect. A good tourist guide should properly distribute flow of tourists a原创 2015-11-08 12:41:32 · 939 阅读 · 0 评论 -
【Codeforces Round 324 (Div 2)E】【贪心 构造】Anton and Ira 全排列交换 最小距离成本
E. Anton and Iratime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton loves transforming one permutation into原创 2015-11-09 20:57:31 · 537 阅读 · 0 评论 -
【ASC44E】【构造】Embedding Caterpillars 毛毛虫图向完全图的映射
#include #include#include#include#include#include#include#include#include#include#include#include#include#include#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(x,y,sizeof(x原创 2015-10-29 22:57:50 · 1032 阅读 · 0 评论 -
【2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest H】【字符串哈希 构造】Hash Code Hacker 构造有相同哈希值的不同字符串
#include #include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(原创 2015-11-15 21:33:56 · 1152 阅读 · 0 评论 -
【HDU5559 2015合肥赛区H】【观察找规律 构造】Frog and String 用最多k个字符构造长度为n的m不同回文串的串
Frog and StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 61 Accepted Submission(s): 20Special JudgeProblem DescriptionF原创 2015-11-16 18:44:23 · 2459 阅读 · 3 评论 -
【2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest B】【构造】Black and White 构造棋盘使得两种棋子联通块数恰为x与y
#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(x原创 2015-11-15 20:44:00 · 867 阅读 · 0 评论 -
【2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest D】【脑洞 构造】Distribution in Metagonia 把数以2^p3^
#include #include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(原创 2015-11-15 20:46:17 · 1453 阅读 · 3 评论 -
【ASC45D】【构造 电阻网络法+暴力冲精度法+比例转换法】醉汉走路二分叉 回家概率恰为p/q
【ASC45D】【构造】方法一之电阻网络法 WIKI Gambler's ruin#include #include#include#include#include#include#include#include#include#include #include#include#include#define MS(x,y) memset(x,y,sizeof(x))原创 2015-10-31 07:32:33 · 1485 阅读 · 0 评论 -
【hihocoder1257 2015北京赛区I】【构造 从公式入手】Snake Carpet 构造矩阵使得恰好容纳1~n个拐拐蛇行图案
#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MP(x,y) make_pair(x,y)const int dy[2][4]={0,1,0,1, 1,0,-1,0};const int dx[2]原创 2015-11-16 20:55:38 · 1137 阅读 · 0 评论 -
【Codeforces Round 335 (Div 2) D】【构造 脑洞】Lazy Student 图的最小生成树告诉边权和选取情况让你还原图
D. Lazy Studenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Vladislav came to his programming exa原创 2015-12-10 13:45:24 · 1099 阅读 · 7 评论 -
【HDU6154 2017中国大学生程序设计竞赛 - 网络选拔赛 E】【贪心 构造】CaoHaha's staff 方格纸画面积最小笔画数
CaoHaha's staffTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 329 Accepted Submission(s): 191Problem Description"You shall n原创 2017-08-20 10:53:21 · 546 阅读 · 0 评论