結果

問題 No.2520 L1 Explosion
ユーザー ゆにぽけゆにぽけ
提出日時 2023-10-28 00:18:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 88 ms / 2,000 ms
コード長 3,908 bytes
コンパイル時間 1,676 ms
コンパイル使用メモリ 140,320 KB
実行使用メモリ 38,784 KB
最終ジャッジ日時 2024-09-25 15:44:30
合計ジャッジ時間 3,229 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 88 ms
38,656 KB
testcase_07 AC 24 ms
12,288 KB
testcase_08 AC 88 ms
38,656 KB
testcase_09 AC 86 ms
38,656 KB
testcase_10 AC 86 ms
38,528 KB
testcase_11 AC 86 ms
38,784 KB
testcase_12 AC 87 ms
38,784 KB
testcase_13 AC 86 ms
38,656 KB
testcase_14 AC 86 ms
38,656 KB
testcase_15 AC 5 ms
5,376 KB
testcase_16 AC 63 ms
28,416 KB
testcase_17 AC 41 ms
19,328 KB
testcase_18 AC 42 ms
19,968 KB
testcase_19 AC 35 ms
17,024 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 58 ms
26,752 KB
testcase_22 AC 8 ms
5,888 KB
testcase_23 AC 5 ms
5,376 KB
testcase_24 AC 50 ms
23,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
//using mint = modint<1000000007>;
void solve();
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}
int N,M;
long long X[1500],Y[1500],D[1500];
mint ans[1501];
void solve()
{
	cin >> N >> M;
	vector<long long> cx,cy;
	for(int i = 0;i < N;i++)
	{
		long long x,y,h;
		cin >> x >> y >> h;
		long long d = M-h;
		cx.push_back(x-y-d);
		cx.push_back(x-y+d);
		cy.push_back(x+y-d);
		cy.push_back(x+y+d);
		X[i] = x,Y[i] = y,D[i] = d;
	}
	sort(cx.begin(),cx.end());
	cx.erase(unique(cx.begin(),cx.end()),cx.end());
	sort(cy.begin(),cy.end());
	cy.erase(unique(cy.begin(),cy.end()),cy.end());
	vector<vector<int>> A(cx.size()+1,vector<int>(cy.size()+1));
	for(int i = 0;i < N;i++)
	{
		int lx = lower_bound(cx.begin(),cx.end(),X[i]-Y[i]-D[i])-cx.begin();
		int rx = lower_bound(cx.begin(),cx.end(),X[i]-Y[i]+D[i])-cx.begin();
		int ly = lower_bound(cy.begin(),cy.end(),X[i]+Y[i]-D[i])-cy.begin();
		int ry = lower_bound(cy.begin(),cy.end(),X[i]+Y[i]+D[i])-cy.begin();
		A[lx][ly]++,A[lx][ry]--,A[rx][ly]--,A[rx][ry]++;
	}
	mint inv = mint(2).inverse();
	for(int i = 0;i < (int)cx.size();i++)for(int j = 0;j < (int)cy.size();j++)
	{
		if(i) A[i][j] += A[i-1][j];
		if(j) A[i][j] += A[i][j-1];
		if(i && j) A[i][j] -= A[i-1][j-1];
		if(i+1 < cx.size() && j+1 < cy.size())
		{
			int cnt = A[i][j];
			long long W = cx[i+1]-cx[i],H = cy[j+1]-cy[j];
			ans[cnt] += mint(H)*W*inv;
		}
	}
	for(int i = 1;i <= N;i++) cout << ans[i] << "\n";
}
0