結果
問題 |
No.3292 World Map Distance
|
ユーザー |
![]() |
提出日時 | 2025-10-03 22:47:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,313 ms / 3,000 ms |
コード長 | 5,428 bytes |
コンパイル時間 | 3,681 ms |
コンパイル使用メモリ | 190,324 KB |
実行使用メモリ | 81,152 KB |
最終ジャッジ日時 | 2025-10-03 22:47:40 |
合計ジャッジ時間 | 18,424 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector<mint> &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector<vector<mint>> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } int main() { ll N, X, Y; cin >> N >> X >> Y; vector<ll> x(N); vector<ll> y(N); for (ll i = 0; i < N; i++){ cin >> x[i] >> y[i]; x[i]--; y[i]--; } // x, y 独立 // 増減の転換点が合計して O(N) 個になる map<ll, ll> mpx; map<ll, ll> mpy; for (ll i = 0; i < N; i++){ if (X % 2 == 0){ mpx[x[i]] += 2; mpx[(x[i] + X / 2) % X] -= 2; } else{ mpx[x[i]] += 2; mpx[(x[i] + X / 2) % X]--; mpx[(x[i] + X / 2 + 1) % X]--; } } for (ll i = 0; i < N; i++){ if (Y % 2 == 0){ mpy[y[i]] += 2; mpy[(y[i] + Y / 2) % Y] -= 2; } else{ mpy[y[i]] += 2; mpy[(y[i] + Y / 2) % Y]--; mpy[(y[i] + Y / 2 + 1) % Y]--; } } ll max_x = 0; ll max_y = 0; ll now_x = 0; ll now_y = 0; ll inc_x = 0; ll inc_y = 0; for (ll i = 0; i < N; i++){ now_x += min(x[i], (X - x[i])); now_y += min(y[i], (Y - y[i])); if (X % 2 == 0){ if (x[i] != 0 && x[i] <= X / 2){ inc_x--; } else{ inc_x++; } } else{ if (x[i] != 0 && x[i] < X / 2 + 1){ inc_x--; } else if (x[i] > X / 2 + 1 || x[i] == 0){ inc_x++; } } if (Y % 2 == 0){ if (y[i] != 0 && y[i] <= Y / 2){ inc_y--; } else{ inc_y++; } } else{ if (y[i] != 0 && y[i] < Y / 2 + 1){ inc_y--; } else if (y[i] > Y / 2 + 1 || y[i] == 0){ inc_y++; } } } // debug_out(inc_x, inc_y, now_x, now_y); max_x = max(max_x, now_x); max_y = max(max_y, now_y); ll prev_x = 0; for (auto it = mpx.begin(); it != mpx.end(); it++){ if (it->first == 0){ continue; } now_x += inc_x * (it->first - prev_x); inc_x += it->second; max_x = max(max_x, now_x); prev_x = it->first; } ll prev_y = 0; for (auto it = mpy.begin(); it != mpy.end(); it++){ if (it->first == 0){ continue; } now_y += inc_y * (it->first - prev_y); inc_y += it->second; max_y = max(max_y, now_y); prev_y = it->first; } cout << max_x + max_y << endl; }