#843042 (C++14) No.2225 Treasure Searching Rod (Easy)

• 問題: No.2225 Treasure Searching Rod (Easy)
• ユーザー: kztasa
• 提出日時: 2023-02-24 21:32:22
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 15 ms / 2,000 ms
• コード長: 1,833 bytes
• コンパイル時間: 3,788 ms
• コンパイル使用メモリ: 231,984 KB
• 実行使用メモリ: 4,372 KB
• 最終ジャッジ日時: 2023-10-11 05:53:16
• 合計ジャッジ時間: 5,147 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,348 KB
testcase_01	AC	1 ms; 4,352 KB
testcase_02	AC	2 ms; 4,356 KB
testcase_03	AC	1 ms; 4,348 KB
testcase_04	AC	2 ms; 4,356 KB
testcase_05	AC	2 ms; 4,368 KB
testcase_06	AC	2 ms; 4,352 KB
testcase_07	AC	15 ms; 4,352 KB
testcase_08	AC	15 ms; 4,348 KB
testcase_09	AC	14 ms; 4,348 KB
testcase_10	AC	2 ms; 4,352 KB
testcase_11	AC	2 ms; 4,352 KB
testcase_12	AC	15 ms; 4,348 KB
testcase_13	AC	15 ms; 4,348 KB
testcase_14	AC	14 ms; 4,352 KB
testcase_15	AC	2 ms; 4,352 KB
testcase_16	AC	2 ms; 4,348 KB
testcase_17	AC	2 ms; 4,348 KB
testcase_18	AC	2 ms; 4,352 KB
testcase_19	AC	2 ms; 4,352 KB
testcase_20	AC	1 ms; 4,372 KB
testcase_21	AC	4 ms; 4,352 KB
testcase_22	AC	1 ms; 4,356 KB
testcase_23	AC	4 ms; 4,348 KB
testcase_24	AC	2 ms; 4,352 KB
testcase_25	AC	3 ms; 4,348 KB

ソースコード

#include <bits/stdc++.h> 
#include <atcoder/all>
#define pub push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (ll i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
using namespace atcoder;
using ll = long long; using dd = double;
using Pll = pair<ll, ll>;
using    vll = vector<   ll>; using  vdd = vector< dd>;
using   vvll = vector<  vll>; using vvdd = vector<vdd>;
using  vvvll = vector< vvll>; using vvvdd = vector<vvdd>;
using vvvvll = vector<vvvll>;
using mint = modint998244353;
using mint2 = modint1000000007;

constexpr long long INF = (1LL << 60);
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589;

//////////////////////////////////////////////////////////

template <typename T>
bool chmax(T& a, const T& b) {
	if (a < b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}

template <typename T>
bool chmin(T& a, const T& b) {
	if (a > b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}

template <typename T>
T sq(T x) {
	return x * x;
}

std::string zfill(int n, const int width)
{
	std::stringstream ss;
	ss << std::setw(width) << std::setfill('0') << n;
	return ss.str();
}



int main() {
	//cout << fixed << setprecision(10);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll H, W, K; cin >> H >> W >> K;
	vector<Pll> xy(K); vector<mint> v(K);
	rep(i, K) {
		cin >> xy[i].first >> xy[i].second;
		ll t; cin >> t;
		v[i] = t;
	}
	mint ans = 0;
	rep(i, H) {
		rep(j, W) {
			rep(k, K) {
				if (i + j + 2 <= xy[k].first + xy[k].second && i - j <= xy[k].first - xy[k].se) {
					ans += v[k];
				}
			}
		}
	}
	cout << ans.val() << endl;
}