Submission #1649832

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

vector<pii> nums[100010];
struct Elem {
    int len, ub, val;
    bool operator<(const Elem b) const {
        return len < b.len;
    }
};

signed main() {
    int R, C; cin >> R >> C;
    int N; cin >> N;

    rep(i,0,N) {
        int r, c, a; cin >> r >> c >> a;
        r--; c--;
        nums[r].push_back(pii(c, a));
    }
    rep(i,0,R) sort(nums[i].begin(), nums[i].end());

    vector<int> a(R, INF);
    a[0] = 0;
    vector<Elem> bars;
    bool ng = false;
    rep(i,0,R) rep(j,0,(int)nums[i].size() - 1) {
        int diff_idx = nums[i][j+1].first - nums[i][j].first;
        int diff_val = nums[i][j+1].second - nums[i][j].second;
        bars.push_back(Elem{diff_idx, nums[i][j+1].first, diff_val});
    }

    rep(i,0,bars.size()) {
        int lb = bars[i].ub - bars[i].len;
        int ub = bars[i].ub;
        printf("lb = %lld, ub = %lld, val = %lld\n", lb, ub, bars[i].val);
        if(a[ub] == INF) {
            if(a[lb] == INF) a[ub] = bars[i].val;
            else a[ub] = a[lb] + bars[i].val;
        }
        else {
            if(a[lb] == INF && a[ub] != bars[i].val) ng = true;
            else if(a[ub] != a[lb] + bars[i].val) ng = true;
        }
    }

    int mi = INF, idx = 0;
    rep(i,0,R) {
        if(mi > a[i]) {
            mi = a[i];
            idx = i;
        }
    }

    rep(i,0,R) rep(j,0,(int)nums[i].size()) {
        int p = nums[i][j].first;
        if(idx < p) {
            int diff_val = a[p] - a[idx];
            // printf("mi = %lld, idx = %lld, p = %lld, val = %lld\n", mi, idx, p, diff_val);
            if(nums[i][j].second + diff_val < 0) ng = true;
        }
        else {
            int diff_val = a[idx] - a[p];
            // printf("mi = %lld, idx = %lld, p = %lld, val = %lld, num = %lld\n", mi, idx, p, diff_val, nums[i][j].second);
            if(nums[i][j].second + diff_val < 0) ng = true;
        }
    }
    
    cout << (ng ? "No" : "Yes") << endl;
    return 0;
}

Submission Info

Judge Result