結果

問題 No.2229 Treasure Searching Rod (Hard)
ユーザー woodywoodywoodywoody
提出日時 2023-02-24 23:24:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 682 ms / 2,000 ms
コード長 5,303 bytes
コンパイル時間 4,195 ms
コンパイル使用メモリ 239,088 KB
実行使用メモリ 37,692 KB
最終ジャッジ日時 2023-10-11 06:58:13
合計ジャッジ時間 21,610 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 238 ms
33,704 KB
testcase_01 AC 237 ms
33,636 KB
testcase_02 AC 238 ms
33,752 KB
testcase_03 AC 238 ms
33,780 KB
testcase_04 AC 238 ms
33,732 KB
testcase_05 AC 238 ms
33,708 KB
testcase_06 AC 236 ms
33,784 KB
testcase_07 AC 573 ms
36,652 KB
testcase_08 AC 580 ms
36,880 KB
testcase_09 AC 460 ms
35,984 KB
testcase_10 AC 574 ms
36,776 KB
testcase_11 AC 573 ms
36,864 KB
testcase_12 AC 453 ms
36,748 KB
testcase_13 AC 454 ms
36,712 KB
testcase_14 AC 455 ms
36,032 KB
testcase_15 AC 682 ms
37,572 KB
testcase_16 AC 677 ms
37,580 KB
testcase_17 AC 675 ms
37,692 KB
testcase_18 AC 680 ms
37,644 KB
testcase_19 AC 677 ms
37,644 KB
testcase_20 AC 677 ms
37,604 KB
testcase_21 AC 678 ms
37,668 KB
testcase_22 AC 675 ms
37,628 KB
testcase_23 AC 385 ms
35,196 KB
testcase_24 AC 456 ms
35,888 KB
testcase_25 AC 478 ms
36,080 KB
testcase_26 AC 407 ms
34,872 KB
testcase_27 AC 326 ms
34,124 KB
testcase_28 AC 516 ms
36,560 KB
testcase_29 AC 554 ms
36,788 KB
testcase_30 AC 337 ms
34,348 KB
testcase_31 AC 357 ms
34,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

using pmi = pair<mint,int>;

pmi op(pmi a,pmi b){
    pmi ret = {a.fi+b.fi , a.se+b.se};
    return ret;
}
 
pmi e(){
    return {0,0};
}
 
pmi mapping(mint p,pmi a){
    pmi ret = {a.fi + p*a.se , a.se};
    return ret;
}
 
mint composition(mint p,mint q){
    return p+q;
}
 
mint id(){
    return 0;
}


void solve(){
    int h,w,k; cin>>h>>w>>k;
    vvpii v(3e5);
    int cc = 2e5;
    rep(i,k){
        int a,b; cin>>a>>b;
        int c; cin>>c;
        v[a+b].pb({a-b+cc,c});
    }
    const int mx = 4e5;
    lazy_segtree<pmi , op , e , mint , mapping , composition , id> ls0(mx);
    lazy_segtree<pmi , op , e , mint , mapping , composition , id> ls1(mx);
    rep(i,mx) ls0.set(i , {0,1});
    rep(i,mx) ls1.set(i , {0,1});
    mint ans = 0;
    rrepx(i,2,h+w+1){
        fore(y , v[i]){
            if (y.fi%2 == 0){
                ls0.apply(0 , y.fi/2+1  , mint(y.se));
                ls1.apply(0 , y.fi/2  , mint(y.se));
            }else{
                ls0.apply(0 , y.fi/2+1   , mint(y.se));
                ls1.apply(0 , y.fi/2+1  , mint(y.se));
            }
        }
        ll l = max(1,i-w)*2 - i + cc;
        ll u = min(i-1,h)*2 - i + cc;
        // show(i);
        // show2(l,u);
        if (l%2==0) ans += ls0.prod(l/2,u/2+1).fi;
        else ans += ls1.prod(l/2,u/2+1).fi;
    }
    outm;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0