結果

問題 No.202 1円玉投げ
ユーザー haruki_Kharuki_K
提出日時 2020-02-08 19:04:41
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 74 ms / 5,000 ms
コード長 4,319 bytes
コンパイル時間 1,742 ms
コンパイル使用メモリ 177,560 KB
実行使用メモリ 31,616 KB
最終ジャッジ日時 2024-06-01 21:31:40
合計ジャッジ時間 4,819 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
31,488 KB
testcase_01 AC 69 ms
31,616 KB
testcase_02 AC 25 ms
26,880 KB
testcase_03 AC 24 ms
27,008 KB
testcase_04 AC 24 ms
26,880 KB
testcase_05 AC 28 ms
27,392 KB
testcase_06 AC 66 ms
30,464 KB
testcase_07 AC 70 ms
30,848 KB
testcase_08 AC 71 ms
30,976 KB
testcase_09 AC 49 ms
29,184 KB
testcase_10 AC 35 ms
27,904 KB
testcase_11 AC 45 ms
28,928 KB
testcase_12 AC 45 ms
28,800 KB
testcase_13 AC 36 ms
28,032 KB
testcase_14 AC 29 ms
27,392 KB
testcase_15 AC 47 ms
29,056 KB
testcase_16 AC 52 ms
31,616 KB
testcase_17 AC 54 ms
31,488 KB
testcase_18 AC 53 ms
31,616 KB
testcase_19 AC 47 ms
28,928 KB
testcase_20 AC 61 ms
30,208 KB
testcase_21 AC 45 ms
28,928 KB
testcase_22 AC 26 ms
27,008 KB
testcase_23 AC 25 ms
27,008 KB
testcase_24 AC 25 ms
26,880 KB
testcase_25 AC 25 ms
26,880 KB
testcase_26 AC 25 ms
26,880 KB
testcase_27 AC 25 ms
27,008 KB
testcase_28 AC 26 ms
27,008 KB
testcase_29 AC 25 ms
26,880 KB
testcase_30 AC 24 ms
26,880 KB
testcase_31 AC 25 ms
27,008 KB
testcase_32 AC 26 ms
27,136 KB
testcase_33 AC 25 ms
26,880 KB
testcase_34 AC 25 ms
27,008 KB
testcase_35 AC 53 ms
31,488 KB
testcase_36 AC 57 ms
31,616 KB
testcase_37 AC 74 ms
31,232 KB
testcase_38 AC 53 ms
31,616 KB
testcase_39 AC 25 ms
26,880 KB
testcase_40 AC 25 ms
27,008 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> x(n),y(n);
    rep (i,n) cin >> x[i] >> y[i];

    const int B = 20, MAX = 20000, NN = MAX/B + 5;
    auto v = make_v<vector<int>,2>(NN,NN);

    auto dis = [&](int i, int j) {
        int dx = x[i]-x[j], dy = y[i]-y[j];
        return dx*dx + dy*dy;
    };

    rep (i,n) {
        bool flag = false;
        loop (dx,-1,<=+1) loop (dy,-1,<=+1) {
            int xx = x[i]/B + dx, yy = y[i]/B + dy;
            if (!(0 <= xx && 0 <= yy)) continue;
            for (int idx : v[xx][yy]) {
                if (dis(idx,i) < 20*20) flag = true;
            }
        }
        if (!flag) v[x[i]/B][y[i]/B].eb(i);
    }

    int cnt = 0;
    rep (i,NN) rep (j,NN) cnt += v[i][j].size();
    cout << cnt << endl;

}
0