結果

問題 No.2354 Poor Sight in Winter
ユーザー deuteridayo
提出日時 2023-06-16 23:14:40
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 362 ms / 2,000 ms
コード長 3,950 bytes
コンパイル時間 4,251 ms
コンパイル使用メモリ 262,476 KB
最終ジャッジ日時 2025-02-14 21:32:54
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
// using mint = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower 
    = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + 
    ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] 
    <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = 
    false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p
    ;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()
struct edge{
    int to;
};
using graph = vector<vector<edge>>;
int main(){
    lint n,k;
    cin >> n >> k;
    lint sx,sy,gx,gy;
    cin >> sx >> sy >> gx >> gy;
    lint Sx = (sx + sy);
    lint Sy = (sx - sy);
    lint Gx = (gx + gy);
    lint Gy = (gx - gy);
    lint x[n+2], y[n+2];
    lint X[n+2], Y[n+2];
    rep(i, n) {
        cin >> x[i] >> y[i];
        X[i] = x[i] + y[i];
        Y[i] = x[i] - y[i];
    }
    X[n] = Sx; X[n+1] = Gx;
    Y[n] = Sy; Y[n+1] = Gy;
    x[n] = sx, y[n] = sy;
    x[n+1] = gx, y[n+1] = gy;
    lint upper = INF64;
    lint lower = 1;
    while(upper > lower) {
        lint P = (upper + lower ) / 2;
        vec<vec<lint>>dist(n+2, vec<lint>(n+2, INF64));
        rep(i, n+2) dist[i][i] = 0;
        rep(i, n+2) {
            rep(j, n+2) {
                dist[i][j] = (abs(x[i] - x[j]) + abs(y[i] - y[j]) - 1) / P;
            }
        }
        vec<lint>dd(n+2, INF64);
        dd[n] = 0;
        priority_queue<vec<lint>>que;
        que.push({0, n});
        while(!que.empty()) {
            auto q = que.top();
            que.pop();
            lint d = -q[0];
            lint v = q[1];
            rep(i, n+2) {
                if(i == v)continue;
                if(dd[i] > dd[v] + dist[i][v]) {
                    dd[i] = dd[v] + dist[i][v];
                    que.push({-dd[i], i});
                }
            }
        }
        // cout << "=========== " << P << " =========" << endl; 
        // rep(i, n+2) {
        //     rep(j, n+2) cout << dist[i][j] << " ";
        //     cout << endl;
        // }
        if(dd[n+1] <= k) {
            upper = P;
        } else {
            lower = P +1;
        }
        
    }
    cout << upper << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0