#831303 (C++14) No.2179 Planet Traveler

提出ソース

結果

問題	No.2179 Planet Traveler
ユーザー	woodywoody
提出日時	2023-01-07 02:46:17
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	219 ms / 3,000 ms
コード長	5,056 bytes
コンパイル時間	3,656 ms
コンパイル使用メモリ	233,820 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-05-08 02:08:11
合計ジャッジ時間	7,251 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	1 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	78 ms 6,940 KB
testcase_12	AC	214 ms 6,944 KB
testcase_13	AC	209 ms 6,944 KB
testcase_14	AC	57 ms 6,944 KB
testcase_15	AC	57 ms 6,944 KB
testcase_16	AC	59 ms 6,944 KB
testcase_17	AC	219 ms 6,940 KB
testcase_18	AC	218 ms 6,940 KB
testcase_19	AC	208 ms 6,940 KB
testcase_20	AC	29 ms 6,940 KB
testcase_21	AC	205 ms 6,944 KB
testcase_22	AC	136 ms 6,944 KB
testcase_23	AC	104 ms 6,944 KB
testcase_24	AC	167 ms 6,940 KB
testcase_25	AC	131 ms 6,940 KB
testcase_26	AC	188 ms 6,944 KB
testcase_27	AC	30 ms 6,940 KB
testcase_28	AC	90 ms 6,940 KB
testcase_29	AC	182 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    int n; cin>>n;
    vl x(n),y(n),t(n);
    rep(i,n) cin>>x[i]>>y[i]>>t[i];

    auto eu = [&](int i)->ll{
        ll ret = x[i]*x[i] + y[i]*y[i];
        return ret;
    };
    auto eu2 = [&](int i,int j)->ll{
        ll ret = (x[i] -x[j])*(x[i]-x[j]);
        ret += (y[i] -y[j])*(y[i]-y[j]);
        return ret;
    };

    if (eu(0) == eu(n-1) && t[0] != t[n-1]){
        cout << 0 << endl;
        return;
    }

    auto check = [&](ll mid)->bool{
        dsu d(n);
        rep(i,n) rep(j,n){
            if (i == j) continue;
            if (t[i] == t[j]){
                ll tt = eu2(i,j);
                if (tt <= mid) d.merge(i,j);
            }else{
                ld ti = sqrtl(eu(i));
                ld tj = sqrtl(eu(j));
                ld diff = abs(ti-tj) - sqrtl(mid);
                if (diff < eps) d.merge(i,j);
            }
        }
        return d.same(0,n-1);
    };

    ll l = 0,u = 1e10;
    while(u-l > 1){
        ll mid = (l+u) / 2;
        if (check(mid)) u = mid;
        else l = mid;
    }

    cout << u << endl;



    return;
}

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

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード