結果
問題 | No.461 三角形はいくつ? |
ユーザー |
|
提出日時 | 2016-12-12 20:37:50 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 6,761 bytes |
コンパイル時間 | 1,533 ms |
コンパイル使用メモリ | 127,484 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-29 17:45:05 |
合計ジャッジ時間 | 41,603 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 40 TLE * 1 |
コンパイルメッセージ
main.cpp: In lambda function: main.cpp:147:17: warning: control reaches end of non-void function [-Wreturn-type] 147 | }); | ^
ソースコード
// need#include <iostream>#include <algorithm>// data structure#include <bitset>//#include <list>#include <map>#include <queue>#include <set>#include <stack>#include <string>#include <utility>#include <vector>//#include <array>//#include <tuple>#include <unordered_map>#include <unordered_set>//#include <complex>//#include <deque>// stream//#include <istream>//#include <sstream>//#include <ostream>// etc#include <cassert>#include <functional>#include <iomanip>//#include <typeinfo>#include <chrono>#include <random>#include <cfenv>#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i,__VA_ARGS__);}template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p,rest...); }#define OUT(d) std::cout<<d;#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;#define SP std::cout<<" ";#define TAB std::cout<<"\t";#define BR std::cout<<"\n";#define ENDL std::cout<<std::endl;#define FLUSH std::cout<<std::flush;#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;#define ALL(a) (a).begin(),(a).end()#define FOR(i, a, b) for(int i=(a);i<(b);++i)#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)#define REP(i, n) for(int i=0;i<int(n);++i)#define RREP(i, n) for(int i=(n)-1;i>=0;--i)#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)#define REPLL(i, n) for(ll i=0;i<ll(n);++i)#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)#define PAIR std::pair<int, int>#define PAIRLL std::pair<ll, ll>#define IN(a, x, b) (a<=x && x<b)#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr <<tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res =std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n";}#define int llusing ll = long long;using ull = unsigned long long;constexpr int INFINT = 1 << 30; // 1.07x10^ 9constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9constexpr ll INFLL = 1LL << 60; // 1.15x10^18constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^19constexpr double EPS = 1e-7;constexpr int MOD = 1000000007;constexpr double PI = 3.141592653589793238462643383279;ll gcd(ll a, ll b) {return b ? gcd(b, a%b) : a;}struct Line {ll p, a, b;Line() {}Line(int p, int a, int b) : p(p), a(a), b(b) {}};signed main() {INIT;VAR(int, n);VEC_ROW(int, n, p, a, b);REP(i, n) {int g = gcd(a[i], b[i]);a[i] /= g;b[i] /= g;}std::vector<std::vector<Line>> data(3);REP(i, n) {data[p[i]].emplace_back(Line(p[i], a[i], b[i]));}int ans = 1;// p=0ans += data[0].size();// p=1REP(i, data[1].size()) {Line l(1, data[1][i].b, data[1][i].a);REP(j, data[0].size()) {auto& l2 = data[0][j];if (l.b * (l2.a + l2.b) > l2.b * (l.a + l.b)) ++ans;}++ans;}// p=2REP(i, data[2].size()) {Line li(2, data[2][i].b, data[2][i].a);std::vector<Line> lines;lines.reserve(data[0].size() + data[1].size());REP(k, 2) {REP(j, data[k].size()) {auto& l2 = data[k][j];if (li.b * (l2.a + l2.b) < l2.b * (li.a + li.b)) continue;lines.emplace_back(l2);}}lines.emplace_back(Line(1, 1, 0));lines.emplace_back(Line(0, 1, 0));std::sort(ALL(lines), [&](Line& l, Line& r) {if (l.p == 0 && r.p == 0) return l.a * (r.a + r.b) < r.a * (l.a + l.b);if (l.p == 0 && r.p == 1) return li.b * (l.a + l.b) * (r.a + r.b) < l.b * (li.a + li.b) * (r.a + r.b) + r.b * (li.a + li.b) * (l.a + l.b);if (l.p == 1 && r.p == 0) return li.b * (l.a + l.b) * (r.a + r.b) > l.b * (li.a + li.b) * (r.a + r.b) + r.b * (li.a + li.b) * (l.a + l.b);if (l.p == 1 && r.p == 1) return l.a * (r.a + r.b) > r.a * (l.a + l.b);});Line pre(-1, -1, -1);int l0 = 0, l1 = 0;for (const auto& x : lines) {if (pre.p != -1) {if (pre.p != x.p &&li.b * (pre.a + pre.b) * (x.a + x.b) == pre.b * (li.a + li.b) * (x.a + x.b) + x.b * (li.a + li.b) * (pre.a + pre.b)) {--ans;}}pre = x;if (x.p == 0) ++l0;else ++l1;}ans += l0*l1;REP(j, lines.size() - 1) {if (lines[j].p != 0) continue;auto& l1 = lines[j];FOR(k, j + 1, lines.size()) {if (lines[k].p != 1) continue;auto& l2 = lines[k];if (l1.a*l2.a < l1.b*l2.b) --ans;}}}OUT(ans)BR;return 0;}