結果
| 問題 | No.1998 Manhattan Restaurant |
| ユーザー |
 xyz2606
|
| 提出日時 | 2022-07-01 22:40:38 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 111 ms / 2,000 ms |
| コード長 | 5,396 bytes |
| コンパイル時間 | 2,915 ms |
| コンパイル使用メモリ | 147,184 KB |
| 実行使用メモリ | 12,472 KB |
| 最終ジャッジ日時 | 2024-11-26 06:11:30 |
| 合計ジャッジ時間 | 4,664 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 31 |
ソースコード
#include<vector>#include<set>#include<map>#include<queue>#include<string>#include<algorithm>#include<iostream>#include<bitset>#include<functional>#include<chrono>#include<numeric>#include<cstdio>#include<cstring>#include<cstdlib>#include<cassert>#include<cmath>#include<iomanip>#include<random>#include<ctime>#include<complex>#include<type_traits>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;typedef long long LL;typedef double D;#define all(v) (v).begin(), (v).end()mt19937 gene(chrono::system_clock::now().time_since_epoch().count());typedef complex<double> Complex;#define fi first#define se second#define ins insert#define pb push_backinline char GET_CHAR(){const int maxn = 131072;static char buf[maxn],*p1=buf,*p2=buf;return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;}inline int getInt() {int res(0);char c = getchar();while(c < '0') c = getchar();while(c >= '0') {res = res * 10 + (c - '0');c = getchar();}return res;}inline LL fastpo(LL x, LL n, LL mod) {LL res(1);while(n) {if(n & 1) {res = res * (LL)x % mod;}x = x * (LL) x % mod;n /= 2;}return res;}template<LL mod> struct Num {LL a;Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }Num operator * (const Num & b) { return Num{a * b.a % mod}; }Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}void operator *= (const Num & b) { a = a * b.a % mod; }void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }void operator = (const Num & b) { a = b.a; }void operator = (const LL & b) { a = b; }};template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {os << a.a;return os;}LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }inline string itoa(LL x, int width = 0) {string res;if(x == 0) res.push_back('0');while(x) {res.push_back('0' + x % 10);x /= 10;}while((int)res.size() < width) res.push_back('0');reverse(res.begin(), res.end());return res;}const int _B = 131072;char buf[_B];int _bl = 0;inline void flush() {fwrite(buf, 1, _bl, stdout);_bl = 0;}__inline void _putchar(char c) {if(_bl == _B) flush();buf[_bl++] = c;}inline void print(LL x, char c) {static char tmp[20];int l = 0;if(!x) tmp[l++] = '0';else {while(x) {tmp[l++] = x % 10 + '0';x /= 10;}}for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);_putchar(c);}typedef double C;struct P {C x, y;void scan() {double _x, _y;scanf("%lf%lf", &_x, &_y);x = _x; y = _y;}void print() {cout << '(' << x << ' ' << y << ')' << endl;}P operator + (const P & b) const { return P{x + b.x, y + b.y}; }P operator - (const P & b) const { return P{x - b.x, y - b.y}; }C operator * (const P & b) const { return x * b.y - y * b.x; }C operator % (const P & b) const { return x * b.x + y * b.y; }};P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }const int N = 300033;const int LOG = 20;const int mod = 1e9 + 7;const int inf = 1e9 + 7;int n, m;int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};int rela[N];int getr(int x) {int p = x;while(rela[p] != p) p = rela[p];int p1 = p; p = x;while(rela[p] != p) {int p2 = rela[p];rela[p] = p1;p = p2;}return p1;}LL x[N], y[N], a[N], b[N];int main() {int n;scanf("%d", &n);for(int i = 1; i <= n; i++) {scanf("%lld%lld", &x[i], &y[i]);a[i] = x[i] + y[i];b[i] = x[i] - y[i];}LL le = 0, ri = (LL)inf * 2;while(le != ri) {LL mid = (le + ri) / 2;LL mna = (LL)inf * 4;for(int i = 1; i <= n; i++) {mna = min(mna, a[i]);}LL mnb = (LL)inf * 4, mxb = inf * -4ll;for(int i = 1; i <= n; i++) {if(a[i] <= mna + mid * 2) {mnb = min(mnb, b[i]);mxb = max(mxb, b[i]);}}//cout << mid << ' ' << mna << ' ' << mnb << endl;LL mna2 = inf * 4ll, mnb2 = inf * 4ll;for(int i = 1; i <= n; i++) {if(a[i] <= mna + mid * 2 && b[i] <= mnb + mid * 2) {}else {mna2 = min(mna2, a[i]);mnb2 = min(mnb2, b[i]);}}bool flag = true;for(int i = 1; i <= n; i++) {if(a[i] <= mna + mid * 2 && b[i] <= mnb + mid * 2) {}else if(a[i] >= mna2 && a[i] <= mna2 + mid * 2 && b[i] >= mnb2 && b[i] <= mnb2 + mid * 2) {}else {flag = false;}}LL mna3 = inf * 4ll, mnb3 = inf * 4ll;for(int i = 1; i <= n; i++) {if(a[i] <= mna + mid * 2 && b[i] >= mxb - mid * 2) {}else {mna3 = min(mna3, a[i]);mnb3 = min(mnb3, b[i]);}}bool f1 = true;for(int i = 1; i <= n; i++) {if(a[i] <= mna + mid * 2 && b[i] >= mxb - mid * 2) {}else if(a[i] >= mna3 && a[i] <= mna3 + mid * 2 && b[i] >= mnb3 && b[i] <= mnb3 + mid * 2) {}else {f1 = false;}}if(flag == false && f1 == false) {le = mid + 1;}else ri = mid;}cout << le << endl;}