結果

問題 No.1265 Balloon Survival
ユーザー evima
提出日時 2021-02-18 06:29:30
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 408 ms / 2,000 ms
コード長 2,845 bytes
コンパイル時間 1,836 ms
コンパイル使用メモリ 198,532 KB
最終ジャッジ日時 2025-01-18 22:04:21
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void solveOne()’:
main.cpp:65:9: warning: ‘a’ may be used uninitialized [-Wmaybe-uninitialized]
   65 |         if(a == 0){
      |         ^~
main.cpp:53:26: note: ‘a’ was declared here
   53 |         ll mind2 = 3e18, a, b;
      |                          ^
main.cpp:67:20: warning: ‘b’ may be used uninitialized [-Wmaybe-uninitialized]
   67 |             alive[b] = 0;
      |                    ^
main.cpp:53:29: note: ‘b’ was declared here
   53 |         ll mind2 = 3e18, a, b;
      |                             ^

ソースコード

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

// Enjoy your stay. Code by evima
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using vl = vector<ll>;
using LOOPVAR_TYPE = ll;
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define sz(x) ll((x).size())
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep1(i, n) rep2(i, 0, n)
#define rep2(i, a, b) for(LOOPVAR_TYPE i = LOOPVAR_TYPE(a); i < LOOPVAR_TYPE(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
template<class T> bool chmin(T& a, const T& b) { return (b < a) ? (a = b, true) : false; }
template<class T> bool chmax(T& a, const T& b) { return (a < b) ? (a = b, true) : false; }
#define eb emplace_back
#define fir first
#define sec second
const ld EPS = 1e-9;
const ld PI = 3.14159265358979323846L;
const ll INF = 1070000000LL;
const ll MOD = 998244353LL;// 1000000007LL;
void fast_io() { cin.tie(NULL); ios_base::sync_with_stdio(false); }
ll ll_input() { ll x; cin >> x; return x; }
string input() { string s; cin >> s; return s; }
vl vl_input(int n) { vector<ll> v(n); rep(i, n) cin >> v[i]; return v; }
template<class T> vector<T> sorted(vector<T> v) { sort(all(v)); return v; }
template<class T> vector<T> sub(const vector<T>& v, int from, int to) { vector<T> ret; copy(&v[from], &v[to], back_inserter(ret)); return ret; }
template<class T> string str(const T& x) { stringstream ss; ss << x; return ss.str(); }
template<class T> string str(const vector<T>& v) { stringstream ss; rep(i, sz(v)) ss << v[i] << (i < sz(v) - 1 ? " " : ""); return ss.str(); }
template<class T> void print1(T&& x, const string& end) { cout << str(x) << end; }
void print() { print1("", "\n"); }
template<class T, class... U> void print(T&& head, U&&... tail) { print1(head, " "); print(forward<U>(tail)...); }
template<class... T> void quit(T&&... x) { print(forward<T>(x)...); exit(0); }
ll N, x[1010], y[1010], d2[1010][1010];
void solveOne(){
    cin >> N;
    rep(i, N) cin >> x[i] >> y[i];
    rep(i, N) rep(j, N) d2[i][j] = sq(x[i] - x[j]) + sq(y[i] - y[j]);
    vl alive(N, 1);
    int num = N, ans = 0;
    while(num > 1){
        ll mind2 = 3e18, a, b;
        rep(i, N){
            if(alive[i]){
                rep(j, i + 1, N){
                    if(alive[j]){
                        if(chmin(mind2, d2[i][j])){
                            a = i, b = j;
                        }
                    }
                }
            }
        }
        if(a == 0){
            ++ans;
            alive[b] = 0;
            num -= 1;
        }else{
            alive[a] = alive[b] = 0;
            num -= 2;
        }
    }
    print(ans);
}
int main(){
    fast_io();
    
    int num_tc = 1;
    // cin >> num_tc;
    
    
    
    rep(tc, 1, num_tc + 1){
        // cout << "Case #" << tc << ": " ;// << endl;
        solveOne();
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0