2022-01-05每日刷题打卡

一、Y总视频进度

二、刷题

2.1 AcWing-789：差分矩阵

1. 问题描述

2. 问题分析

3. 问题解决

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 1010;
int n, m, q;
int a[N][N], b[N][N];

void modify(int x1, int y1, int x2, int y2, int c)
{
    b[x1][y1] += c;
    b[x2+1][y1] -= c;
    b[x1][y2+1] -= c;
    b[x2+1][y2+1] += c;
}

int main()
{
    scanf("%d%d%d", &n, &m, &q);
    
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ )
            scanf("%d", &a[i][j]);
    
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j ++)
            modify(i, j, i, j, a[i][j]);
    
    while(q--)
    {
        int x1, y1, x2, y2, c;
        scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
        
        modify(x1, y1, x2, y2, c);
    }
    
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            b[i][j] += b[i][j-1] + b[i-1][j] -b[i-1][j-1];
            
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
            printf("%d ", b[i][j]);
        putchar('\n');
    }
    
    return 0;
}

2.2 AcWing-844：走迷宫

1. 问题描述

2. 问题分析

bfs模板题目，必须背下来

3. 问题解决

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>

#define x first
#define y second
using namespace std;

typedef pair<int, int> PII;

const int N = 105;
int g[N][N], d[N][N];
int n, m;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

int bfs()
{
    queue<PII> q;
    
    // 初始化
    memset(d, -1, sizeof(d));
    d[0][0] = 0;
    q.push({0, 0});
    
    
    while(!q.empty())
    {
        // 取队首
        PII t = q.front();
        q.pop();
        
        // 操作
        for (int i = 0; i < 4; i++)
        {
            int x = t.x + dx[i], y = t.y + dy[i];
            
            if(x >= 0 && x < n && y >= 0 && y < m && g[x][y] == 0 && d[x][y] == -1)
            {
                d[x][y] = d[t.x][t.y] + 1;
                q.push({x, y});
            }
        }
    }
    
    return d[n-1][m-1];
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            scanf("%d", &g[i][j]);
    
    printf("%d\n", bfs());
        
    return 0;
}