結果
| 問題 |
No.3292 World Map Distance
|
| ユーザー |
 dyktr_06
|
| 提出日時 | 2025-10-03 22:44:36 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,119 bytes |
| コンパイル時間 | 2,605 ms |
| コンパイル使用メモリ | 216,552 KB |
| 実行使用メモリ | 35,084 KB |
| 最終ジャッジ日時 | 2025-10-03 22:44:54 |
| 合計ジャッジ時間 | 15,691 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 32 WA * 2 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
using i64 = int64_t;
using i128 = __int128_t;
using ll = long long;
using ul = unsigned long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<long long>;
using vull = vector<unsigned long long>;
using vc = vector<char>;
using vst = vector<string>;
using vd = vector<double>;
using vld = vector<long double>;
using P = pair<long long, long long>;
template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } 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() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U>
void inGraph(vector<vector<T>> &G, U n, U m, bool directed = true, bool zero_index = true){
G.resize(n);
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
if(!zero_index) a--, b--;
G[a].push_back(b);
if(!directed) G[b].push_back(a);
}
}
template <typename T>
long long binary_search(long long ok, long long ng, T check){
while(abs(ok - ng) > 1){
long long mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
for(int i = 0; i < iter; ++i){
long double mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
long long trisum(long long a, long long b){
if(a > b) return 0;
long long res = ((b - a + 1) * (a + b)) / 2;
return res;
}
template <typename T>
T intpow(T x, int n){
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
template <typename T>
T getDivision(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a / b;
} else if(a < 0 && b > 0){
return a / b - (a % b != 0);
} else if(a >= 0 && b < 0){
return a / b;
} else{
return a / b + (a % b != 0);
}
}
template <typename T>
T getReminder(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a % b;
} else if(a < 0 && b > 0){
return ((a % b) + b) % b;
} else if(a >= 0 && b < 0){
return a % b;
} else{
return (abs(b) - abs(a % b)) % b;
}
}
template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
void fout(){ cout << endl; }
template<class T, class... Ts> void fout(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << endl; }
void debug(){ cerr << '\n'; }
template<class T, class... Ts> void debug(const T &a, const Ts&... b){ cerr << a; (cerr << ... << (cerr << ' ', b)); cerr << '\n'; }
template <typename T>
struct BinaryIndexedTree{
int N;
std::vector<T> BIT;
BinaryIndexedTree(const int N) : N(N), BIT(N + 1, 0){
}
T get(int i){
return sum(i + 1) - sum(i);
}
void add(int i, T x){
i++;
while(i <= N){
BIT[i] += x;
i += i & -i;
}
}
T sum(int i) const {
T ans = 0;
while(i > 0){
ans += BIT[i];
i -= i & -i;
}
return ans;
}
T sum(int L, int R) const {
return sum(R) - sum(L);
}
int lower_bound(T x) const {
if(x <= 0){
return 0;
} else{
int v = 0, r = 1;
while(r < N) r = r << 1;
for(int len = r; len > 0; len = len >> 1){
if(v + len < N && BIT[v + len] < x){
x -= BIT[v + len];
v += len;
}
}
return v;
}
}
int upper_bound(T x) const {
if(x < 0){
return 0;
} else{
int v = 0, r = 1;
while(r <= N) r = r << 1;
for(int len = r; len > 0; len = len >> 1){
if(v + len <= N && BIT[v + len] <= x){
x -= BIT[v + len];
v += len;
}
}
return v;
}
}
T operator [](int i) const {
return sum(i, i + 1);
}
};
template <typename T>
struct compress{
std::vector<T> sorted;
std::vector<int> compressed;
compress(const std::vector<T> &vec){
int n = vec.size();
compressed.resize(n);
for(T x : vec){
sorted.emplace_back(x);
}
std::sort(sorted.begin(), sorted.end());
sorted.erase(std::unique(sorted.begin(), sorted.end()), sorted.end());
for(int i = 0; i < n; ++i){
compressed[i] = std::lower_bound(sorted.begin(), sorted.end(), vec[i]) - sorted.begin();
}
}
int get(const T &x) const{
return std::lower_bound(sorted.begin(), sorted.end(), x) - sorted.begin();
}
int getr(const T &x) const{
return std::upper_bound(sorted.begin(), sorted.end(), x) - sorted.begin();
}
T inv(const int x) const{
return sorted[x];
}
size_t size() const{
return sorted.size();
}
std::vector<int> getCompressed() const{
return compressed;
}
};
ll T;
void input(){
in(T);
}
void solve(){
ll n, h, w; in(n, h, w);
vll x(n), y(n);
vll xv, yv;
rep(i, n){
in(x[i], y[i]);
x[i]--, y[i]--;
xv.push_back(x[i]);
xv.push_back(x[i] + h);
yv.push_back(y[i]);
yv.push_back(y[i] + w);
}
compress<ll> cx(xv), cy(yv);
ll lenx = cx.size(), leny = cy.size();
BinaryIndexedTree<ll> cntx(lenx), cnty(leny), valx(lenx), valy(leny);
rep(i, n){
cntx.add(cx.get(x[i]), 1);
cntx.add(cx.get(x[i] + h), 1);
valx.add(cx.get(x[i]), x[i]);
valx.add(cx.get(x[i] + h), x[i] + h);
cnty.add(cy.get(y[i]), 1);
cnty.add(cy.get(y[i] + w), 1);
valy.add(cy.get(y[i]), y[i]);
valy.add(cy.get(y[i] + w), y[i] + w);
}
ll resx = 0, resy = 0;
auto fx = [&](ll x1){
ll res = cntx.sum(cx.get(x1 - h / 2), cx.get(x1)) * x1;
res -= valx.sum(cx.get(x1 - h / 2), cx.get(x1));
res += valx.sum(cx.get(x1), cx.get(x1 + (h + 1) / 2));
res -= cntx.sum(cx.get(x1), cx.get(x1 + (h + 1) / 2)) * x1;
return res;
};
auto fy = [&](ll y1){
ll res = cnty.sum(cy.get(y1 - w / 2), cy.get(y1)) * y1;
res -= valy.sum(cy.get(y1 - w / 2), cy.get(y1));
res += valy.sum(cy.get(y1), cy.get(y1 + (w + 1) / 2));
res -= cnty.sum(cy.get(y1), cy.get(y1 + (w + 1) / 2)) * y1;
return res;
};
rep(i, n){
chmax(resx, fx(x[i] + h / 2));
chmax(resy, fy(y[i] + w / 2));
}
out(resx + resy);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
T = 1;
// input();
while(T--) solve();
}