#407099 (C++14) No.947 ABC包囲網

提出ソース

結果

問題	No.947 ABC包囲網
ユーザー	haruki_K
提出日時	2019-12-10 03:13:32
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	591 ms / 2,000 ms
コード長	4,850 bytes
コンパイル時間	1,623 ms
コンパイル使用メモリ	174,764 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-23 14:31:43
合計ジャッジ時間	15,350 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 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	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	4 ms 6,948 KB
testcase_16	AC	3 ms 6,940 KB
testcase_17	AC	3 ms 6,948 KB
testcase_18	AC	3 ms 6,940 KB
testcase_19	AC	4 ms 6,940 KB
testcase_20	AC	4 ms 6,944 KB
testcase_21	AC	3 ms 6,944 KB
testcase_22	AC	4 ms 6,944 KB
testcase_23	AC	4 ms 6,944 KB
testcase_24	AC	4 ms 6,940 KB
testcase_25	AC	4 ms 6,940 KB
testcase_26	AC	4 ms 6,944 KB
testcase_27	AC	4 ms 6,940 KB
testcase_28	AC	577 ms 6,940 KB
testcase_29	AC	527 ms 6,944 KB
testcase_30	AC	591 ms 6,944 KB
testcase_31	AC	523 ms 6,944 KB
testcase_32	AC	517 ms 6,940 KB
testcase_33	AC	524 ms 6,940 KB
testcase_34	AC	522 ms 6,944 KB
testcase_35	AC	531 ms 6,940 KB
testcase_36	AC	527 ms 6,940 KB
testcase_37	AC	525 ms 6,944 KB
testcase_38	AC	527 ms 6,940 KB
testcase_39	AC	521 ms 6,940 KB
testcase_40	AC	522 ms 6,940 KB
testcase_41	AC	516 ms 6,940 KB
testcase_42	AC	520 ms 6,940 KB
testcase_43	AC	521 ms 6,944 KB
testcase_44	AC	526 ms 6,940 KB
testcase_45	AC	522 ms 6,940 KB
testcase_46	AC	524 ms 6,940 KB
testcase_47	AC	522 ms 6,944 KB
testcase_48	AC	518 ms 6,944 KB
testcase_49	AC	527 ms 6,944 KB
testcase_50	AC	521 ms 6,944 KB
testcase_51	AC	3 ms 6,944 KB
testcase_52	AC	3 ms 6,940 KB
testcase_53	AC	2 ms 6,944 KB
testcase_54	AC	2 ms 6,944 KB
testcase_55	AC	2 ms 6,944 KB
testcase_56	AC	2 ms 6,940 KB
testcase_57	AC	4 ms 6,944 KB
testcase_58	AC	4 ms 6,944 KB
testcase_59	AC	4 ms 6,944 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#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
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
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) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
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{}); }
#define int ll
#define double ld
template <class T> int sz(T const& x) { return x.size(); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<

constexpr double pi = acos(-1.0);
auto angle = [](double yy, double xx) {
    double t = atan2(yy,xx);
    if (t < 0) t += 2*pi;
    return t;
};


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

    vector<double> t(n);
    rep (i,n) t[i] = angle(y[i],x[i]);
    sort(all(t));
    debug {
        auto s = t;
        for (auto& val : s) val /= pi;
        dump(s);
    }

    int cnt = 0;
    const double eps = 1e-10;
    rep (i,n) rep (j,n) if (t[i]+eps < t[j] && t[j]+eps < t[i] + pi) {
        int l = lower_bound(all(t), t[i]+pi+eps)-t.begin();
        int r = lower_bound(all(t), t[j]+pi-eps)-t.begin();
        dump(i,j,t[i]/pi,t[j]/pi,l,r);
        cnt += r-l;
    }

    cout << cnt << endl;

}

yukicoder

結果

テストケース

ソースコード