結果

問題 No.947 ABC包囲網
コンテスト
ユーザー firiexp
提出日時 2019-12-10 08:20:13
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,272 bytes
コンパイル時間 1,012 ms
コンパイル使用メモリ 87,668 KB
最終ジャッジ日時 2024-11-14 21:56:35
合計ジャッジ時間 2,023 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:18:39: error: '::numeric_limits' has not been declared
   18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                       ^~~~~~~~~~~~~~
main.cpp:18:55: error: expected primary-expression before '>' token
   18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                       ^
main.cpp:18:61: error: no matching function for call to 'max()'
   18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                        ~~~~~^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
main.cpp:18:61: note:   candidate expects 2 arguments, 0 provided
   18 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                        ~~~~~^~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

class UnionFind {
    int n;
    vector<int> uni;
    int forest_size;
public:
    explicit UnionFind(int n) : n(n), uni(static_cast<u32>(n), -1), forest_size(n) {};

    int root(int a){
        if (uni[a] < 0) return a;
        else return (uni[a] = root(uni[a]));
    }

    bool unite(int a, int b) {
        a = root(a);
        b = root(b);
        if(a == b) return false;
        if(uni[a] > uni[b]) swap(a, b);
        uni[a] += uni[b];
        uni[b] = a;
        forest_size--;
        return true;
    }
    int size(){ return forest_size; }
    int size(int i){ return -uni[root(i)]; }
    bool same(int a, int b) { return root(a) == root(b); }
};

int main() {
    ll n;
    cin >> n;

    vector<ll> xs, ys;

    for (int i = 0; i < n; ++i) {
        ll x, y;
        cin >> x >> y;
        if(x != 0 || y != 0) xs.emplace_back(x), ys.emplace_back(y);
    }
    n = xs.size();
    ll ans = n*(n-1)*(n-2)/6;
    UnionFind uf(n);
    for (int i = 0; i < n; ++i) {
        for (int j = i+1; j < n; ++j) {
            if(xs[i]*ys[j] == xs[j]*ys[i]){
                uf.unite(i, j);
            }
        }
    }
    ll ans2 = 0;
    for (int i = 0; i < n; ++i) {
        if(uf.root(i) == i){
            ll a = uf.size(i);
            ans -= a*(a-1)/2*(n-a);
            ans -= a*(a-1)*(a-2)/6;
            ll l = 0, r = 0;
            for (int j = 0; j < n; ++j) {
                if(uf.root(j)!=i)continue;
                if(xs[i]*xs[j]+ys[i]*ys[j]>0) l++;
                else r++;
            }
            ans2 -= (l*(l-1)/2+r*(r-1)/2)*(n-a);
        }
        ll l = 0, r = 0;
        for (int j = 0; j < n; ++j) {
            if(i == j) continue;
            if(xs[i]*ys[j] - xs[j]*ys[i] > 0) l++;
            if(xs[i]*ys[j] - xs[j]*ys[i] < 0) r++;
        }
        ans2 += l*(l-1)/2;
        ans2 += r*(r-1)/2;
    }
    cout << ans-ans2/2 << "\n";
    return 0;
}
0