A 小d和答案修改(签到)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i, j, k, n;
string s;
cin >> s;
for (i = 0; i < s.length(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') s[i] -= 32;
else if (s[i] >= 'A' && s[i] <= 'Z') s[i] += 32;
}
cout << s << endl;
system("pause");
return 0;
}
B 小d和图片压缩(签到/模拟)
思路:因为数据量很小,我们可以双重for循环进行遍历,将算出的结果存储到新的数组中,最终输出即可
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i, j, n, m;
cin >> n >> m;
vector<vector<int>>nums(n, vector<int>(m, 0));
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> nums[i][j];
}
}
vector<vector<int>>res;
for (i = 0; i < n - 1; i += 2) {
vector<int>v;
for (j = 0; j < m - 1; j += 2) {
int sum = nums[i][j] + nums[i + 1][j] + nums[i][j + 1] + nums[i + 1][j + 1];
int ave = sum / 4;
v.push_back(ave);
}
res.push_back(v);
}
for (i = 0; i < res.size(); i++) {
for (j = 0; j < res[i].size(); j++) {
cout << res[i][j] << " ";
}
cout << endl;
}
system("pause");
return 0;
}
C 小d和超级泡泡堂 (迷宫问题/BFS)
思路:迷宫问题板子题,具体板子详见
#include<bits/stdc++.h>
using namespace std;
vector<string>G;
vector<vector<bool>>visit;
vector<pair<int, int>>dirs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int n, m;
int ans = 0;
typedef struct node {
int x, y;
}point;
void bfs(int startx, int starty) {
point start;
start.x = startx;
start.y = starty;
queue<point>Q;
Q.push(start);
while (!Q.empty()) {
int x = Q.front().x;
int y = Q.front().y;
int new_x, new_y;
for (auto & dir : dirs) {
new_x = x + dir.first;
new_y = y + dir.second;
if (new_x >= 1 && new_x <= n && new_y >= 1 && new_y <= m && !visit[new_x][new_y] && G[new_x][new_y] != '#') {
if (G[new_x][new_y] == '!') ans++;
G[new_x][new_y] = '.';
point p;
p.x = new_x;
p.y = new_y;
Q.push(p);
visit[new_x][new_y] = true;
}
}
Q.pop();
}
}
int main()
{
int i, j, k;
cin >> n >> m;
G.resize(n + 1);
visit.resize(n + 1, vector<bool>(m + 1, false));
int startx, starty;
for (i = 1; i <= n; i++) {
cin >> G[i];
G[i] = " " + G[i];
for (j = 1; j <= m; j++) {
if (G[i][j] == '@') {
startx = i;
starty = j;
}
}
}
visit[startx][starty] = true;
bfs(startx, starty);
cout << ans << endl;
system("pause");
return 0;
}
D 小d和孤独的区间 (数学)
思路:本题我们可以去找每个1两边0的个数,通过观察不难发现,所有包含一个1的区间个数为这个1左边的个数*(1右边的个数 + 1) + 1右边的个数 + 1,拿00100为例就是2 * 3 + 3,总共9个区间,其中2 * 3算的是({001}, {0010}, {00100}, {01}, {010}, {0100}),然后再加上三个({1}, {10}, {100})区间。最终我们求包含每个1的区间个数和即可,这里需要注意一下,最终结果可能会爆int,所以要long long,题主在这里WA了不少发
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i, j, k, n;
cin >> n;
vector<vector<int>>arr;
vector<int>nums(n + 1, 0);
bool flag = false;
int sum = 0;
for (i = 1; i <= n; i++) {
cin >> nums[i];
if (nums[i] == 1) {
vector<int>v = {sum, 0};
if (flag) {
arr[arr.size() - 1][1] = sum;
}
arr.push_back(v);
flag = true;
sum = 0;
} else {
sum++;
}
}
if (nums[n] == 0 && arr.size() > 0) arr[arr.size() - 1][1] = sum;
long long res = 0;
for (i = 0; i < arr.size(); i++) {
res += (long long)arr[i][0] * (arr[i][1] + 1) + arr[i][1] + 1;
}
cout << res << endl;
system("pause");
return 0;
}