結果

問題 No.1265 Balloon Survival
コンテスト
ユーザー kei
提出日時 2020-10-23 22:21:57
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,963 bytes
コンパイル時間 2,237 ms
コンパイル使用メモリ 187,088 KB
実行使用メモリ 19,496 KB
最終ジャッジ日時 2024-07-21 11:00:18
合計ジャッジ時間 4,147 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 31 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

template<class Type>
Type solve(Type res = Type()){
    int N; cin >> N;
    vector<ll> x(N),y(N);
    for(int i = 0; i < N;i++){
        cin >> x[i] >> y[i];
    }
    vector<vector<double>> broken_time(N,vector<double>(N));

    for(int i = 0; i < N;i++){
        for(int j = 0; j < N;j++){
            if(i == j) broken_time[i][j] = LINF;
            broken_time[i][j] = sqrt((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]));
        }
    }
    using Item = tuple<double,int,int>;

    vector<Item> priority;
    for(int i = 0; i < N;i++){
        for(int j = i+1; j < N;j++){
            priority.emplace_back(broken_time[i][j],i,j);
        }
    }
    sort(priority.rbegin(),priority.rend());
    vector<int> broken(N);

    while(priority.size()){
        int l,r; tie(ignore,l,r) = priority.back();
        priority.pop_back();

        if(broken[l] || broken[r]) continue;
        if(l == 0){
            broken[r] = 1;
            res++;
        }else{
            broken[l] = broken[r] = 1;
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    //solve<ll>(0);
    cout << fixed << setprecision(12) << solve<ll>() << endl;
    return 0;
}
0