题目:http://acm.hdu.edu.cn/showproblem.php?pid=4414 CSUST:点击打开链接 Finding crosses Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 729    Accepted Submission(s): 411 Problem Description The Nazca L…

题目链接:hdu 4414 其实是一道简单的字符型水题,不涉及任何算法,可比赛时却没能做出来,这几天的状态都差到家了... 题目大意是求有多少个满足条件的十字架,十字架的边不能有分叉路口,所以枚举每个点看是否满足条件就行,只是编码量的问题而已(感觉自己的码力不断下降了,我也不知道该怎么办好..) #include<cstdio> #include<cstring> #include<algorithm> using namespace std; ][]; int n;…

Problem Description The Nazca Lines are a series of ancient geoglyphs located in the Nazca Desert in southern Peru. They were designated as a UNESCO World Heritage Site in 1994. The high, arid plateau stretches more than 80 kilometres (50 mi) between…

题意:在N*N的图中,找出孤立存在的十字架的个数.十字架要求为正十字,孤立表示组成十字架的‘#的周围的一格再无’#‘. dfs找出在中心的‘#’(周围四格也为‘#'),则缩小了搜索范围,再bfs找出是否是符合要求. #include <cstdio> #include <iostream> #include <cmath> #include <cstring> #include <algorithm> using namespace std; c…

Finding crosses Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1631 Accepted Submission(s): 868 Problem Description The Nazca Lines are a series of ancient geoglyphs located in the Nazca Desert i…

我用临接表模拟容器超时 #include<stdio.h> #include<string.h> #include<vector> using namespace std; #define N 110000 vector<int>q[N]; int f[N]; int main() { int t,n,m,i,j,k,a,b; scanf("%d",&t); while(t--) { scanf("%d%d",…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4772 题面: Zhuge Liang's Password Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1404    Accepted Submission(s): 926 Problem Description In the anc…

两只兔子Tom和Jerry在一个n*n的格子区域跑,分别起始于(1,1)和(n,n),有各自的速度speed(格/小时).初始方向dir(E.N.W.S)和左转周期turn(小时/次). 各自每小时往E.N.W.S中一个方向跑speed格,每隔turn小时左转一次(即逆时针的下一个方向). 行走中若第i步将碰壁,则第i步及剩余步改为原方向的相反方向(即折返). 两只兔子若在第i小时到达同一点,则交换彼此的方向再走下一小时:若相遇时有兔子恰好该左转,则放弃此次左转. 第一眼像搜索,后来发现只是简单…

题目: 士兵队列训练问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56 Accepted Submission(s): 37   Problem Description 某部队进行新兵队列训练,将新兵从一開始按顺序依次编号,并排成一行横队.训练的规则例如以下:从头開始一至二报数.凡报到二的出列,剩下的向小序号方向靠拢,再从头開始进行一…

题意:一天一共有1440分钟,主人公每天有n件事要做,给出这n件事开始跟结束的时间,然后让你求出,空闲的时间的总分钟数是多少. 解题报告:简单模拟,只要开个一维数组标记那个每个分钟是否是有事的就可以了,有事的每次输入都标记掉就可以了. #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; ]; int trans(int x…