結果
問題 |
No.3214 small square
|
ユーザー |
![]() |
提出日時 | 2025-07-25 23:12:21 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 890 ms / 3,000 ms |
コード長 | 7,309 bytes |
コンパイル時間 | 4,516 ms |
コンパイル使用メモリ | 245,840 KB |
実行使用メモリ | 112,292 KB |
最終ジャッジ日時 | 2025-07-25 23:13:31 |
合計ジャッジ時間 | 27,717 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <complex> #include <cstdio> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <unordered_set> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define UNIQUE(x) \ std::sort((x).begin(), (x).end()); \ (x).erase(std::unique((x).begin(), (x).end()), (x).end()) using i64 = long long; using u64 = unsigned long long; using u32 = unsigned int; using i32 = int; using ld = long double; using f64 = double; template <class T, class U> bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template <class T, class U> bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } template <class T = std::string, class U = std::string> inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") { if (f) std::cout << yes << "\n"; else std::cout << no << "\n"; } namespace io { template <class T, class U> istream& operator>>(istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <class T, class U> ostream& operator<<(ostream& o, pair<T, U>& p) { o << p.first << " " << p.second; return o; } template <typename T> istream& operator>>(istream& i, vector<T>& v) { rep(j, v.size()) i >> v[j]; return i; } template <typename T> string join(vector<T>& v) { stringstream s; rep(i, v.size()) s << ' ' << v[i]; return s.str().substr(1); } template <typename T> ostream& operator<<(ostream& o, vector<T>& v) { if (v.size()) o << join(v); return o; } template <typename T> string join(vector<vector<T>>& vv) { string s = "\n"; rep(i, vv.size()) s += join(vv[i]) + "\n"; return s; } template <typename T> ostream& operator<<(ostream& o, vector<vector<T>>& vv) { if (vv.size()) o << join(vv); return o; } void OUT() { std::cout << "\n"; } template <class Head, class... Tail> void OUT(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUT(std::forward<Tail>(tail)...); } void OUTL() { std::cout << std::endl; } template <class Head, class... Tail> void OUTL(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUTL(std::forward<Tail>(tail)...); } void IN() {} template <class Head, class... Tail> void IN(Head&& head, Tail&&... tail) { cin >> head; IN(std::forward<Tail>(tail)...); } } // namespace io using namespace io; namespace useful { long long modpow(long long a, long long b, long long mod) { long long res = 1; while (b) { if (b & 1) res *= a, res %= mod; a *= a; a %= mod; b >>= 1; } return res; } bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; } template <class T> void rearrange(vector<T>& a, vector<int>& p) { vector<T> b = a; for (int i = 0; i < int(a.size()); i++) { a[i] = b[p[i]]; } return; } template <std::forward_iterator I> std::vector<std::pair<typename std::iterator_traits<I>::value_type, int>> run_length_encoding(I s, I t) { if (s == t) return {}; std::vector<std::pair<typename std::iterator_traits<I>::value_type, int>> res; res.emplace_back(*s, 1); for (auto it = ++s; it != t; it++) { if (*it == res.back().first) res.back().second++; else res.emplace_back(*it, 1); } return res; } vector<int> linear_sieve(int n) { vector<int> primes; vector<int> res(n + 1); iota(all(res), 0); for (int i = 2; i <= n; i++) { if (res[i] == i) primes.emplace_back(i); for (auto j : primes) { if (j * i > n) break; res[j * i] = j; } } return res; // return primes; } template <class T> vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) { int n = graph.size(); vector<long long> res(n, 2e18); res[start] = 0; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> que; que.push({0, start}); while (!que.empty()) { auto [c, v] = que.top(); que.pop(); if (res[v] < c) continue; for (auto [nxt, cost] : graph[v]) { auto x = c + cost; if (x < res[nxt]) { res[nxt] = x; que.push({x, nxt}); } } } return res; } } // namespace useful using namespace useful; template <class T, T l, T r> struct RandomIntGenerator { std::random_device seed; std::mt19937_64 engine; std::uniform_int_distribution<T> uid; RandomIntGenerator() { engine = std::mt19937_64(seed()); uid = std::uniform_int_distribution<T>(l, r); } T gen() { return uid(engine); } }; i64 op(i64 a, i64 b) { return max(a, b); } i64 e() { return 0; } i64 add(i64 a, i64 b) { return a + b; } i64 id() { return 0; } int main() { std::cout << fixed << setprecision(15); cin.tie(nullptr); ios::sync_with_stdio(false); int n; i64 a; IN(n, a); vector<i64> x(n), y(n), v(n); rep(i, n) IN(x[i], y[i], v[i]); rep(i, n) y[i] *= 2, x[i] *= 2; a *= 2; auto z = y; rep(i, n) { z.emplace_back(y[i] - 1); z.emplace_back(y[i] + 1); z.emplace_back(y[i] + a); z.emplace_back(y[i] + a + 1); z.emplace_back(y[i] + a - 1); z.emplace_back(y[i] - a); z.emplace_back(y[i] - a + 1); z.emplace_back(y[i] - a - 1); } UNIQUE(z); auto idx = [&](i64 i) { return lower_bound(all(z), i) - z.begin(); }; vector<int> p(n); iota(all(p), 0); sort(all(p), [&](int i, int j) { return x[i] < x[j]; }); rearrange(x, p); rearrange(y, p); rearrange(v, p); map<i64, vector<i64>> mp; rep(i, n) mp[x[i]].emplace_back(i); int r = 0; atcoder::lazy_segtree<i64, op, e, i64, add, add, id> seg(z.size() + 1); i64 ans = 0; rep(i, n) { if (!mp.contains(x[i] - 1)) mp[x[i] - 1] = {}; if (!mp.contains(x[i] + 1)) mp[x[i] + 1] = {}; if (!mp.contains(x[i] + a)) mp[x[i] + a] = {}; if (!mp.contains(x[i] - a)) mp[x[i] - a] = {}; if (!mp.contains(x[i] + a + 1)) mp[x[i] + a + 1] = {}; if (!mp.contains(x[i] + a - 1)) mp[x[i] + a - 1] = {}; if (!mp.contains(x[i] - a + 1)) mp[x[i] - a + 1] = {}; if (!mp.contains(x[i] - a - 1)) mp[x[i] - a - 1] = {}; } for (auto& [X, w] : mp) { while (r < n && x[r] <= X + a) { seg.apply(idx(y[r]), idx(y[r] + a + 1), v[r]); r++; } chmax(ans, seg.all_prod()); for (auto& i : w) { seg.apply(idx(y[i]), idx(y[i] + a + 1), -v[i]); } } OUT(ans); }