双木林的博客

Yet Another Walking Robot 题目链接题意：输入一段路径，输出最短的重复段。思路：每走一步将到达的点存入map，进行判重，并保存最小值；#include<iostream>#include<map>using namespace std;struct node{ int x,y; friend bool opera...

Let the Balloon Rise HDU - 1004不重复数字 HYSBZ - 2761{A} + {B} HDU - 1412Ignatius and the Princess IV HDU - 1029(map)Andy's First Dictionary UVA - 10815

Andy's First Dictionary题目链接这道题的要求将所有出现的单词按照顺序输出，完全符合set去重并且自动排序的功能，我们就可以选择用set进行代码实现。在进行样例测试的时候可能会有问题，回车总是代表一个字符串的结束标记符，在这里我们要进行多组输入，所以我们在输入未知的多组字符串后要结束多组输入，及使该输入达到end of file时结束多组输入，Crtl+z即代表EO...

Ignatius and the Princess IV题目链接这道题给出的测试样例都一定存在一个special integer。我们可以利用数组进行存储及遍历，也可以用map进行存储。#include<iostream>#include<map>using namespace std;map<int,int>ma;int main...

题目链接题意要求是去重，并且输出顺序是从小到大，所以完全符合set自动去重和排序的特点。#include<iostream>#include<algorithm>#include<set>using namespace std;int n,m;int main(){ while(cin>>n>>m){ s...

题目链接题意要求就是去重，并且输出顺序不改变，只保留第一次出现的元素。set和map都可实现（map内部会自动排序，所以需要边存入map，判断是否是第二个及以上出现的元素，随即输出）/*set*/#include<iostream>#include<algorithm>#include<set>using namespace std;...

题目链接map经典水题。#include<iostream>#include<map>using namespace std;#define ll long longconst int MAXN=200010;map<string,int> ma;int main(){ int n; while(cin>>n&&...

Valeriy and DequeRecently, on the course of algorithms and data structures, Valeriy learned how to use a deque. He built a deque filled with nn elements. The ii -th element is aiai (ii = 1,2,…,n1,2,...

PairsToad Ivan has mm pairs of integers, each integer is between 11 and nn , inclusive. The pairs are (a1,b1),(a2,b2),…,(am,bm)(a1,b1),(a2,b2),…,(am,bm) .He asks you to check if there exist two in...

Circle MetroThe circle line of the Roflanpolis subway has nn stations.There are two parallel routes in the subway. The first one visits stations in order 1→2→…→n→1→2→…1→2→…→n→1→2→… (so the next st...

Nick and ArrayNick had received an awesome array of integers a=[a1,a2,…,an]a=[a1,a2,…,an] as a gift for his 55 birthday from his mother. He was already going to explore its various properties but af...

EnginesProblem StatementE869120 is initially standing at the origin (0,0) in a two-dimensional plane.He has N engines, which can be used as follows:When E869120 uses the i-th engine, his X-...

Shortest Path on a LineProblem StatementWe have N points numbered 1 to N arranged in a line in this order.Takahashi decides to make an undirected graph, using these points as the vertices. In...

EnginesProblem StatementE869120 is initially standing at the origin (0,0) in a two-dimensional plane.He has N engines, which can be used as follows:When E869120 uses the i-th engine, his X-...

Counting of TreesProblem StatementGiven is an integer sequence D1,…,DN of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following cond...

AB SubstringsProblem StatementSnuke has N strings. The i-th string is si.Let us concatenate these strings into one string after arranging them in some order. Find the maximum possible number ...

Kleene InversionProblem StatementWe have a sequence of N integers A~=~A0,~A1,~…,~AN−1.Let B be a sequence of K×N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 ...

LowerProblem StatementThere are N squares arranged in a row from left to right.The height of the i-th square from the left is Hi.You will land on a square of your choice, then repeat moving...

Powerful Discount TicketsProblem StatementTakahashi is going to buy N items one by one.The price of the i-th item he buys is Ai yen (the currency of Japan).He has M discount tickets, and he...

Monsters Battle RoyaleProblem StatementThere are N monsters, numbered 1,2,…,N.Initially, the health of Monster i is Ai.Below, a monster with at least 1 health is called alive.Until there ...

ModSumProblem StatementFor an integer N, we will choose a permutation {P1,P2,…,PN} of {1,2,…,N}.Then, for each i=1,2,…,N, let Mi be the remainder when i is divided by Pi.Find the maximum po...

以下是每道题的链接：ModSum（思维）Monsters Battle RoyalePowerful Discount TicketsLowerKleene InversionAB Substrings Counting of TreesShortest Path on a LineEngines

RGB Substring (easy version)The only difference between easy and hard versions is the size of the input.You are given a string ss consisting of nn characters, each character is 'R', 'G' or 'B'.Y...

CotreeAvin has two trees which are not connected. He asks you to add an edge between them to make them connected while minimizing the function ∑ni=1∑nj=i+1dis(i,j)∑i=1n∑j=i+1ndis(i,j), where dis(i,j...

RngAvin is studying how to synthesize data. Given an integer n, he constructs an interval using the following method: he first generates a integer r between 1 and n (both inclusive) uniform-randomly...

WaveAvin is studying series. A series is called "wave" if the following conditions are satisfied:1) It contains at least two elements;2) All elements at odd positions are the same;3) All elements...

WorkerAvin meets a rich customer today. He will earn 1 million dollars if he can solve a hard problem. There are n warehouses and m workers. Any worker in the i-th warehouse can handle ai orders per...

TrafficAvin is observing the cars at a crossroads. He finds that there are n cars running in the east-west direction with the i-th car passing the intersection at time ai . There are another m cars ...

BudgetAvin’s company has many ongoing projects with different budgets. His company records the budgets using numbers rounded to 3 digits after the decimal place. However, the company is updating the...

Fixing BannersHarbin, whose name was originally a Manchu word meaning "a place for drying fishing nets", grew from a small rural settlement on the Songhua River to become one of the largest citi...

实验目的：1.掌握串的模式匹配操作。实验要求：1.分别使用BF和KMP算法完成串的模式匹配。实验过程：1.设计完成next值的计算函数；2.设计完成修正next值的函数；3.KMP算法代码；4.输入子串（abbc）和主串（abbabbcad）5.输出子串在主串中开始的位置。实验结果：输入：子串：abbc 主串：abbabbcad输出：4实验分析...

A Bug's Life 二分图 并查集BackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs...

填涂颜色题目链接（洛谷）这道题我的思路是从边缘的0进行dfs并进行标记，这样回路中的0肯定无法被标记，wa了一回，因为只标记了一个边缘的0，边缘的0不一定是相通的。#include<iostream>#include<string.h> using namespace std; int vis[32][32];char map[32][32];int d[2...

1、记忆化搜索的思想记忆化搜索的思想是,在搜索过程中，会有很多重复计算,如果我们能记录一些状态的答案，就可以减少重复搜索量2、记忆化搜索的适用范围根据记忆化搜索的思想，它是解决重复计算，而不是重复生成，也就是说，这些搜索必须是在搜索扩展路径的过程中分步计算的题目，也就是“搜索答案与路径相关”的题目，而不能是搜索一个路径之后才能进行计算的题目，必须要分步计算，并且搜索过程中，一个搜索结果必须可...