結果
問題 | No.2520 L1 Explosion |
ユーザー |
![]() |
提出日時 | 2023-10-27 21:49:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 106 ms / 2,000 ms |
コード長 | 1,880 bytes |
コンパイル時間 | 2,133 ms |
コンパイル使用メモリ | 209,004 KB |
最終ジャッジ日時 | 2025-02-17 14:52:16 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;const long long MOD = 998244353;const long long HALF = 499122177;int main(){int N, M;cin >> N >> M;vector<long long> X(N), Y(N), H(N);for (int i = 0; i < N; i++){cin >> X[i] >> Y[i] >> H[i];}for (int i = 0; i < N; i++){tie(X[i], Y[i]) = make_pair(X[i] + Y[i], X[i] - Y[i]);}vector<long long> X2, Y2;for (int i = 0; i < N; i++){X2.push_back(X[i] - (M - H[i]));X2.push_back(X[i] + (M - H[i]));Y2.push_back(Y[i] - (M - H[i]));Y2.push_back(Y[i] + (M - H[i]));}sort(X2.begin(), X2.end());sort(Y2.begin(), Y2.end());X2.erase(unique(X2.begin(), X2.end()), X2.end());Y2.erase(unique(Y2.begin(), Y2.end()), Y2.end());int h = X2.size();int w = Y2.size();vector<vector<int>> imos(h, vector<int>(w, 0));for (int i = 0; i < N; i++){int x1 = lower_bound(X2.begin(), X2.end(), X[i] - (M - H[i])) - X2.begin();int x2 = lower_bound(X2.begin(), X2.end(), X[i] + (M - H[i])) - X2.begin();int y1 = lower_bound(Y2.begin(), Y2.end(), Y[i] - (M - H[i])) - Y2.begin();int y2 = lower_bound(Y2.begin(), Y2.end(), Y[i] + (M - H[i])) - Y2.begin();imos[x1][y1]++;imos[x1][y2]--;imos[x2][y1]--;imos[x2][y2]++;}for (int i = 0; i < h; i++){for (int j = 1; j < w; j++){imos[i][j] += imos[i][j - 1];}}for (int i = 1; i < h; i++){for (int j = 0; j < w; j++){imos[i][j] += imos[i - 1][j];}}vector<long long> ans(N + 1, 0);for (int i = 0; i < h - 1; i++){for (int j = 0; j < w - 1; j++){if (imos[i][j] > 0){long long dx = (X2[i + 1] - X2[i]) % MOD;long long dy = (Y2[j + 1] - Y2[j]) % MOD;ans[imos[i][j]] += dx * dy % MOD * HALF % MOD;ans[imos[i][j]] %= MOD;}}}for (int i = 1; i <= N; i++){cout << ans[i] << endl;}}