結果
問題 |
No.3292 World Map Distance
|
ユーザー |
|
提出日時 | 2025-09-16 23:43:24 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,968 ms / 3,000 ms |
コード長 | 2,996 bytes |
コンパイル時間 | 1,970 ms |
コンパイル使用メモリ | 172,248 KB |
実行使用メモリ | 73,476 KB |
最終ジャッジ日時 | 2025-09-24 01:45:46 |
合計ジャッジ時間 | 24,387 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> #include <ranges> using namespace std; using ll = long long; template<typename T> auto range(T s, T e) { return views::iota(s, max(s, e)); } template<typename T> auto range(T n) { return range<T>(0, n); } template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } template<class... Args> void sout(const Args &...args) { ((cout << args << ' '), ...); } template<class... Args> void soutn(const Args &...args) { ((cout << args << ' '), ...); cout << '\n'; } template<typename T1, typename T2> struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template<typename T1, typename T2, typename T3> struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; template<typename T1, typename T2, typename T3, typename T4> struct In4 { T1 a; T2 b; T3 c; T4 d; friend std::istream& operator>>(std::istream& is, In4& obj) { T1 t1; T2 t2; T3 t3; T4 t4; is >> t1 >> t2 >> t3 >> t4; obj = {t1, t2, t3, t4}; return is; } }; #ifdef LOCAL #include <debug.h> #else #define dump(...) ; #endif namespace { ll n, w, h; vector<In2<ll, ll>> va; void read() { cin >> n >> w >> h; take(va, n); } ll sol(ll t, vector<ll> vx) { if (t == 1) return 0; map<ll, ll> slope; auto eval = [&](ll p) -> ll { ll tot = 0; for (ll x : vx) { ll d = abs(x - p); tot += min(d, t - d); } return tot; }; ll val0 = eval(0); ll val1 = eval(1); for (ll x : vx) { slope[x] += 2; ll half = t / 2; if (t % 2) { slope[x - half - 1]--; slope[x - half]--; slope[x + half]--; slope[x + half + 1]--; } else { slope[x - half] -= 2; slope[x + half] -= 2; } } dump(t, vx); dump(slope); ll val = val0, s = val1 - val0, x0 = 0; ll res = val; for (auto [x, sdiff] : slope) { if (x <= 0) continue; if (x >= t) break; val += (x - x0) * s; res = max(res, val); s += sdiff; x0 = x; dump(x, "=>", val, "slope=", s); } return res; } ll run() { vector<ll> vx, vy; for (auto [x, y] : va) { vx.push_back(x - 1); vy.push_back(y - 1); } ll res = sol(w, vx); res += sol(h, vy); return res; } } // namespace template <typename F> void exec(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { read(); } exec(run); }