ACM_搜索
chudongfang2015
开心开心!!!!!!
展开
-
Codeforces Round #269 (Div. 2) C MUH and House of Cards 爆搜+剪枝
C. MUH and House of Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolar bears Menshykov and Uslada f原创 2017-02-06 10:08:18 · 520 阅读 · 0 评论 -
1656: [Usaco2006 Jan] The Grove 树木 BFS+射线阻隔
1656: [Usaco2006 Jan] The Grove 树木Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 258 Solved: 168[Submit][Status][Discuss]DescriptionThe pasture contains a small, contiguous grove of trees原创 2017-10-13 01:11:20 · 501 阅读 · 0 评论 -
E - Counting Cliques HDU - 5952 DFS+剪枝
A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number of cliques with a specific size S原创 2017-10-26 23:52:12 · 323 阅读 · 0 评论 -
Minimum Distance in a Star Graph BFS/康托展开 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
题目链接模拟+BFS+康拓展开,此题的数据比较水,如果n为9就GG了#include<bits/stdc++.h>using namespace std;typedef long long ll;vector<int> mm[500005];int vis[500005];int n;ll sum =0;int a[11];int b[11];int fac[] = {1,1,2原创 2017-09-24 21:41:49 · 428 阅读 · 0 评论 -
假期训练——CodeForces - 742D Arpa's weak amphitheater and Mehrdad's valuable Hoses DP+dfs
Just to remind, girls in Arpa's land are really nice.Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each Hos may have so原创 2017-01-24 23:24:54 · 502 阅读 · 0 评论 -
假期训练——POJ - 1176 Party Lamps 思维+暴力+DFS
To brighten up the gala dinner of the IOI'98 we have a set of N coloured lamps numbered from 1 to N. The lamps are connected to four buttons: button 1 -- when this button is pressed, all the lamps原创 2017-01-24 23:14:28 · 472 阅读 · 0 评论 -
HDU - 3085 A - Nightmare Ⅱ 双向BFS
Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze. They will kill the p原创 2017-02-20 22:43:57 · 665 阅读 · 0 评论 -
寒假训练——POJ - 2488 A Knight's Journey 搜索+贪心
Background The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is two squares in原创 2017-01-18 20:01:45 · 339 阅读 · 0 评论 -
寒假训练——POJ - 3278 Catch That Cow bfs and similiar
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,0原创 2017-01-18 19:58:38 · 332 阅读 · 0 评论 -
寒假训练——POJ - 3009 Curling 2.0 dfs and similiar
On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is mark原创 2017-01-18 19:55:47 · 343 阅读 · 0 评论 -
寒假训练——POJ - 1562 Oil Deposits 搜索
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th原创 2017-01-18 19:52:22 · 378 阅读 · 0 评论 -
寒假训练—— HDU - 2094 产生冠军 DFS or BFS
有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。 球赛的规则如下: 如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。 如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都不可能成为冠军。 根据这个规则,无需循环较量,或许就能确定冠军。你的任务就是面对一群比赛选手,在经过了若干场撕杀之后,确定是否已经实际上产生原创 2017-01-18 19:37:49 · 531 阅读 · 0 评论 -
1659: [Usaco2006 Mar]Lights Out 关灯 迭代加深搜索
1659: [Usaco2006 Mar]Lights Out 关灯Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 315 Solved: 81[Submit][Status][Discuss]Description奶牛们喜欢在黑暗中睡觉。每天晚上,他们的牲口棚有L(3Input第一行,两个整数L和T。第二行原创 2017-10-16 17:46:14 · 444 阅读 · 0 评论