#882048 (C++17) No.2355 Unhappy Back Dance

提出ソース

結果

問題	No.2355 Unhappy Back Dance
ユーザー	dyktr_06
提出日時	2023-06-16 22:47:29
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	232 ms / 6,000 ms
コード長	11,702 bytes
コンパイル時間	4,641 ms
コンパイル使用メモリ	272,104 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-09-06 21:22:54
合計ジャッジ時間	9,757 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	1 ms 4,380 KB
testcase_03	AC	1 ms 4,376 KB
testcase_04	AC	1 ms 4,380 KB
testcase_05	AC	1 ms 4,376 KB
testcase_06	AC	219 ms 4,376 KB
testcase_07	AC	177 ms 4,380 KB
testcase_08	AC	223 ms 4,380 KB
testcase_09	AC	104 ms 4,384 KB
testcase_10	AC	192 ms 4,384 KB
testcase_11	AC	217 ms 4,380 KB
testcase_12	AC	214 ms 4,380 KB
testcase_13	AC	217 ms 4,380 KB
testcase_14	AC	194 ms 4,380 KB
testcase_15	AC	2 ms 4,376 KB
testcase_16	AC	216 ms 4,380 KB
testcase_17	AC	224 ms 4,376 KB
testcase_18	AC	232 ms 4,380 KB
testcase_19	AC	222 ms 4,380 KB
testcase_20	AC	224 ms 4,380 KB
testcase_21	AC	89 ms 4,376 KB
testcase_22	AC	16 ms 4,376 KB
testcase_23	AC	17 ms 4,376 KB
testcase_24	AC	203 ms 4,376 KB
testcase_25	AC	110 ms 4,380 KB
testcase_26	AC	111 ms 4,380 KB
testcase_27	AC	89 ms 4,380 KB
testcase_28	AC	3 ms 4,376 KB
testcase_29	AC	6 ms 4,380 KB
testcase_30	AC	186 ms 4,380 KB
testcase_31	AC	135 ms 4,376 KB
testcase_32	AC	12 ms 4,380 KB
testcase_33	AC	75 ms 4,376 KB
testcase_34	AC	2 ms 4,380 KB
testcase_35	AC	3 ms 4,380 KB
testcase_36	AC	101 ms 4,380 KB
testcase_37	AC	48 ms 4,380 KB
testcase_38	AC	58 ms 4,376 KB
testcase_39	AC	46 ms 4,380 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }


namespace Geometry{
    using T = long long;
    inline constexpr int type(T x, T y){
        if(!x && !y) return 0;
        if(y < 0 || (y == 0 && x > 0)) return -1;
        return 1;
    }

    struct Point{
        T x, y;
        Point(T X = 0, T Y = 0) : x(X), y(Y){}

        inline bool operator==(const Point &other) const {
            return ((x == other.x) && (y == other.y));
        }
        inline bool operator!=(const Point &other) const {
            return ((x != other.x) || (y != other.y));
        }
        inline bool operator<(const Point &other) const {
            int L = type(x, y), R = type(other.x, other.y);
            if(L != R) return L < R;
            if(x * other.y == other.x * y) return abs(x + y) < abs(other.x + other.y);
            return x * other.y > other.x * y;
        }
        inline bool operator>(const Point &other) const {
            int L = type(x, y), R = type(other.x, other.y);
            if(L != R) return L > R;
            if(x * other.y == other.x * y) return abs(x + y) > abs(other.x + other.y);
            return x * other.y < other.x * y;
        }
        inline Point operator+() const noexcept { return *this; }
        inline Point operator-() const noexcept { return Point(-x, -y); }
        inline Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }
        inline Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }
        inline Point &operator+=(const Point &p) { return x += p.x, y += p.y, *this; }
        inline Point &operator-=(const Point &p) { return x -= p.x, y -= p.y, *this; }
        inline T operator*(const Point &p) const { return x * p.x + y * p.y; }
        inline Point &operator*=(const T &k) { return x *= k, y *= k, *this; }
        inline Point operator*(const T &k) { return (*this *= k); }
        // floor
        inline Point &operator/=(const T &k) { return x /= k, y /= k, *this; }
        inline Point operator/(const T &k) { return (*this /= k); }

        friend inline ostream& operator<<(ostream& os, const Point& p) noexcept { return os << p.x << " " << p.y; }
    };

    bool angle_eq(const Point &p, const Point &q){
        int L = type(p.x, p.y), R = type(q.x, q.y);
        if(L != R) return false;
        return p.x * q.y == q.x * p.y;
    }

    T cross(const Point &p, const Point &q){
        return p.x * q.y - p.y * q.x; 
    }

    T dot(const Point &p, const Point &q){
        return p.x * q.x + p.y * q.y; 
    }

    // 2乗
    T dist(const Point &p, const Point &q){
        return (p.x - q.x) * (p.x - q.x) + (p.y - q.y) * (p.y - q.y);
    }

    // 2倍
    T polygonArea(const vector<Point> &points){
        const int n = points.size();
        T res = 0;
        for(int i = 0; i < n - 1; i++){
            res += cross(points[i], points[i + 1]);
        }
        res += cross(points[n - 1], points[0]);
        return res;
    }

    vector<Point> convexHull(vector<Point> points){
        const int n = points.size();
        if(n <= 2){
            return points;
        }
        vector<Point> U, L, res;
        sort(points.begin(), points.end(), [](Point p, Point q){
            return (p.x == q.x ? p.x < q.x : p.y < q.y);
        });

        // lower 
        for(int i = 0; i < n; i++){
            int j = L.size();
            // 傾きで左回りかをチェック
            while(j >= 2 && cross(L[j - 1] - L[j - 2], points[i] - L[j - 2]) <= 0){
                L.pop_back();
                j--;
            }
            L.push_back(points[i]);
        }

        // upper
        for(int i = n - 1; i >= 0; i--){
            int j = U.size();
            while(j >= 2 && cross(U[j - 1] - U[j - 2], points[i] - U[j - 2]) <= 0){
                U.pop_back();
                j--;
            }
            U.push_back(points[i]);
        }

        res = L;
        for(int i = 1; i < (int) U.size() - 1; i++){
            res.push_back(U[i]);
        }
        return res;
    }

    // 点が領域外部: 0, 内部: 1, 境界上: 2
    int inCcwConvex(Point p, const vector<Point> &points) {
        const int n = points.size();
        T cr1 = cross(points[1] - points[0], p - points[0]);
        T cr2 = cross(points[n - 1] - points[0], p - points[0]);
        if(cr1 < 0 || 0 < cr2){
            return 0;
        }

        int l = 1, r = n - 1;
        while(abs(r - l) > 1){
            int mid = (l + r) / 2;
            if(cross(p - points[0], points[mid] - points[0]) >= 0){
                r = mid;
            }else{
                l = mid;
            }
        }

        T cr = cross(points[l] - p, points[r] - p);
        if(cr == 0){
            return 2;
        }else if(cr > 0){
            if(cr1 == 0 || cr2 == 0){
                return 2;
            }else{
                return 1;
            }
        }else{
            return 0;
        }
    }
}

using namespace Geometry;

struct fraction{
    long long p, q; // long long or __int128_t
    fraction(long long P = 0, long long Q = 1): p(P), q(Q){
        normalize();
    }
    void normalize(){
        long long g = __gcd(p, q);
        p /= g, q /= g;
        // if(q < 0) p *= -1, q *= -1;
    }
    inline bool operator==(const fraction &other) const {
        return p * other.q == other.p * q;
    }
    inline bool operator!=(const fraction &other) const {
        return p * other.q != other.p * q;
    }
    inline bool operator<(const fraction &other) const {
        return p * other.q < other.p * q;
    }
    inline bool operator<=(const fraction &other) const {
        return p * other.q <= other.p * q;
    }
    inline bool operator>(const fraction &other) const {
        return p * other.q > other.p * q;
    }
    inline bool operator>=(const fraction &other) const {
        return p * other.q >= other.p * q;
    }
    inline fraction operator+(const fraction &other) const { return fraction(p * other.q + q * other.p, q * other.q); }
    inline fraction operator-(const fraction &other) const { return fraction(p * other.q - q * other.p, q * other.q); }
    inline fraction operator*(const fraction &other) const { return fraction(p * other.p, q * other.q); }
    inline fraction operator/(const fraction &other) const { return fraction(p * other.q, q * other.p); }
    inline fraction& operator+=(const fraction& rhs) noexcept {
        *this = *this + rhs;
        return *this;
    }
    inline fraction& operator-=(const fraction& rhs) noexcept {
        *this = *this - rhs;
        return *this;
    }
    inline fraction& operator*=(const fraction& rhs) noexcept {
        *this = *this * rhs;
        return *this;
    }
    inline fraction& operator/=(const fraction& rhs) noexcept {
        *this = *this / rhs;
        return *this;
    }
    friend inline istream& operator>>(istream& is, fraction& x) noexcept {
        is >> x.p;
        x.q = 1;
        return is;
    }
    friend inline ostream& operator<<(ostream& os, const fraction& x) noexcept { return os << x.p << "/" << x.q; }
};

ll n;
vector<Point> p;

void input(){
    in(n);
    p.resize(n);
    rep(i, n){
        ll x, y; in(x, y);
        p[i] = Point(x, y);
    }
}

void solve(){
    ll ans = 0;
    rep(i, n){
        vector<Point> q;
        rep(j, n){
            if(i == j) continue; 
            Point d = p[j] - p[i];
            q.push_back(d);
        }
        Sort(q);
        ll check = 0;
        rep(j, n - 2){
            if(angle_eq(q[j], q[j + 1])){
                check = 1;
                break;
            }
        }
        if(check) ans++;
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード