#137852 (C++14) No.461 三角形はいくつ？

• 問題: No.461 三角形はいくつ？
• ユーザー: しらっ亭
• 提出日時: 2016-12-12 05:29:02
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 3,830 ms / 5,000 ms
• コード長: 4,846 bytes
• コンパイル時間: 2,289 ms
• コンパイル使用メモリ: 179,388 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-07 02:41:09
• 合計ジャッジ時間: 51,734 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	8 ms; 5,376 KB
testcase_05	AC	2,106 ms; 5,376 KB
testcase_06	AC	1,219 ms; 5,376 KB
testcase_07	AC	1,453 ms; 5,376 KB
testcase_08	AC	977 ms; 5,376 KB
testcase_09	AC	5 ms; 5,376 KB
testcase_10	AC	313 ms; 5,376 KB
testcase_11	AC	1,603 ms; 5,376 KB
testcase_12	AC	717 ms; 5,376 KB
testcase_13	AC	2,405 ms; 5,376 KB
testcase_14	AC	2,290 ms; 5,376 KB
testcase_15	AC	2,418 ms; 5,376 KB
testcase_16	AC	614 ms; 5,376 KB
testcase_17	AC	606 ms; 5,376 KB
testcase_18	AC	3,795 ms; 5,376 KB
testcase_19	AC	3,830 ms; 5,376 KB
testcase_20	AC	2,509 ms; 5,376 KB
testcase_21	AC	2,585 ms; 5,376 KB
testcase_22	AC	2,474 ms; 5,376 KB
testcase_23	AC	600 ms; 5,376 KB
testcase_24	AC	602 ms; 5,376 KB
testcase_25	AC	13 ms; 5,376 KB
testcase_26	AC	12 ms; 5,376 KB
testcase_27	AC	12 ms; 5,376 KB
testcase_28	AC	12 ms; 5,376 KB
testcase_29	AC	845 ms; 5,376 KB
testcase_30	AC	403 ms; 5,376 KB
testcase_31	AC	1,550 ms; 5,376 KB
testcase_32	AC	2,086 ms; 5,376 KB
testcase_33	AC	4 ms; 5,376 KB
testcase_34	AC	4 ms; 5,376 KB
testcase_35	AC	4 ms; 5,376 KB
testcase_36	AC	763 ms; 5,376 KB
testcase_37	AC	755 ms; 5,376 KB
testcase_38	AC	775 ms; 5,376 KB
testcase_39	AC	709 ms; 5,376 KB
testcase_40	AC	752 ms; 5,376 KB
testcase_41	AC	788 ms; 5,376 KB
testcase_42	AC	1,662 ms; 5,376 KB
testcase_43	AC	1,646 ms; 5,376 KB
testcase_44	AC	1,713 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;
using vb=vector<bool>;using vs=vector<string>;
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 vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<typename T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){o<<'('<<p.fst<<", "<<p.snd<<')';return o;}

#define A first
#define B second

typedef long long Integer;
Integer gcd(Integer a, Integer b) { return a > 0 ? gcd(b % a, a) : b; }
struct rational {
  Integer p, q;
  void normalize() { // keep q positive
    if (q < 0) p *= -1, q *= -1;
    Integer d = gcd(p < 0 ? -p : p, q);
    if (d == 0) p = 0,  q = 1;
    else        p /= d, q /= d;
  }
  rational(Integer p, Integer q = 1) : p(p), q(q) {
    normalize();
  }
  rational &operator += (const rational &a) {
    p = a.q * p + a.p * q; q = a.q * q; normalize();
    return *this;
  }
  rational &operator -= (const rational &a) {
    p = a.q * p - a.p * q; q = a.q * q; normalize();
    return *this;
  }
  rational &operator *= (const rational &a) {
    p *= a.p; q *= a.q; normalize();
    return *this;
  }
  rational &operator /= (const rational &a) {
    p *= a.q; q *= a.p; normalize();
    return *this;
  }
  rational &operator - () {
    p *= -1;
    return *this;
  }
};
rational operator + (const rational &a, const rational &b) {
  return rational(a) += b;
}
rational operator * (const rational &a, const rational &b) {
  return rational(a) *= b;
}
rational operator - (const rational &a, const rational &b) {
  return rational(a) -= b;
}
rational operator / (const rational &a, const rational &b) {
  return rational(a) /= b;
}
bool operator < (const rational &a, const rational &b) { // avoid overflow
  return (long double) a.p * b.q < (long double) a.q * b.p;
}
bool operator <= (const rational &a, const rational &b) {
  return !(b < a);
}
bool operator > (const rational &a, const rational &b) {
  return b < a;
}
bool operator >= (const rational &a, const rational &b) {
  return !(a < b);
}
bool operator == (const rational &a, const rational &b) {
  return !(a < b) && !(b < a);
}
bool operator != (const rational &a, const rational &b) {
  return (a < b) || (b < a);
}
ostream&operator<<(ostream&o,const rational&r){o<<r.p<<'/'<<r.q;return o;}

// a/(a+b) と足したら1を越えるのが何本あるか
// O(log |S|)
int bs(const rational &ab, const vector<rational> &S) {
  int ok = sz(S);
  int ng = -1;

  while (abs(ok - ng) > 1) {
    int mid = (ok + ng) / 2;
    bool c = ab + S[mid] > 1;
    // cout << "ok: " << ok << ", ng: " << ng << ", ";
    // cout << "check(" << mid << ") -> " << c << endl;
    if (c) ok = mid;
    else ng = mid;
  }
  return sz(S) - ok;
}

void Main() {
  int n = read<int>();

  vector<vector<rational>> R(3);

  rep(i, n) {
    int t = read<int>();
    int a = read<int>();
    int b = read<int>();

    R[t].emplace_back(a, a + b);
  }

  {
    int s0 = sz(R[0]);
    int s1 = sz(R[1]);
    int s2 = sz(R[2]);
    if (s0 > s2) swap(R[0], R[2]);
    if (s1 > s2) swap(R[1], R[2]);
  }

  rep(i, 3) sort(all(R[i]));
  //rep(ii,3) { cout << "R["<<ii<<"]:"; rep(jj, sz(R[ii])) cout << ' ' << R[ii][jj]; cout << endl; }

  ll ans = 1 + n;

  forr(ab, R[1]) {
    int c0 = bs(ab, R[0]);
    //_p("R1: a:%d, b:%d, c0: %d\n", a, b, c0);
    ans += c0;
  }

  forr(ab, R[2]) {
    int c0 = bs(ab, R[0]);
    int c1 = bs(ab, R[1]);
    //_p("R2: a:%lld, b:%lld, c0: %d, c1: %d\n", a, b, c0, c1);
    ans += c0;
    ans += c1;
  }

  // R[0] と R[1]
  //vector<rational> X, Y;
  forr(ab, R[0]) {
    forr(cd, R[1]) {
      if (ab + cd >= 1) {
        {
          rational z = 1 - (ab < cd ? ab : cd);
          ans += R[2].end() - lower_bound(all(R[2]), z);
        }
        {
          auto e = (1-cd) + (1-ab);
          auto f = cd - (1-ab);
          rational ef(e / (e+f));
          ans -= upper_bound(all(R[2]), ef) - lower_bound(all(R[2]), ef);
        }
      }
    }
  }

  cout << ans << endl;
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }