Submission #1610883

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define pb(x) push_back(x)
#define eb(x,y) emplace_back(x,y)
#define MOD 1000000007
#define MAX 1001
#define INF 1410065408
#define EPS 1e-9
#define DEBUG 0
#define ll long long
#define Pll pair<ll, ll>
#define Pii pair<int, int>
 
using namespace std;
struct edge{int from, to; ll cost;};

signed main(){
    int r, c, n;
    cin >> r >> c >> n;
    vector< vector<int> > matrix(r, vector<int>(c, -1));
    vector<int> row(r, 0), column(c, 0);
    repp(k, n){
        int i, j;
        cin >> i >> j;
        i--; j--;
        cin >> matrix[i][j];
        if(i != 0 && matrix[i-1][j] != -1) row[i] = matrix[i][j] - matrix[i-1][j];
        if(j != 0 && matrix[i][j-1] != -1) column[j] = matrix[i][j] - matrix[i][j-1];
    }

    repp(i, r)repp(j, c){
        if(matrix[i][j] == -1){
            if(i > 0 && j > 0 && matrix[i-1][j-1] != -1 && matrix[i-1][j] != -1 && matrix[i][j-1] != -1){
                if(matrix[i-1][j] + matrix[i][j-1] - matrix[i-1][j-1] < 0){
                    cout << "No" << endl;
                    return 0;
                }
            }
            continue;
        }
        if(i > 0 && matrix[i-1][j] != -1 && matrix[i][j] - matrix[i-1][j] != row[i]){
            cout << "No" << endl;
            return 0;
        }
        if(j > 0 && matrix[i][j-1] != -1 && matrix[i][j] - matrix[i][j-1] != column[j]){
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
    return 0;
}

Submission Info

Judge Result