結果
問題 | No.5009 Draw A Convex Polygon |
ユーザー |
![]() |
提出日時 | 2022-12-05 01:12:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,986 ms / 2,600 ms |
コード長 | 7,855 bytes |
コンパイル時間 | 2,336 ms |
実行使用メモリ | 35,144 KB |
スコア | 1,000,000 |
平均クエリ数 | 1000001.00 |
最終ジャッジ日時 | 2022-12-05 01:12:08 |
合計ジャッジ時間 | 7,011 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
純コード判定しない問題か言語 |
(要ログイン)
ソースコード
#include <bits/stdc++.h> using namespace std; #define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++) #define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++) #define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++) #define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++) #define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--) #define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--) #define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--) #define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--) #define inc(i, n) incIX(i, 0, n) #define dec(i, n) decIX(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); }; auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); }; auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); }; auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); }; auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); }; using LL = long long int; using LD = long double; #define PB push_back #define EB emplace_back #define MP make_pair #define MT make_tuple #define FI first #define SE second #define FR front() #define BA back() #define ALL(a) begin(a), end(a) #define RALL(a) rbegin(a), rend(a) #define RV(a) reverse(ALL(a)) #define ST(a) sort(ALL(a)) #define RST(a) sort(RALL(a)) #define SC static_cast #define SI(a) SC<int>(a.size()) #define SL(a) SC<LL>(a.size()) #define RF(e, ...) for(auto && e: __VA_ARGS__) #define SF(a, ...) for(auto && [__VA_ARGS__]: a) #define until(...) while(not(__VA_ARGS__)) #define if_not(...) if(not(__VA_ARGS__)) #define ef else if #define UR assert(false) auto * IS = & cin; auto * OS = & cout; template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); } #define IN(...) __VA_ARGS__; in(__VA_ARGS__) struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_; void out_([[maybe_unused]] string const & s) { } template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; } template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); } auto outF = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; }; auto outN = [](auto const & ... a) { outF("" , "" , a ...); }; auto outS = [](auto const & ... a) { outF(" " , " " , a ...); }; auto outL = [](auto const & ... a) { outF("\n", "\n", a ...); }; auto outSN = [](auto const & ... a) { outF(" " , "" , a ...); }; auto outNL = [](auto const & ... a) { outF("" , "\n", a ...); }; auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); }; auto out = outSL; template<typename A > void disp_(A const & a) { * OS << a; } template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } } auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; }; auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; }; auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); }; template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; } template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; } template<typename A > auto make_v(A a) { return a; } template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); } template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; } template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; } template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; } template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; } template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; } template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } } template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } } template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; } template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; } // ---- ---- struct Frac { LL a, b; Frac(LL aa = 0, LL bb = 1) { a = aa; b = bb; if(b < 0) { a *= -1; b *= -1; } LL d = gcd(abs(a), b); a /= d; b /= d; } Frac exp(LL y) { Frac p = 1, e = (* this); if(y < 0) { e = 1 / e; y = -y; } while(y) { if(y & 1) { p *= e; } e *= e; y >>= 1; } return p; } friend bool operator< (Frac x, Frac y) { return (x.a * y.b < y.a * x.b); } friend bool operator> (Frac x, Frac y) { return (x.a * y.b > y.a * x.b); } friend bool operator<=(Frac x, Frac y) { return (x.a * y.b <= y.a * x.b); } friend bool operator>=(Frac x, Frac y) { return (x.a * y.b >= y.a * x.b); } friend bool operator==(Frac x, Frac y) { return (x.a * y.b == y.a * x.b); } friend bool operator!=(Frac x, Frac y) { return (x.a * y.b != y.a * x.b); } friend Frac operator+ (Frac x ) { return Frac(+x.a, x.b); } friend Frac operator- (Frac x ) { return Frac(-x.a, x.b); } friend Frac operator+ (Frac x, Frac y) { return Frac(x.a * y.b + y.a * x.b, x.b * y.b); } friend Frac operator- (Frac x, Frac y) { return Frac(x.a * y.b - y.a * x.b, x.b * y.b); } friend Frac operator* (Frac x, Frac y) { return Frac(x.a * y.a, x.b * y.b); } friend Frac operator/ (Frac x, Frac y) { return Frac(x.a * y.b, x.b * y.a); } friend Frac operator^ (Frac x, LL y) { return x.exp(y); } friend Frac & operator+=(Frac & x, Frac y) { return (x = x + y); } friend Frac & operator-=(Frac & x, Frac y) { return (x = x - y); } friend Frac & operator*=(Frac & x, Frac y) { return (x = x * y); } friend Frac & operator/=(Frac & x, Frac y) { return (x = x / y); } friend Frac & operator^=(Frac & x, LL y) { return (x = x ^ y); } friend istream & operator>>(istream & is, Frac & x) { x.b = 1; return (is >> x.a); } friend ostream & operator<<(ostream & os, Frac x) { return (x.b == 1 ? os << x.a : os << x.a << "/" << x.b); } }; // ---- #define UQnoS(v) v.erase(unique(ALL(v)), v.end()) #define UQ(v) sort(ALL(v)); UQnoS(v) int main() { vector<Frac> v; int B = 907; inc1(i, B) { inc1(j, B) { v.EB(i, j); } } UQ(v); int n = 1'000'000; until(SI(v) <= n / 2) { v.pop_back(); } assert(2 * SI(v) == n); LL x = 0, y = 0; out(n); RF(e, v) { out(x, y); x += e.b; y += e.a; } RF(e, v) { out(x, y); x -= e.b; y -= e.a; } }