#584788 (C++17) No.1265 Balloon Survival

• 問題: No.1265 Balloon Survival
• ユーザー: chocopuu
• 提出日時: 2020-11-27 19:38:29
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: TLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 2,181 bytes
• コンパイル時間: 2,318 ms
• コンパイル使用メモリ: 205,348 KB
• 最終ジャッジ日時: 2025-01-16 06:13:43
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 22 TLE * 10

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include "bits/stdc++.h"
using namespace std;
//#include "atcoder/all"
//using namespace atcoder;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;
signed main(){
    int N;
    cin >> N;
    int ans = 0;
    set<tuple<int, int, int>>st;
    vector<int> x(N), y(N);
    REP(i, N) cin >> x[i] >> y[i];
    auto cost = [&](int i, int j) -> int {
        return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
    };
    REP(i, N) {
        REP(j, N) {
            if(i == j) continue;
            st.insert({cost(i, j), i, j});
        }
    }
    int n = N;
    while(n > 1) {
        int dist, a, b;
        tie(dist, a, b) = *st.begin();
        st.erase(st.begin());
        if(a > b) swap(a, b); // a < b
        if(a == 0) {
            REP(i, N) {
                if(b == i) continue;
                auto itr = st.find({cost(b, i), b, i});
                if(itr != st.end()) st.erase(itr);
            }REP(i, N) {
                if(b == i) continue;
                auto itr = st.find({cost(b, i), i, b});
                if(itr != st.end()) st.erase(itr);
            }
            ++ans;
            --n;
        } else {
            REP(i, N) {
                if(a == i) continue;
                auto itr = st.find({cost(a, i), i, a});
                if(itr != st.end()) st.erase(itr);
            }
            REP(i, N) {
                if(a == i) continue;
                auto itr = st.find({cost(a, i), a, i});
                if(itr != st.end()) st.erase(itr);
            }
            --n;
            REP(i, N) {
                if(b == i) continue;
                auto itr = st.find({cost(b, i), i, b});
                if(itr != st.end()) st.erase(itr);
            }
            REP(i, N) {
                if(b == i) continue;
                auto itr = st.find({cost(b, i), b, i});
                if(itr != st.end()) st.erase(itr);
            }
            --n;
        }
    }
    out(ans);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX