結果

問題 No.2520 L1 Explosion
ユーザー sgfcsgfc
提出日時 2023-10-27 22:24:58
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 46 ms / 2,000 ms
コード長 4,441 bytes
コンパイル時間 5,572 ms
コンパイル使用メモリ 330,028 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-25 14:28:05
合計ジャッジ時間 6,910 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vector<ll>>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
template<class T, class U> bool chmin(T& a, const U& b) { const T olda = a; a = gmin(a, b); return olda != a; }
template<class T, class U> bool chmax(T& a, const U& b) { const T olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }

struct xyh {
	ll x;
	ll y;
	ll h;
};

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


	ll n, m;
	cin >> n >> m;

	vector<xyh> v(n);
	REP(i, n) {
		cin >> v[i].x >> v[i].y >> v[i].h;
	}

	//45度回転
	REP(i, n) {
		ll nx = v[i].x - v[i].y;
		ll ny = v[i].x + v[i].y;
		v[i].x = nx;
		v[i].y = ny;
	}

	//二次元累積和
	map<ll, map<ll, ll>> mp;
	REP(i, n) {
		ll r = m - v[i].h;
		if (r <= 0) continue;
		mp[v[i].x - r][v[i].y - r] += 1;
		mp[v[i].x - r][v[i].y + r] -= 1;
		mp[v[i].x + r][v[i].y - r] -= 1;
		mp[v[i].x + r][v[i].y + r] += 1;
	}

	//座圧
	map<ll, ll> xmap;
	map<ll, ll> ymap;

	REPE(x, mp) {
		xmap[x.first] = 0;
		REPE(y, x.second) {
			ymap[y.first] = 0;
		}
	}

	ll i = 0;
	vl xmap2(xmap.size());
	REPE(x, xmap) {
		xmap[x.first] = i;
		xmap2[i] = x.first;
		i++;
	}
	i = 0;
	vl ymap2(ymap.size());
	REPE(y, ymap) {
		ymap[y.first] = i;
		ymap2[i] = y.first;
		i++;
	}

	vm ans(n+1, 0);
	vl sum(ymap.size(), 0);

	ll prevx = -1;
	REPE(x, mp) {
		if (prevx != -1) {
			REP(i, ymap.size() - 1) {
				ans[sum[i]] += (x.first - xmap2[prevx]) * (ymap2[i + 1] - ymap2[i]);
			}
		}

		vl diff(ymap.size(), 0);
		REPE(y, x.second) {
			diff[ymap[y.first]] = y.second;
		}
		ll dsum = 0;
		REP(i, ymap.size() - 1) {
			dsum += diff[i];
			sum[i] += dsum;
		}
		prevx = xmap[x.first];
	}

	REPI(i, 1, n + 1) {
		cout << (ans[i]/mint(2)).val() << endl;

	}
}
0