2021 GDUT 新生专题训练
DFS/BFS 与 二分
知识总结
DFS
这是一种以深度为第一优先级的算法，即有一个人，前面有多条道路，选择了其中一条后，义无反顾的向前走，直到到尽头为止吗，然后回退的搜索过程，适合寻找连通块，构造字符串等待
代码
bool vis[N]; // 访问标记数组
void dfs(int step) {
if (step == n + 1) { // 边界
//输出结果
return;
}
for (int i = 1; i <= n; i++) { //遍历情况
if (!vis[i]) { //是否已访问
vis[i] = 1; //标记
dfs(step + 1); //深入搜索
vis[i] = 0; //取消标记，避免从另一条路过来无法通过
}
}
}
BFS
这是一种以广度为第一优先级的算法，即像一棵树，像四周开枝条散叶，然后后面的枝条接着开枝散叶，直到不能再进一步为止或者找到答案
代码
bfs(s) {
q = new queue()
q.push(s), visited[s] = true
while (!q.empty()) {
u = q.pop()
for each edge(u, v) {
if (!visited[v]) {
q.push(v)
visited[v] = true
}
}
}
}
二分
即对一个物品进行折半，若大于条件则选择一边，否则选择另一边，可用于对有序数组进行查找指定值的位置，也可以用于对答案进行二分枚举减小时间复杂度
代码
int l = 1, r = MAXINT;
while (l < r) { // 如果两点不相邻
int mid = (l + r) / 2; // 取中间值
if (check(mid)) l = mid;
else r = mid-1;
}
return l; // 返回左边值
题解
题目
A - Lake Counting
Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (’.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John’s field, determine how many ponds he has.
input
- Line 1: Two space-separated integers: N and M*
- Lines 2…N+1: M characters per line representing one row of Farmer John’s field. Each character is either ‘W’ or ‘.’. The characters do not have spaces between them.*
output
- Line 1: The number of ponds in Farmer John’s field.
样例
Input
10 12 W........WW. .WWW.....WWW ....WW...WW. .........WW. .........W.. ..W......W.. .W.W.....WW. W.W.W.....W. .W.W......W. ..W.......W.
Output
3
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
思路
求连通的区域可以通过搜索进行判断，找到一个W后进行覆盖搜索，并且答案加一，最后输出答案即可
代码
#include <iostream>
using namespace std;
char arr[105][105];
int dir[8][2] = {{-1 ,-1} , {-1 , 0} , {-1 , 1} , {0 , -1} , {0 , 1} , {1 , -1} , {1 , 0} , {1 , 1}};
int n , m;
void dfs (int x , int y) {
for (int i = 0 ; i < 8 ; ++i) {
if (arr[x + dir[i][0]][y + dir[i][1]] == 'W') {
arr[x + dir[i][0]][y + dir[i][1]] = '.';
dfs (x + dir[i][0] , y + dir[i][1]);
}
}
}
int main () {
int ans = 0;
cin >> n >> m;
for (int i = 1 ; i <= n ; ++ i) {
for (int j = 1 ; j <= m ; ++ j) {
cin >> arr[i][j];
}
}
for (int i = 1 ; i <= n ; ++ i) {
for (int j = 1 ; j <= m ; ++ j) {
if (arr[i][j] == 'W') {
ans++;
dfs (i , j);
}
}
}
cout << ans;
return 0;
}
题目
B - Red and Black
Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (’.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
input
The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
‘.’ - a black tile
‘#’ - a red tile
‘@’ - a man on a black tile(appears exactly once in a data set)
The end of the input is indicated by a line consisting of two zeros.
output
For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).
样例
Input
6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#.. 0 0
Output
45 59 6 13
Hint
Doesn’t have
思路
求能走的位置有多少个，可以考虑用深度优先搜索进行四个方向的便利，通过vis进行已经过的标记来避免四个方向回退导致错误答案
代码
#include <iostream>
#include <cstring>
using namespace std;
char arr[25][25];
int dir[4][2] = {{-1,0}, {1,0} , {0,-1} , {0,1}} , vis[25][25];
int n , m , ans = 0;
void dfs (int x , int y) {
if (!vis[x][y]) {
vis[x][y] = 1;
for (int i = 0 ; i < 4 ; ++i) {
if (arr[x + dir[i][0]][y + dir[i][1]] == '.' && !vis[x + dir[i][0]][y + dir[i][1]]) {
ans++;
dfs (x + dir[i][0] , y + dir[i][1]);
}
}
}
}
int main () {
int sx , sy;
while (cin >> m >> n && (m != 0 && n != 0)) {
ans = 0;
memset (arr , 0 , sizeof (arr));
memset (vis , 0 , sizeof (vis));
for (int i = 1 ; i <= n ; ++ i) {
for (int j = 1 ; j <= m ; ++ j) {
cin >> arr[i][j];
vis[i][j];
if (arr[i][j] == '@')
sx = i,sy=j;
}
}
dfs (sx , sy);
cout << ans + 1 << endl;
}
return 0;
}
题目
I have N precious stones, and plan to use K of them to make a necklace for my mother, but she won’t accept a necklace which is too heavy. Given the value and the weight of each precious stone, please help me find out the most valuable necklace my mother will accept.
input
The first line of input is the number of cases.
For each case, the first line contains two integers N (N <= 20), the total number of stones, and K (K <= N), the exact number of stones to make a necklace.
Then N lines follow, each containing two integers: a (a<=1000), representing the value of each precious stone, and b (b<=1000), its weight.
The last line of each case contains an integer W, the maximum weight my mother will accept, W <= 1000.
output
For each case, output the highest possible value of the necklace.
样例
Input
1 2 1 1 1 1 1 3
Output
1
Hint
Doesn’t have
思路
通过DFS搜索每一个物品，判断是否取且不超过最大数量，最终与上次答案比较即可
代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
struct node {
int v , w;
} a[25];
int mans = 0 , N;
void dfs (int n , int sw , int sk , int ans) {
if (n > N ) {
if (sk >= 0 && sw >= 0) {
mans = max (ans , mans);
}
return ;
}
if (sw < 0 || sk < 0) return ;
dfs (n+1 , sw , sk , ans);
dfs (n+1 , sw-a[n].w , sk-1 , ans+a[n].v);
}
int main () {
int t , k , mw;
cin >> t;
while (t--) {
cin >> N >> k;
for (int i = 1 ; i <= N ; ++i) cin >> a[i].v >> a[i].w;
cin >> mw;
mans = 0;
dfs (1 , mw , k , 0);
cout << mans << endl;
}
return 0;
}
题目
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero.
input
The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.
output
The output should contains the smallest possible length of original sticks, one per line.
样例
Input
9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0
Output
6 5
Hint
Doesn’t have
思路
答案枚举+搜索+剪枝
1.通过优化搜索序，从大到小，因为小的更加灵活可以组合
2.记录上一次使用的木棍长度，如果这一根仍然是，就跳过
3.预先记录总长度，保证答案能被总长度整除
4.若某组拼接不成立，且此时已经接好的小木棍长度为0或者当前已拼接的长度与当前的木棍长度相加为答案时，则跳出循环返回，因为此时枚举更小的木棍，情况更少且凑不齐
代码
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100;
int a[N] , vis[N] , n , len , res;
bool dfs (int t , int l , int last) {
if (t > res) return true;
if (l == len) return dfs (t + 1 , 0 , 1);
int fail = 0;
for (int i = last ; i <= n ; ++i) {
if (!vis[i] && a[i]+l <= len && fail != a[i]) {
vis[i] = 1;
if (dfs (t , l + a[i] , last + 1))
return true;
vis[i] = 0;
fail = a[i];
if (l == 0 || l + a[i] == len) return false;
}
}
return false;
}
bool cmp (int a , int b) {
return a > b;
}
int main () {
int sum , cnt;
while (scanf ("%d" , &n) && n != 0) {
sum = 0;
cnt = 1;
for (int i = 1 ; i <= n ; ++i) {
scanf ("%d" , &a[cnt]);
if (a[cnt] <= 50) {
sum += a[cnt];
cnt++;
}
}
n = cnt - 1;
sort (a + 1 , a + n + 1 , cmp);
memset (vis , 0 , sizeof (vis));
for (len = a[1] ; len <= sum ; ++len) {
if (sum % len) continue;
res = sum / len;
if (dfs (1 , 0 , 1)) {
cout << len << endl;
break;
}
}
}
return 0;
}
题目
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.
input
The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.
output
For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.
样例
Input
2 6 19 0
Output
10 100100100100100100 111111111111111111
Hint
Doesn’t have
思路
暴力搜索枚举答案即可
代码
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 105;
int flag = 0;
void dfs (long long ans , long long num) {
if (flag) return ;
if (ans <= 0) return ;
if (ans % num == 0) {
flag = 1;
cout << ans << endl;
} else {
dfs (ans * 10 , num);
dfs (ans * 10 + 1 , num);
}
}
int main () {
long long n;
while (scanf ("%lld" , &n) && n != 0) {
flag = 0;
dfs (1 , n);
}
return 0;
}
题目
You play a new RPG. The world map in it is represented by a grid of n × m cells. Any playing character staying in some cell can move from this cell in four directions — to the cells to the left, right, forward and back, but not leaving the world map.
Monsters live in some cells. If at some moment of time you are in the cell which is reachable by some monster in d steps or less, he immediately runs to you and kills you.
You have to get alive from one cell of game field to another. Determine whether it is possible and if yes, find the minimal number of steps required to do it.
input
The first line contains three non-negative integers n, m and d (2 ≤ n·m ≤ 200000, 0 ≤ d ≤ 200000) — the size of the map and the maximal distance at which monsters are dangerous.
Each of the next n lines contains m characters. These characters can be equal to «.», «M», «S» and «F», which denote empty cell, cell with monster, start cell and finish cell, correspondingly. Start and finish cells are empty and are presented in the input exactly once.
output
If it is possible to get alive from start cell to finish cell, output minimal number of steps required to do it. Otherwise, output «-1».
样例
Input
5 7 1 S.M...M ....... ....... M...M.. ......F7 6 2 S..... ...M.. ...... .....M ...... M..... .....F7 6 2 S..... ...M.. ...... ...... .....M M..... .....F4 4 2 M... .S.. .... ...F
Output
1211-1-1
Hint
Doesn’t have
思路
通过对每个怪物点位置加入队列进行维护，一遍bfs将怪物能覆盖的面积标记为不可走，然后再跑一遍bfs统计答案
代码
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
const int N = 200005;
int a[N] , vis[N] , dp[N] , dx[5] = {0,-1,0,0,1} , dy[5] = {0,0,-1,1,0} , s , f , temp , v;
int q[N*10] , head = 0 , tail = 0;
void qpush (int n) {
q[tail++] = n;
}
int qpop () {
return q[head++];
}
bool qempty () {
return head == tail;
}
void qredo () {
head = 0; tail = 0;
}
int n , m , d;
bool check (int num , int i , int &v) {
int x , y;
x = num / m + dx[i]; y = num % m + dy[i];
v = x * m + y;
if (x >= 0 && x < n && y >= 0 && y < m) return true;
return false;
}
int bfs () {
qredo ();
qpush (s);
dp[s] = 0;
while (!qempty()) {
temp = qpop ();
if (temp == f) {
return dp[temp];
}
for (int i = 1 ; i <= 4 ; ++i) {
if (check (temp , i , v)) {
if (!a[v] && !vis[v]) {
qpush (v);
vis[v] = 1;
dp[v] = dp[temp] + 1;
}
}
}
}
return -1;
}
int main () {
char ch;
scanf ("%d %d %d" , &n , &m , &d);
for (int i = 0 ; i < n ; ++i)
for (int j = 0 ; j < m ; ++j) {
scanf (" %c" , &ch);
if (ch == 'S') s = i * m + j;
if (ch == 'F') f = i * m + j;
if (ch == 'M') {
a[i*m+j] = d + 1;
vis[i*m+j] = 1;
qpush (i*m+j);
}
}
while (!qempty()) {
temp = qpop();
if (a[temp] == 1) continue;
for (int i = 1 ; i <= 4 ; ++i) {
if (check (temp , i , v)) {
if (!vis[v]) {
a[v] = a[temp] - 1;
vis[v] = 1;
qpush (v);
}
}
}
}
if (a[s] || a[f]) {
printf ("-1");
return 0;
}
printf ("%d" , bfs());
return 0;
}
题目
Obs: this is an interactive problem. More information is under the “Interaction” section.
MaratonIME is gathering to start another group practice. This time, Renzo decided to reward the students with candies as they solve problems. Curious as they are, the members of MaratonIME started to guess how many candies did Renzo bring. For each question, Renzo answered if the amount of candies was higher, lower or equal to the number asked.
Breno, noticing that the amount of candies could be very high, decided to limit the number of queries to 50. This way, the practice would start as soon as possible.
Renzo bought at least 1 and no more than 109 candies. Find how many candies were bought by Renzo with no more than 50 questions.
input
For every question asked, read a character. It will be " > " if the amount of Renzo’s candies is higher than your guess, " < " if the amount of Renzo’s candies is lower than your guess or " = " if your guess is equal to the amount of Renzo’s candies.
output
You must print every query in the format “Q y”, where y is the number guessed, and 1 ≤ y ≤ 109. After printing a question, you need to flush the output. Check the “Interaction” section for examples of how to flush the output.
Interaction
To ask Renzo a question, print the query in the format above. After printing a question, you need to flush the output. See examples below for each language:
C: fflush(stdout)
C++: cout.flush()
Java: System.out.flush()
Python: sys.stdout.flush()
Pascal: flush(output)
After each query, read a character as described above.
As soon as Renzo answers your question with “=” the program has to terminate. Your answer will be considered correct if you asked no more than 50 questions.
样例
Input
> < =
Output
Q 1 Q 3 Q 2
Hint
In the example, the number of candies is 2. The answer is considered to be correct because only 3 out of the 50 possible questions were asked to obtain the character " = ".
Make sure to flush the output after printing each question!
思路
二分猜答案，看是大还是小，然后逼近
代码
#include <iostream>
using namespace std;
int main () {
char ch;
int guess , l = 1 , r = 1e9 , win = 0;
for (int i = 1 ; i <= 50 ; ++i) {
guess = (l + r) / 2;
cout << "Q " << guess << endl;
cout.flush ();
cin >> ch;
switch (ch) {
case '>' : l = guess + 1; break;
case '<' : r = guess - 1; break;
case '=' : win = 1; break;
}
if (win) break;
}
return 0;
}
题目
Order is an important concept in mathematics and in computer science. For example, Zorn’s Lemma states: ``a partially ordered set in which every chain has an upper bound contains a maximal element.’’ Order is also important in reasoning about the fix-point semantics of programs.
This problem involves neither Zorn’s Lemma nor fix-point semantics, but does involve order.
Given a list of variable constraints of the form x < y, you are to write a program that prints all orderings of the variables that are consistent with the constraints.For example, given the constraints x < y and x < z there are two orderings of the variables x, y, and z that are consistent with these constraints: x y z and x z y.
input
The input consists of a sequence of constraint specifications. A specification consists of two lines: a list of variables on one line followed by a list of contraints on the next line. A constraint is given by a pair of variables, where x y indicates that x < y.
All variables are single character, lower-case letters. There will be at least two variables, and no more than 20 variables in a specification. There will be at least one constraint, and no more than 50 constraints in a specification. There will be at least one, and no more than 300 orderings consistent with the contraints in a specification.
Input is terminated by end-of-file.
output
For each constraint specification, all orderings consistent with the constraints should be printed. Orderings are printed in lexicographical (alphabetical) order, one per line.
Output for different constraint specifications is separated by a blank line.
样例
Input
a b f g a b b f v w x y z v y x v z v w v
Output
abfg abgf agbf gabf wxzvy wzxvy xwzvy xzwvy zwxvy zxwvy
Hint
Doesn’t have
思路
拓扑排序板子，PS：要按字典序！！！
代码
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 100;
int a[MAXN] , b[MAXN] , head[MAXN] , nxt[MAXN] , to[MAXN] , in[MAXN] , ans[MAXN] , res , cnt , atot;
void add (int u , int v) {
nxt[++cnt] = head[u];
to[cnt] = v;
head[u] = cnt;
in[v]++;
}
int getList (int *list) {
char temp[MAXN];
int tot = 0;
if (gets (temp) == NULL) return 0;
for (int i = 0 ; temp[i] ; ++i)
if (temp[i] >= 'a' && temp[i] <= 'z') list[tot++] = temp[i]-'a';
return tot;
}
void dfs () {
if (res == atot) {
for (int i = 0 ; i < res ; ++i) printf ("%c" , ans[i]+'a');
printf ("\n");
return ;
}
for (int i = 0 ; i < atot ; ++i) {
int u = a[i];
if (!in[u]) {
for (int v = head[u] ; ~v ; v = nxt[v]) in[to[v]]--;
in[u]++;
ans[res++] = u;
dfs ();
in[u]--;
res--;
for (int v = head[u] ; ~v ; v = nxt[v]) in[to[v]]++;
}
}
}
int main () {
while (atot = getList (a)) {
int btot = getList (b);
sort (a , a + atot);
cnt = -1; res = 0;
for (int i = 0 ; i < MAXN ; ++i) head[i] = -1 , in[i] = 0;
for (int i = 0 ; i < btot ; i += 2) {
add (b[i] , b[i+1]);
}
dfs ();
printf ("\n");
}
return 0;
}
题目
When a thin rod of length L is heated n degrees, it expands to a new length L’=(1+n*C)*L, where C is the coefficient of heat expansion.
When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the segment.Your task is to compute the distance by which the center of the rod is displaced.
input
The input contains multiple lines. Each line of input contains three non-negative numbers: the initial lenth of the rod in millimeters, the temperature change in degrees and the coefficient of heat expansion of the material. Input data guarantee that no rod expands by more than one half of its original length. The last line of input contains three negative numbers and it should not be processed.
output
For each line of input, output one line with the displacement of the center of the rod in millimeters with 3 digits of precision.
样例
Input
1000 100 0.0001 15000 10 0.00006 10 0 0.001 -1 -1 -1
Output
61.329 225.020 0.000
Hint
Doesn’t have
思路
二分答案，加数学知识与三角函数
代码
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const double esp = 1e-6;
double L , n , c , S;
bool calc (double h) {
double r = h + L * L / (4 * h);
return r * asin (L / r) > S;
}
int main () {
double l , r , mid;
while (cin >> L >> n >> c) {
if (L < 0 && n < 0 && c < 0) break;
S = L * ( 1 + n * c );
//猜高
l = 0.0; r = L;
while (r - l > esp) {
mid = (l+r)/2.0;
if (calc (mid)) r = mid;
else l = mid;
}
printf ("%.3lf\n" , mid);
}
return 0;
}
题目
You are given two integers aa and bb. You may perform any number of operations on them (possibly zero).
During each operation you should choose any positive integer xx and set a:=a−xa:=a−x, b:=b−2xb:=b−2x or a:=a−2xa:=a−2x, b:=b−xb:=b−x. Note that you may choose different values of xx in different operations.
Is it possible to make aa and bb equal to 00 simultaneously?
Your program should answer tt independent test cases.
input
The first line contains one integer tt (1≤t≤1001≤t≤100) — the number of test cases.
Then the test cases follow, each test case is represented by one line containing two integers aa and bb for this test case (0≤a,b≤1090≤a,b≤109).
output
For each test case print the answer to it — YES if it is possible to make aa and bb equal to 00 simultaneously, and NO otherwise.
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).
样例
Input
3 6 9 1 1 1 2
Output
YES NO YES
Hint
In the first test case of the example two operations can be used to make both aa and bb equal to zero:
- choose x=4x=4 and set a:=a−xa:=a−x, b:=b−2xb:=b−2x. Then a=6−4=2a=6−4=2, b=9−8=1b=9−8=1;
- choose x=1x=1 and set a:=a−2xa:=a−2x, b:=b−xb:=b−x. Then a=2−2=0a=2−2=0, b=1−1=0b=1−1=0.
思路
数学：已知1:2，或2:1的情况下，设x个1:2 y个2:1;故有a=2x+y , b = x+2y;判断是否成立即可
代码
#include <iostream>
using namespace std;
int main () {
int t , a , b;
cin >> t;
while (t--) {
cin >> a >> b;
if ((2 * b - a) % 3 == 0 && (2 * a - b) % 3 == 0 && (2 * b - a) >= 0 && (2 * a - b) >= 0) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}
114
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
