結果
| 問題 |
No.3292 World Map Distance
|
| コンテスト | |
| ユーザー |
 siganai
|
| 提出日時 | 2025-10-05 16:07:22 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,121 ms / 3,000 ms |
| コード長 | 8,197 bytes |
| コンパイル時間 | 2,080 ms |
| コンパイル使用メモリ | 215,304 KB |
| 実行使用メモリ | 116,008 KB |
| 最終ジャッジ日時 | 2025-10-05 16:07:39 |
| 合計ジャッジ時間 | 15,416 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 34 |
ソースコード
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + (((b)-(a)-1) / (c) - (((b)-(a)-1) % (c) && (((b)-(a)-1) ^ c) < 0)) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
template<typename T>
struct imos_linearfunction {
int N;
vector<T> imos1,imos2;
imos_linearfunction() = default;
imos_linearfunction(int n) {
N = n;
imos1.resize(N + 1);
imos2.resize(N + 1);
}
//[L,R)に(b,a+b,2a+b,...)を加算する
void add(int L,int R,T a,T b) {
imos1[L] += b - a * L;
imos1[R] -= b - a * L;
imos2[L] += a;
imos2[R] -= a;
};
//buildの後はaddしない
void build() {
for(int i = 0;i < N;i++) {
imos1[i+1] += imos1[i];
imos2[i+1] += imos2[i];
}
};
T get(int x) {
return imos1[x] + imos2[x] * x;
};
};
void solve() {
INT(n,X,Y);
vl x(n),y(n);
rep(i,n) {
cin >> x[i] >> y[i];
x[i]--,y[i]--;
}
vl xlist;
rep(i,n) {
xlist.emplace_back(x[i] + X / 2 - X);
xlist.emplace_back(x[i] + (X + 1) / 2 - X);
xlist.emplace_back(x[i] + X + X / 2);
xlist.emplace_back(x[i] + X + (X + 1) / 2);
xlist.emplace_back(x[i] + X / 2);
xlist.emplace_back(x[i] + (X + 1) / 2);
xlist.emplace_back(x[i] + X + X / 2);
xlist.emplace_back(x[i] + X + (X + 1) / 2);
}
sort(all(xlist));
xlist.erase(unique(all(xlist)),xlist.end());
vl imosx1(xlist.size() + 1),imosx2(xlist.size() + 1);
rep(i,n) {
int id1 = lower_bound(all(xlist),x[i]) - xlist.begin();
int id2 = upper_bound(all(xlist),x[i] + X / 2) - xlist.begin();
imosx1[id1] += -x[i];
imosx2[id1] += 1;
imosx1[id2] -= -x[i];
imosx2[id2] -= 1;
int id3 = lower_bound(all(xlist),x[i] + X / 2 + 1) - xlist.begin();
int id4 = lower_bound(all(xlist),x[i] + X) - xlist.begin();
imosx1[id3] += (X - 1) / 2 + x[i] + X / 2 + 1;
imosx2[id3] += -1;
imosx1[id4] -= (X - 1) / 2 + x[i] + X / 2 + 1;
imosx2[id4] -= -1;
}
rep(i,xlist.size()) {
imosx1[i+1] += imosx1[i];
imosx2[i+1] += imosx2[i];
}
map<int,ll> mpx;
rep(i,xlist.size()) {
mpx[(xlist[i] + X) % X] += imosx1[i] + imosx2[i] * xlist[i];
}
ll ma1 = 0;
for(auto &[_,val]:mpx) chmax(ma1,val);
debug(mpx);
vl ylist;
rep(i,n) {
ylist.emplace_back(y[i] + Y / 2 - Y);
ylist.emplace_back(y[i] + (Y + 1) / 2 - Y);
ylist.emplace_back(y[i] + Y / 2);
ylist.emplace_back(y[i] + (Y + 1) / 2);
ylist.emplace_back(y[i] + Y + Y / 2);
ylist.emplace_back(y[i] + Y + (Y + 1) / 2);
}
sort(all(ylist));
ylist.erase(unique(all(ylist)),ylist.end());
vl imosy1(ylist.size() + 1),imosy2(ylist.size() + 1);
rep(i,n) {
int id1 = lower_bound(all(ylist),y[i]) - ylist.begin();
int id2 = upper_bound(all(ylist),y[i] + Y / 2) - ylist.begin();
imosy1[id1] += -y[i];
imosy2[id1] += 1;
imosy1[id2] -= -y[i];
imosy2[id2] -= 1;
int id3 = lower_bound(all(ylist),y[i] + Y / 2 + 1) - ylist.begin();
int id4 = lower_bound(all(ylist),y[i] + Y) - ylist.begin();
imosy1[id3] += (Y - 1) / 2 + y[i] + Y / 2 + 1;
imosy2[id3] += -1;
imosy1[id4] -= (Y - 1) / 2 + y[i] + Y / 2 + 1;
imosy2[id4] -= -1;
}
rep(i,ylist.size()) {
imosy1[i+1] += imosy1[i];
imosy2[i+1] += imosy2[i];
}
map<int,ll> mpy;
rep(i,ylist.size()) {
mpy[(ylist[i] + Y) % Y] += imosy1[i] + imosy2[i] * ylist[i];
}
ll ma2 = 0;
for(auto &[_,val]:mpy) chmax(ma2,val);
cout << ma1 + ma2 << '\n';
}
int main() {
//INT(TT);
int TT = 1;
rep(i,TT) solve();
}