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

• 問題: No.2225 Treasure Searching Rod (Easy)
• ユーザー: akua
• 提出日時: 2023-02-24 22:30:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 387 ms / 2,000 ms
• コード長: 6,984 bytes
• コンパイル時間: 6,334 ms
• コンパイル使用メモリ: 238,932 KB
• 実行使用メモリ: 81,612 KB
• 最終ジャッジ日時: 2024-09-13 05:45:23
• 合計ジャッジ時間: 17,226 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	383 ms; 81,392 KB
testcase_01	AC	384 ms; 81,528 KB
testcase_02	AC	384 ms; 81,488 KB
testcase_03	AC	383 ms; 81,328 KB
testcase_04	AC	382 ms; 81,508 KB
testcase_05	AC	383 ms; 81,368 KB
testcase_06	AC	384 ms; 81,500 KB
testcase_07	AC	387 ms; 81,396 KB
testcase_08	AC	385 ms; 81,520 KB
testcase_09	AC	384 ms; 81,532 KB
testcase_10	AC	384 ms; 81,368 KB
testcase_11	AC	384 ms; 81,468 KB
testcase_12	AC	385 ms; 81,604 KB
testcase_13	AC	385 ms; 81,612 KB
testcase_14	AC	385 ms; 81,408 KB
testcase_15	AC	383 ms; 81,328 KB
testcase_16	AC	383 ms; 81,432 KB
testcase_17	AC	383 ms; 81,356 KB
testcase_18	AC	383 ms; 81,480 KB
testcase_19	AC	385 ms; 81,480 KB
testcase_20	AC	386 ms; 81,440 KB
testcase_21	AC	383 ms; 81,476 KB
testcase_22	AC	384 ms; 81,304 KB
testcase_23	AC	384 ms; 81,584 KB
testcase_24	AC	384 ms; 81,364 KB
testcase_25	AC	384 ms; 81,472 KB

ソースコード

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
template<class T> void debug(T s){cout << "test" << " " <<  s << endl;} 
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
ll mod =998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(5000000); 
  using vm=vector<mint> ;
using vvm=vector<vm> ;
 
 
ll sqrt_(ll x) {
  ll l = 0, r = ll(3e9)+1;
  while (l+1<r) {
    ll c = (l+r)/2;
    if (c*c <= x) l = c; else r = c;
  }
  return l;
}
int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}
struct edge{
  int to; int w;
  edge(int to,int w) : to(to),w(w){}
};
//snuke
template<typename T>
struct Matrix {
  int h, w;
  vector<vector<T> > d;
  Matrix() {}
  Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {}
  Matrix& unit() {
    //assert(h == w);
    rep(i,h) d[i][i] = 1;
    return *this;
  }
  const vector<T>& operator[](int i) const { return d[i];}
  vector<T>& operator[](int i) { return d[i];}
  Matrix operator*(const Matrix& a) const {
    //assert(w == a.h);
    Matrix r(h, a.w);
    rep(i,h)rep(k,w)rep(j,a.w) {
      r[i][j] += d[i][k]*a[k][j];
    }
    return r;
  }
  Matrix pow(ll t) const {
  //  assert(h == w);
    if (!t) return Matrix(h,h).unit();
    if (t == 1) return *this;
    Matrix r = pow(t>>1);
    r = r*r;
    if (t&1) r = r*(*this);
    return r;
  }
};
struct S{
    long long value;
    int size;
};
using F = long long;

S op(S a, S b){ return {a.value+b.value, a.size+b.size}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){ return {x.value + f*x.size, x.size}; }
F composition(F f, F g){ return f+g; }
F id(){ return 0; }
//g++ main.cpp -std=c++17 -I .  
int main(){cin.tie(0);ios::sync_with_stdio(false);
  int h,w,k; cin >> h >> w >> k;
  vvp g(h+w+1);
  rep(i,k){
    int x,y,v; cin >> x>> y >> v;
    g[x+y].push_back(P(x-y,v));
  }
  rep(i,h+w+1)sort(g[i].begin(),g[i].end());
  vll maxv(h+w+1,-inf),minv(h+w+1,inf);
  {
    int i=1;
    for(ll j=1; j<=w; j++){
      chmax(maxv[i+j],i-j);
      chmin(minv[i+j],i-j);
    }
    i=h;
    for(ll j=1; j<=w; j++){
      chmax(maxv[i+j],i-j);
      chmin(minv[i+j],i-j);
    }
  }
  {
    int j=1;
    for(ll i=1; i<=h; i++){
      chmax(maxv[i+j],i-j);
      chmin(minv[i+j],i-j);
    }
    j=w;
    for(ll i=1; i<=h; i++){
      chmax(maxv[i+j],i-j);
      chmin(minv[i+j],i-j);
    }
  }
  int N=h+w+5;
  vector<S> v(N, {0, 1});
  lazy_segtree<S, op, e, F, mapping, composition, id> segodd(v);
  lazy_segtree<S, op, e, F, mapping, composition, id> segeven(v);
  mint ans=0;
  for(int x=2; x<=h+w; x++){
    minv[x]+=w-1;
    maxv[x]+=w-1;
    if(minv[x]%2==0)segeven.apply(minv[x]/2,maxv[x]/2+1,1);
    else segodd.apply(minv[x]/2,maxv[x]/2+1,1); 
    for(auto u:g[x]){
      int now=u.first+w-1;
      if(now%2){
       ans+=mint(1)*segodd.prod(0,now/2+1).value*u.second;
       ans+=mint(1)*segeven.prod(0,now/2+1).value*u.second;
      }
      else {
       ans+=mint(1)*segeven.prod(0,now/2+1).value*u.second;
       if(now/2)ans+=mint(1)*segodd.prod(0,now/2).value*u.second;
      }
      //cout << ans << endl;
    }
  }
  cout << ans << endl;
}