結果

問題 No.2355 Unhappy Back Dance
ユーザー siganaisiganai
提出日時 2023-06-16 22:35:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 5,579 ms / 6,000 ms
コード長 5,310 bytes
コンパイル時間 2,750 ms
コンパイル使用メモリ 224,836 KB
実行使用メモリ 179,200 KB
最終ジャッジ日時 2024-06-24 15:19:06
合計ジャッジ時間 31,564 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 219 ms
36,516 KB
testcase_07 AC 222 ms
36,976 KB
testcase_08 AC 236 ms
36,488 KB
testcase_09 AC 291 ms
37,592 KB
testcase_10 AC 1,590 ms
108,948 KB
testcase_11 AC 1,451 ms
109,516 KB
testcase_12 AC 239 ms
36,756 KB
testcase_13 AC 237 ms
36,800 KB
testcase_14 AC 1,645 ms
109,524 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 5,468 ms
179,072 KB
testcase_17 AC 5,447 ms
179,200 KB
testcase_18 AC 5,477 ms
179,072 KB
testcase_19 AC 5,408 ms
179,200 KB
testcase_20 AC 5,579 ms
179,200 KB
testcase_21 AC 1,918 ms
76,800 KB
testcase_22 AC 254 ms
17,024 KB
testcase_23 AC 275 ms
17,792 KB
testcase_24 AC 4,868 ms
161,920 KB
testcase_25 AC 2,318 ms
88,832 KB
testcase_26 AC 2,379 ms
89,216 KB
testcase_27 AC 1,947 ms
78,208 KB
testcase_28 AC 21 ms
6,940 KB
testcase_29 AC 55 ms
7,296 KB
testcase_30 AC 4,487 ms
150,144 KB
testcase_31 AC 2,999 ms
110,336 KB
testcase_32 AC 181 ms
13,952 KB
testcase_33 AC 1,578 ms
64,128 KB
testcase_34 AC 8 ms
6,940 KB
testcase_35 AC 22 ms
6,944 KB
testcase_36 AC 1,985 ms
78,208 KB
testcase_37 AC 920 ms
43,136 KB
testcase_38 AC 1,173 ms
52,352 KB
testcase_39 AC 873 ms
41,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;

int main() {
    INT(n);
    vl x(n),y(n);
    rep(i,n) cin >> x[i] >> y[i];
    map<tuple<__int128_t,__int128_t,__int128_t>,vi> mp;
    rep(i,n) {
        rep(j,n) {
            if(i == j) continue;
            __int128_t A = x[j] - x[i];
            __int128_t B = y[j] - y[i];
            __int128_t C = -A * y[j] + B * x[j];
            auto gc = gcd<__int128_t>(A,B);
            A /= gc;
            B /= gc;
            C /= gc;
            if(A < 0) {
                A *= -1;
                B *= -1;
                C *= -1;
            }
            if(A == 0 && B < 0) {
                B *= -1;
                C *= -1;
            }
            mp[make_tuple(A,B,C)].emplace_back(i);
            mp[make_tuple(A,B,C)].emplace_back(i);
        }
    }
    vi out(n);
    for(auto &[_,v]:mp) {
        sort(all(v));
        v.erase(unique(all(v)),v.end());
        if(v.size() == 3) {
            sort(all(v),[&](int F,int S){
                if(x[F] != x[S]) return x[F] < x[S];
                else return y[F] < y[S];
            });
            out[v[0]] = 1;
            out[v[2]] = 1;
        }
        else if(v.size() > 3) {
            for(auto &id:v) out[id] = 1;
        }
    }
    cout << sum(out) << '\n';
}
0