結果
問題 | No.461 三角形はいくつ? |
ユーザー | rickytheta |
提出日時 | 2016-12-12 00:44:58 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 4,234 ms / 5,000 ms |
コード長 | 2,187 bytes |
コンパイル時間 | 2,845 ms |
コンパイル使用メモリ | 159,328 KB |
実行使用メモリ | 4,504 KB |
最終ジャッジ日時 | 2023-08-19 11:51:17 |
合計ジャッジ時間 | 38,526 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,504 KB |
testcase_04 | AC | 5 ms
4,376 KB |
testcase_05 | AC | 1,290 ms
4,384 KB |
testcase_06 | AC | 761 ms
4,380 KB |
testcase_07 | AC | 913 ms
4,380 KB |
testcase_08 | AC | 620 ms
4,376 KB |
testcase_09 | AC | 4 ms
4,380 KB |
testcase_10 | AC | 188 ms
4,380 KB |
testcase_11 | AC | 1,085 ms
4,380 KB |
testcase_12 | AC | 480 ms
4,380 KB |
testcase_13 | AC | 1,562 ms
4,380 KB |
testcase_14 | AC | 1,579 ms
4,380 KB |
testcase_15 | AC | 1,532 ms
4,380 KB |
testcase_16 | AC | 864 ms
4,380 KB |
testcase_17 | AC | 860 ms
4,356 KB |
testcase_18 | AC | 2,073 ms
4,352 KB |
testcase_19 | AC | 1,951 ms
4,356 KB |
testcase_20 | AC | 1,562 ms
4,356 KB |
testcase_21 | AC | 1,616 ms
4,356 KB |
testcase_22 | AC | 1,610 ms
4,356 KB |
testcase_23 | AC | 410 ms
4,356 KB |
testcase_24 | AC | 382 ms
4,356 KB |
testcase_25 | AC | 6 ms
4,356 KB |
testcase_26 | AC | 6 ms
4,356 KB |
testcase_27 | AC | 4,234 ms
4,356 KB |
testcase_28 | AC | 6 ms
4,352 KB |
testcase_29 | AC | 417 ms
4,356 KB |
testcase_30 | AC | 189 ms
4,352 KB |
testcase_31 | AC | 823 ms
4,356 KB |
testcase_32 | AC | 1,071 ms
4,356 KB |
testcase_33 | AC | 5 ms
4,356 KB |
testcase_34 | AC | 6 ms
4,356 KB |
testcase_35 | AC | 7 ms
4,356 KB |
testcase_36 | AC | 482 ms
4,352 KB |
testcase_37 | AC | 495 ms
4,356 KB |
testcase_38 | AC | 495 ms
4,352 KB |
testcase_39 | AC | 511 ms
4,352 KB |
testcase_40 | AC | 514 ms
4,352 KB |
testcase_41 | AC | 496 ms
4,352 KB |
testcase_42 | AC | 969 ms
4,356 KB |
testcase_43 | AC | 935 ms
4,356 KB |
testcase_44 | AC | 1,015 ms
4,360 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef int _loop_int; #define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i) #define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i) #define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i) #define DEBUG(x) cout<<#x<<": "<<x<<endl #define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl #define ALL(a) (a).begin(),(a).end() #define CHMIN(a,b) a=min((a),(b)) #define CHMAX(a,b) a=max((a),(b)) // mod const ll MOD = 1000000007ll; #define FIX(a) ((a)%MOD+MOD)%MOD // floating typedef double Real; const Real EPS = 1e-11; #define EQ0(x) (abs(x)<EPS) #define EQ(a,b) (abs(a-b)<EPS) typedef complex<Real> P; class Ratio{ public: ll x,y; Ratio(){} Ratio(ll x,ll y):x(x),y(y){ ll g = __gcd(x,y); x/=g; y/=g; } Ratio operator+(const Ratio &that) const { return Ratio(this->x*that.y + that.x*this->y, this->y*that.y); } Ratio operator-(const Ratio &that) const { return Ratio(this->x*that.y - that.x*this->y, this->y*that.y); } bool operator<(const Ratio &that) const { return (ll)this->x * that.y < (ll)this->y * that.x; } bool operator>(const Ratio &that) const { return (ll)this->x * that.y > (ll)this->y * that.x; } }; int n; Ratio one(1,1); Ratio zero(0,1); set<Ratio> yo[3]; int main(){ scanf("%d",&n); REP(i,n){ int p,a,b; scanf("%d%d%d",&p,&a,&b); yo[p].insert(Ratio(a,a+b)); } REP(p,3)yo[p].insert(one); map<Ratio,int> rui; int it = 0; rui[Ratio(-1e9,1)] = it++; for(auto a:yo[0]){ rui[a] = it++; } rui[Ratio(1e9,1)] = it++; ll ans = 0; for(auto a1:yo[1])for(auto a2:yo[2]){ Ratio b1 = one-a1; Ratio b2 = one-a2; if(one - a2 > a1)continue; Ratio high = one, low = max(b1,b2); ll add = 0; auto it = rui.upper_bound(high);it--; add += it->second; it = rui.lower_bound(low); it--; add -= it->second; ans += add; // banned if(rui.count(one-(a1-b2))){ ans --; } } printf("%lld\n",ans); return 0; }