提出 #68542475

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n-1; i >=0; i--)
#define repsg(i, s, g) for (int i = s; i < (int)(g); i++)
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using mint = modint1000000007;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int N; cin >> N;
  vector<ll> R(N), C(N);
  rep(i, N) cin >> R[i] >> C[i];

  ll maxR = *max_element(R.begin(), R.end());
  ll minR = *min_element(R.begin(), R.end());
  ll maxC = *max_element(C.begin(), C.end());
  ll minC = *min_element(C.begin(), C.end());
  
  cout << max((maxR-minR+1)/2, (maxC-minC+1)/2) << endl;

  return 0;
}

提出情報

ジャッジ結果