結果

問題 No.2520 L1 Explosion
ユーザー SnowBeenDidingSnowBeenDiding
提出日時 2023-10-28 01:06:26
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 106 ms / 2,000 ms
コード長 8,236 bytes
コンパイル時間 6,144 ms
コンパイル使用メモリ 321,960 KB
実行使用メモリ 73,856 KB
最終ジャッジ日時 2024-09-25 15:51:59
合計ジャッジ時間 7,715 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 103 ms
73,728 KB
testcase_07 AC 27 ms
21,120 KB
testcase_08 AC 101 ms
73,856 KB
testcase_09 AC 101 ms
73,856 KB
testcase_10 AC 102 ms
73,856 KB
testcase_11 AC 103 ms
73,856 KB
testcase_12 AC 106 ms
73,856 KB
testcase_13 AC 103 ms
73,728 KB
testcase_14 AC 103 ms
73,856 KB
testcase_15 AC 5 ms
6,944 KB
testcase_16 AC 74 ms
53,760 KB
testcase_17 AC 47 ms
35,200 KB
testcase_18 AC 48 ms
36,480 KB
testcase_19 AC 40 ms
30,464 KB
testcase_20 AC 3 ms
6,944 KB
testcase_21 AC 68 ms
50,176 KB
testcase_22 AC 9 ms
8,448 KB
testcase_23 AC 6 ms
6,940 KB
testcase_24 AC 60 ms
43,008 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
const long long MOD = 998244353;
// using mint = modint1000000007;
// const long long MOD = 1000000007;
// using mint = modint;//mint::set_mod(MOD);

#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repeq(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define repreq(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)
#define endl '\n'  // fflush(stdout);
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define pb push_back
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define FI first
#define SE second
#define ALL(v) (v).begin(), (v).end()
#define INFLL 3000000000000000100LL
#define INF 1000000100
#define PI acos(-1.0L)
#define TAU (PI * 2.0L)

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef tuple<ll, ll, ll> Tlll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<ll> Vl;
typedef vector<Vl> VVl;
typedef vector<VVl> VVVl;
typedef vector<Tlll> VTlll;
typedef vector<mint> Vm;
typedef vector<Vm> VVm;
typedef vector<string> Vs;
typedef vector<double> Vd;
typedef vector<char> Vc;
typedef vector<bool> Vb;
typedef vector<Pll> VPll;
typedef priority_queue<ll> PQl;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQlr;

/* inout */
ostream &operator<<(ostream &os, mint const &m) {
    os << m.val();
    return os;
}
istream &operator>>(istream &is, mint &m) {
    long long n;
    is >> n, m = n;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int n = v.size();
    rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
    int n = v.size();
    rep(i, 0, n) os << v[i];
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
    os << p.first << ' ' << p.second;
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &mp) {
    for (auto &[key, val] : mp) {
        os << key << ':' << val << '\n';
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &st) {
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++) {
        os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');
        itr++;
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, multiset<T> &st) {
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++) {
        os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');
        itr++;
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, queue<T> q) {
    while (q.size()) {
        os << q.front();
        q.pop();
        os << " \n"[q.empty()];
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, stack<T> st) {
    vector<T> v;
    while (st.size()) {
        v.push_back(st.top());
        st.pop();
    }
    reverse(ALL(v));
    os << v;
    return os;
}
template <class T, class Container, class Compare>
ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) {
    vector<T> v;
    while (pq.size()) {
        v.push_back(pq.top());
        pq.pop();
    }
    os << v;
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &in : v) is >> in;
    return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

/* useful */
template <typename T>
int SMALLER(vector<T> &a, T x) {
    return lower_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int orSMALLER(vector<T> &a, T x) {
    return upper_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int BIGGER(vector<T> &a, T x) {
    return a.size() - orSMALLER(a, x);
}
template <typename T>
int orBIGGER(vector<T> &a, T x) {
    return a.size() - SMALLER(a, x);
}
template <typename T>
int COUNT(vector<T> &a, T x) {
    return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
}
template <typename T, typename S>
bool chmax(T &a, S b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename S>
bool chmin(T &a, S b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void press(T &v) {
    v.erase(unique(ALL(v)), v.end());
}
template <typename T>
vector<int> zip(vector<T> b) {
    pair<T, int> p[b.size() + 10];
    int a = b.size();
    vector<int> l(a);
    for (int i = 0; i < a; i++) p[i] = mp(b[i], i);
    sort(p, p + a);
    int w = 0;
    for (int i = 0; i < a; i++) {
        if (i && p[i].first != p[i - 1].first) w++;
        l[p[i].second] = w;
    }
    return l;
}
template <typename T>
vector<T> vis(vector<T> &v) {
    vector<T> S(v.size() + 1);
    rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];
    return S;
}

ll dem(ll a, ll b) { return ((a + b - 1) / (b)); }
ll dtoll(double d, int g) { return round(d * pow(10, g)); }

const double EPS = 1e-10;

void init() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(12);
}

// do {} while (next_permutation(ALL(vec)));

/********************************** START **********************************/

void sol();

int main() {
    init();
    int q = 1;
    // cin >> q;
    while (q--) sol();
    return 0;
}

/********************************** SOLVE **********************************/

template <typename T>
struct SheetOverlapCulculator {
    int n;
    vector<ll> xlv, xrv, ylv, yrv;
    SheetOverlapCulculator() { n = 0; }
    void add_sheet(ll xl, ll xr, ll yl, ll yr) {
        // 半開区間 [xl, xr) × [yl, yr)
        n++;
        xlv.push_back(xl);
        xrv.push_back(xr);
        ylv.push_back(yl);
        yrv.push_back(yr);
    }
    void add_point(ll i, ll j) { add_sheet(i, i + 1, j, j + 1); }
    vector<T> solve() {
        // O(N^2 log N)
        // シートが i 枚重なっている部分の面積を計算
        vector<ll> X1, Y1, X2, Y2, X, Y;
        for (int i = 0; i < n; ++i) {
            ll x1 = xlv[i], y1 = ylv[i];
            X1.push_back(x1);
            Y1.push_back(y1);
            X.push_back(x1);
            Y.push_back(y1);
            ll x2 = xrv[i], y2 = yrv[i];
            X2.push_back(x2);
            Y2.push_back(y2);
            X.push_back(x2);
            Y.push_back(y2);
        }
        sort(X.begin(), X.end());
        X.erase(unique(X.begin(), X.end()), X.end());
        sort(Y.begin(), Y.end());
        Y.erase(unique(Y.begin(), Y.end()), Y.end());
        int w = X.size(), h = Y.size();
        vector<vector<ll>> dp(w, vector<ll>(h));
        for (int i = 0; i < n; ++i) {
            int x1 = lower_bound(X.begin(), X.end(), X1[i]) - X.begin();
            int x2 = lower_bound(X.begin(), X.end(), X2[i]) - X.begin();
            int y1 = lower_bound(Y.begin(), Y.end(), Y1[i]) - Y.begin();
            int y2 = lower_bound(Y.begin(), Y.end(), Y2[i]) - Y.begin();
            dp[x1][y1]++;
            dp[x2][y1]--;
            dp[x1][y2]--;
            dp[x2][y2]++;
        }
        for (int i = 0; i < w; ++i) {
            for (int j = 1; j < h; ++j) {
                dp[i][j] += dp[i][j - 1];
            }
        }
        for (int i = 1; i < w; ++i) {
            for (int j = 0; j < h; ++j) {
                dp[i][j] += dp[i - 1][j];
            }
        }
        vector<T> area(n + 1);
        for (int i = 0; i < w - 1; ++i) {
            for (int j = 0; j < h - 1; ++j) {
                area[dp[i][j]] += (X[i + 1] - X[i]) * ((Y[j + 1] - Y[j]));
            }
        }
        return area;
    }
};

pair<ll, ll> f(ll x, ll y) { return {x + y, x - y}; }

void sol() {
    int n, m;
    cin >> n >> m;
    SheetOverlapCulculator<mint> soc;
    rep(i, 0, n) {
        ll x, y, c;
        cin >> x >> y >> c;
        c = m - c;
        auto [x1, y1] = f(x, y);
        soc.add_sheet(x1 - c, x1 + c, y1 - c, y1 + c);
    }
    auto v = soc.solve();
    mint div2 = (mint)1 / 2;
    rep(i, 1, n + 1) cout << v[i] * div2 << endl;
}
0