#938849 (C++17) No.2225 Treasure Searching Rod (Easy)

• 問題: No.2225 Treasure Searching Rod (Easy)
• ユーザー: *yudai25n
• 提出日時: 2023-12-17 18:35:15
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 161 ms / 2,000 ms
• コード長: 1,724 bytes
• コンパイル時間: 3,927 ms
• コンパイル使用メモリ: 269,844 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-27 08:02:17
• 合計ジャッジ時間: 7,160 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	161 ms; 5,376 KB
testcase_08	AC	153 ms; 5,376 KB
testcase_09	AC	153 ms; 5,376 KB
testcase_10	AC	154 ms; 5,376 KB
testcase_11	AC	155 ms; 5,376 KB
testcase_12	AC	154 ms; 5,376 KB
testcase_13	AC	152 ms; 5,376 KB
testcase_14	AC	148 ms; 5,376 KB
testcase_15	AC	142 ms; 5,376 KB
testcase_16	AC	141 ms; 5,376 KB
testcase_17	AC	146 ms; 5,376 KB
testcase_18	AC	144 ms; 5,376 KB
testcase_19	AC	142 ms; 5,376 KB
testcase_20	AC	142 ms; 5,376 KB
testcase_21	AC	36 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	50 ms; 5,376 KB
testcase_24	AC	85 ms; 5,376 KB
testcase_25	AC	11 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 4e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 


//-----def end-----//


int main () {
    int h , w , k;
    cin >> h >> w >> k;
    vector<int> x(k) , y(k) , v(k);
    rep(i , k) cin >> x[i] >> y[i] >> v[i];
    rep(i , k) x[i]-- , y[i]--;
    map<pair<int,int> , int> mp;
    rep(i , k) mp[{x[i],y[i]}] = v[i];
    mint9 res = 0;
    rep(i , h) rep(j , w) {
        int cnt = 0;
        rep(di , h-i) {
            rep(dj , -cnt , cnt+1) {
                int ni = i+di , nj = j+dj;
                res += mp[{ni,nj}];
            }
            cnt++;
        }
    }
    cout << res.val() << endl;
	return 0;
}