結果
問題 | No.2520 L1 Explosion |
ユーザー |
|
提出日時 | 2023-10-27 22:28:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 309 ms / 2,000 ms |
コード長 | 8,153 bytes |
コンパイル時間 | 2,119 ms |
コンパイル使用メモリ | 211,444 KB |
最終ジャッジ日時 | 2025-02-17 15:21:25 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}int pct(int x) { return __builtin_popcount(x); }int pct(ll x) { return __builtin_popcountll(x); }int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename T>void reorder(vector<T> &a, const vector<int> &ord) {int n = a.size();vector<T> b(n);for (int i = 0; i < n; i++) b[i] = a[ord[i]];swap(a, b);}template <typename T>T floor(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? x / y : (x - y + 1) / y);}template <typename T>T ceil(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? (x + y - 1) / y : x / y);}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);cerr << fixed << setprecision(15);}} io_setup;constexpr int inf = (1 << 30) - 1;constexpr ll INF = (1LL << 60) - 1;// constexpr int MOD = 1000000007;constexpr int MOD = 998244353;template <int mod>struct Mod_Int {int x;Mod_Int() : x(0) {}Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}static int get_mod() { return mod; }Mod_Int &operator+=(const Mod_Int &p) {if ((x += p.x) >= mod) x -= mod;return *this;}Mod_Int &operator-=(const Mod_Int &p) {if ((x += mod - p.x) >= mod) x -= mod;return *this;}Mod_Int &operator*=(const Mod_Int &p) {x = (int)(1LL * x * p.x % mod);return *this;}Mod_Int &operator/=(const Mod_Int &p) {*this *= p.inverse();return *this;}Mod_Int &operator++() { return *this += Mod_Int(1); }Mod_Int operator++(int) {Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator--() { return *this -= Mod_Int(1); }Mod_Int operator--(int) {Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator-() const { return Mod_Int(-x); }Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; }Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; }Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; }Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; }bool operator==(const Mod_Int &p) const { return x == p.x; }bool operator!=(const Mod_Int &p) const { return x != p.x; }Mod_Int inverse() const {assert(*this != Mod_Int(0));return pow(mod - 2);}Mod_Int pow(long long k) const {Mod_Int now = *this, ret = 1;for (; k > 0; k >>= 1, now *= now) {if (k & 1) ret *= now;}return ret;}friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; }friend istream &operator>>(istream &is, Mod_Int &p) {long long a;is >> a;p = Mod_Int<mod>(a);return is;}};using mint = Mod_Int<MOD>;template <typename T>struct Cumulative_Sum_2D {vector<vector<T>> v;const int n, m;Cumulative_Sum_2D(const vector<vector<T>> &v) : v(v), n((int)v.size()), m((int)v[0].size()) {}Cumulative_Sum_2D(int n, int m) : v(n, vector<T>(m, 0)), n(n), m(m) {}// 累積和を構築void build() {for (int i = 0; i < n; i++) {for (int j = 1; j < m; j++) v[i][j] += v[i][j - 1];}for (int j = 0; j < m; j++) {for (int i = 1; i < n; i++) v[i][j] += v[i - 1][j];}}// 区間 [lx,rx) × [ly,ry) に imos 法で加算void add(int lx, int ly, int rx, int ry, T x) {lx = max(lx, 0), ly = max(ly, 0), rx = min(rx, n), ry = min(ry, m);if (rx <= lx || ry <= ly) return;v[lx][ly] += x;if (rx < n) v[rx][ly] -= x;if (ry < m) v[lx][ry] -= x;if (rx < n && ry < m) v[rx][ry] += x;}T fold(int a, int b) { return (a <= 0 || b <= 0 ? 0 : v[min(a, n) - 1][min(b, m) - 1]); }// 区間 [lx,rx) × [ly,ry) の総和T sum(int lx, int ly, int rx, int ry) {lx = max(lx, 0), ly = max(ly, 0), rx = min(rx, n), ry = min(ry, m);if (rx <= lx || ry <= ly) return 0;return fold(lx, ly) - fold(rx, ly) - fold(lx, ry) + fold(rx, ry);}};void solve() {ll N, M;cin >> N >> M;vector<ll> x(N), y(N), h(N);rep(i, N) {ll a, b;cin >> a >> b >> h[i];x[i] = a + b;y[i] = a - b;h[i] = max(0LL, M - h[i]);}vector<ll> xs, ys;rep(i, N) xs.eb(x[i] - h[i]), xs.eb(x[i] + h[i]), ys.eb(y[i] - h[i]), ys.eb(y[i] + h[i]);rearrange(xs), rearrange(ys);int H = sz(xs), W = sz(ys);Cumulative_Sum_2D<int> cum(H - 1, W - 1);rep(i, N) {int lx = lb(xs, x[i] - h[i]);int rx = lb(xs, x[i] + h[i]);int ly = lb(ys, y[i] - h[i]);int ry = lb(ys, y[i] + h[i]);cum.add(lx, ly, rx, ry, 1);}cum.build();cum.build();vector<mint> ans(N + 1, 0);rep(i, H - 1) rep(j, W - 1) {int cnt = cum.sum(i, j, i + 1, j + 1);ans[cnt] += (xs[i + 1] - xs[i]) * (ys[j + 1] - ys[j]);}rep2(i, 1, N + 1) cout << ans[i] / 2 << '\n';}int main() {int T = 1;// cin >> T;while (T--) solve();}