結果

問題 No.2520 L1 Explosion
ユーザー 👑 AngrySadEight
提出日時 2023-10-27 22:43:11
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 109 ms / 2,000 ms
コード長 5,498 bytes
コンパイル時間 17,381 ms
コンパイル使用メモリ 271,424 KB
最終ジャッジ日時 2025-02-17 15:32:18
ジャッジサーバーID
（参考情報） 		judge4 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>
using mint = modint998244353;
template <typename T>
void debug(T e) {
    cerr << e << endl;
}
template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}
template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}
template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}
template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}
ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}
ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }
int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> X(N);
    vector<ll> Y(N);
    vector<ll> H(N);
    for (ll i = 0; i < N; i++) {
        cin >> X[i] >> Y[i] >> H[i];
    }
    map<ll, ll> mpplus;
    map<ll, ll> mpminus;
    for (ll i = 0; i < N; i++) {
        ll diffs = M - H[i];
        if (diffs <= 0) {
            continue;
        }
        mpplus[X[i] + Y[i] + diffs]++;
        mpplus[X[i] + Y[i] - diffs]++;
        mpminus[X[i] - Y[i] + diffs]++;
        mpminus[X[i] - Y[i] - diffs]++;
    }
    ll plus = 1;
    ll minus = 1;
    for (auto itr = mpplus.begin(); itr != mpplus.end(); itr++) {
        itr->second = plus;
        plus++;
    }
    for (auto itr = mpminus.begin(); itr != mpminus.end(); itr++) {
        itr->second = minus;
        minus++;
    }
    vector<ll> vec_plus(0);
    vector<ll> vec_minus(0);
    for (auto itr = mpplus.begin(); itr != mpplus.end(); itr++) {
        vec_plus.push_back(itr->first);
    }
    for (auto itr = mpminus.begin(); itr != mpminus.end(); itr++) {
        vec_minus.push_back(itr->first);
    }
    // x 軸，y 軸の代わりに プラス軸，マイナス軸
    vector<vector<ll>> imos(plus + 1, vector<ll>(minus + 1));
    for (ll i = 0; i < N; i++) {
        ll diffs = M - H[i];
        if (diffs <= 0) {
            continue;
        }
        ll plus_min = mpplus[X[i] + Y[i] - diffs];
        ll plus_max = mpplus[X[i] + Y[i] + diffs];
        ll minus_min = mpminus[X[i] - Y[i] - diffs];
        ll minus_max = mpminus[X[i] - Y[i] + diffs];
        imos[plus_min][minus_min]++;
        imos[plus_min][minus_max]--;
        imos[plus_max][minus_min]--;
        imos[plus_max][minus_max]++;
    }
    for (ll i = 1; i <= plus; i++) {
        for (ll j = 1; j <= minus; j++) {
            imos[i][j] = imos[i][j] + imos[i - 1][j] + imos[i][j - 1] -
                         imos[i - 1][j - 1];
        }
    }
    ll inv_2 = (mod2 + 1) / 2;
    // debug(vec_plus);
    // debug(vec_minus);
    // debug(imos);
    vector<ll> ans(N + 1);
    for (ll i = 1; i <= plus - 2; i++) {
        for (ll j = 1; j <= minus - 2; j++) {
            if (imos[i][j] >= 1) {
                ll prod = (vec_plus[i] - vec_plus[i - 1]);
                prod = (prod * (vec_minus[j] - vec_minus[j - 1])) % mod2;
                // debug_out(i, j, prod);
                prod = (prod * inv_2) % mod2;
                ans[imos[i][j]] = (ans[imos[i][j]] + prod) % mod2;
            }
        }
    }
    for (ll i = 1; i <= N; i++) {
        cout << ans[i] << endl;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0