結果

問題 No.2354 Poor Sight in Winter
ユーザー erbowl
提出日時 2023-06-19 00:46:55
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 122 ms / 2,000 ms
コード長 3,116 bytes
コンパイル時間 2,098 ms
コンパイル使用メモリ 209,472 KB
最終ジャッジ日時 2025-02-14 22:49:36
ジャッジサーバーID
（参考情報） 		judge7 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
#define int long long
ll isqrt(ll N){
   ll sqrtN=sqrt(N)-1;
   while(sqrtN+1<=N/(sqrtN+1))sqrtN++;
   return sqrtN;
}
// Union-Find
struct UnionFind {
    // core member
    vector<int> par;
    // constructor
    UnionFind() { }
    UnionFind(int n) : par(n, -1) { }
    void init(int n) { par.assign(n, -1); }
    
    // core methods
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
    
    // debug
    friend ostream& operator << (ostream &s, UnionFind uf) {
        map<int, vector<int>> groups;
        for (int i = 0; i < uf.par.size(); ++i) {
            int r = uf.root(i);
            groups[r].push_back(i);
        }
        for (const auto &it : groups) {
            s << "group: ";
            for (auto v : it.second) s << v << " ";
            s << endl;
        }
        return s;
    }
};
signed main(){
    ll n,k;
    std::cin >> n>>k;
    pair<ll,ll> s,g;
    std::cin >> s.first>>s.second>>g.first>>g.second;
    vector<ll> x(n),y(n);
    for (int i = 0; i < n; i++) {
        std::cin >> x[i]>>y[i];
    }
    
    ll r = 2*1e7;
    ll l = 0;
    while(r-l>1){
        ll m =(r+l)/2;
        vector<ll> dd(n+2,1e10);
        dd[n]=0;
        using P = pair<ll,ll>;
        priority_queue<P,vector<P>,greater<P>> pq;
        pq.push({0, n});
        vector<vector<ll>> dis(n+2,vector<ll>(n+2));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                dis[i][j] = (abs(x[i]-x[j])+abs(y[i]-y[j])+m-1)/m-1;
            }
        }
        for (int i = 0; i < n; i++) {
            dis[n][i] = dis[i][n] =  (abs(x[i]-s.first)+abs(y[i]-s.second)+m-1)/m-1;
            dis[n+1][i] = dis[i][n+1] =  (abs(x[i]-g.first)+abs(y[i]-g.second)+m-1)/m-1;
        }
        for (int i = 0; i < n+2; i++) {
            dis[i][i] = 0;
        }
        dis[n][n+1]=dis[n+1][n] = (abs(s.first-g.first)+abs(s.second-g.second)+m-1)/m-1;
        while(!pq.empty()){
            auto [dist, pos] = pq.top();pq.pop();
            // std::cout << dist<<" "<<pos << std::endl;
            if(dist>dd[pos])continue;
            
            for (int i = 0; i < n+2; i++) {
                if(i==pos)continue;
                // std::cout << i<<" "<<dd[i] << std::endl;
                if(dd[i]>dist+dis[pos][i]){
                    dd[i] = dist+dis[pos][i];
                    // std::cout << l<<" "<<r<<" "<<dd[i] << std::endl;
                    pq.push({dd[i], i});
                }
            }
        }
        if(dd[n+1]<=k){
            r = m;
        }else{
            l = m;
        }
    }
    std::cout << r << std::endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0