2020ICPC·小米 网络选拔赛第一场 J-Matrix Subtraction

传送门： https://ac.nowcoder.com/acm/contest/7501/J

题意

$给一个n\times m的矩阵和一个a\times b的单位矩阵，然后在n\times m的矩阵中任取a\times b的子矩阵，使其每一位都减1，问能否使原始矩阵变为0。$

思路

$用二维差分来处理原始矩阵，然后设某一位为(x1，y1)，则只需要对a\times b子矩阵进行更新，即(x1，y1)和(x2，y2)。$

$每次处理的时候都需要判断差分矩阵当前这一位是否非负，因为只能进行矩阵减法。$

$二维差分处理原始矩阵：$

for(int i = 1;i <= n; i++) {
           for(int j = 1;j <= m; j++) {
               cin >> mp[i][j];
               p[i][j] = mp[i][j] - mp[i - 1][j] - mp[i][j - 1] + mp[i - 1][j - 1];
           }
       }

$差分更新操作如下：$

void update(int x1, int y1, int x2, int y2, ll k) {
    p[x1][y1] += k;
    p[x1][y2 + 1] -= k;
    p[x2 + 1][y1] -= k;
    p[x2 + 1][y2 + 1] += k;
}
bool flag = 1;
for(int i = 1;i <= n - a + 1 && flag; i++) {
	for(int j = 1;j <= m - b + 1 && flag; j++) {
		int i1 = i + a - 1, j1 = j + b - 1;
			if(p[i][j] > 0)
				update(i, j, i1, j1, -p[i][j]);
			else if(p[i][j] < 0) {
                   flag = 0;
			}
	}
}

$总复杂度为\sum (mn)$

Code（97MS）

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pdd;

#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int i = x;i <= n; i++)

// const ll mod = 998244353;
// const ll mod = 1e9 + 7;
// const double eps = 1e-6;
// const double PI = acos(-1);
// const double R = 0.57721566490153286060651209;

const int N = 1005;

ll mp[N][N];
ll p[N][N];

void update(int x1, int y1, int x2, int y2, ll k) {
    p[x1][y1] += k;
    p[x1][y2 + 1] -= k;
    p[x2 + 1][y1] -= k;
    p[x2 + 1][y2 + 1] += k;
}

void solve() {
   int T;
   cin >> T;
   while(T--) {

       int n, m, a, b;
       cin >> n >> m >> a >> b;
       for(int i = 1;i <= n; i++) {
           for(int j = 1;j <= m; j++) {
               cin >> mp[i][j];
               p[i][j] = mp[i][j] - mp[i - 1][j] - mp[i][j - 1] + mp[i - 1][j - 1];
           }
       }
       bool flag = 1;

       for(int i = 1;i <= n - a + 1 && flag; i++) {
           for(int j = 1;j <= m - b + 1 && flag; j++) {
               int i1 = i + a - 1, j1 = j + b - 1;
               if(p[i][j] > 0)
                   update(i, j, i1, j1, -p[i][j]);
               else if(p[i][j] < 0) {
                   flag = 0;
               }
           }
       }

       for(int i = n - a;i <= n && flag; i++) {
           for(int j = m - b;j <= m && flag; j++) {
               p[i][j] += p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1];
               if(p[i][j]) {
                   flag = 0;
               }
           }
       }
       if(flag)
           cout << "^_^" << endl;
       else
           cout << "QAQ" << endl;
   }
}

signed main() {
    ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);
#ifdef FZT_ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}