結果
問題 | No.5009 Draw A Convex Polygon |
ユーザー | maspy |
提出日時 | 2022-12-02 02:13:02 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,279 ms / 2,600 ms |
コード長 | 13,149 bytes |
コンパイル時間 | 3,114 ms |
実行使用メモリ | 86,304 KB |
スコア | 1,000,000 |
平均クエリ数 | 1000001.00 |
最終ジャッジ日時 | 2022-12-02 02:13:09 |
合計ジャッジ時間 | 6,326 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
純コード判定しない問題か言語 |
(要ログイン)
ソースコード
#line 1 "library/my_template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll = long long; using pi = pair<ll, ll>; using vi = vector<ll>; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; template <class T> using vc = vector<T>; template <class T> using vvc = vector<vc<T>>; template <class T> using vvvc = vector<vvc<T>>; template <class T> using vvvvc = vector<vvvc<T>>; template <class T> using vvvvvc = vector<vvvvc<T>>; template <class T> using pq = priority_queue<T>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; #define vec(type, name, ...) vector<type> name(__VA_ARGS__) #define vv(type, name, h, ...) \ vector<vector<type>> name(h, vector<type>(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector<vector<vector<type>>> name( \ h, vector<vector<type>>(w, vector<type>(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector<vector<vector<vector<type>>>> name( \ a, vector<vector<vector<type>>>( \ b, vector<vector<type>>(c, vector<type>(__VA_ARGS__)))) // https://trap.jp/post/1224/ #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) \ overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s)) #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define elif else if #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define stoi stoll template <typename T, typename U> T SUM(const vector<U> &A) { T sum = 0; for (auto &&a: A) sum += a; return sum; } #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> T pick(deque<T> &que) { T a = que.front(); que.pop_front(); return a; } template <typename T> T pick(pq<T> &que) { T a = que.top(); que.pop(); return a; } template <typename T> T pick(pqg<T> &que) { assert(que.size()); T a = que.top(); que.pop(); return a; } template <typename T> T pick(vc<T> &que) { assert(que.size()); T a = que.back(); que.pop_back(); return a; } template <typename T, typename U> T ceil(T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); } template <typename T, typename U> T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); } template <typename T, typename U> pair<T, T> divmod(T x, U y) { T q = floor(x, y); return {q, x - q * y}; } template <typename F> ll binary_search(F check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x)); } return ok; } template <typename F> double binary_search_real(F check, double ok, double ng, int iter = 100) { FOR(iter) { double x = (ok + ng) / 2; tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x)); } return (ok + ng) / 2; } template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vc<int> s_to_vi(const string &S, char first_char) { vc<int> A(S.size()); FOR(i, S.size()) { A[i] = S[i] - first_char; } return A; } template <typename T, typename U> vector<T> cumsum(vector<U> &A, int off = 1) { int N = A.size(); vector<T> B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } template <typename CNT, typename T> vc<CNT> bincount(const vc<T> &A, int size) { vc<CNT> C(size); for (auto &&x: A) { ++C[x]; } return C; } // stable template <typename T> vector<int> argsort(const vector<T> &A) { vector<int> ids(A.size()); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); }); return ids; } // A[I[0]], A[I[1]], ... template <typename T> vc<T> rearrange(const vc<T> &A, const vc<int> &I) { int n = len(I); vc<T> B(n); FOR(i, n) B[i] = A[I[i]]; return B; } #line 1 "library/other/io.hpp" namespace fastio { // https://nyaannyaan.github.io/library/misc/fastio.hpp を元に改造 // クラスが read(), print() を持っているかを判定するメタ関数 struct has_write_impl { template <class T> static auto check(T &&x) -> decltype(x.write(), std::true_type{}); template <class T> static auto check(...) -> std::false_type; }; template <class T> class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) { }; struct has_read_impl { template <class T> static auto check(T &&x) -> decltype(x.read(), std::true_type{}); template <class T> static auto check(...) -> std::false_type; }; template <class T> class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {}; static constexpr int SZ = 1 << 17; char inbuf[SZ], outbuf[SZ]; int in_left = 0, in_right = 0, out_right = 0; struct Pre { char num[40000]; constexpr Pre() : num() { for (int i = 0; i < 10000; i++) { int n = i; for (int j = 3; j >= 0; j--) { num[i * 4 + j] = n % 10 + '0'; n /= 10; } } } } constexpr pre; inline void load() { int len = in_right - in_left; memmove(inbuf, inbuf + in_left, len); in_right = len + fread(inbuf + len, 1, SZ - len, stdin); in_left = 0; } inline void flush() { fwrite(outbuf, 1, out_right, stdout); out_right = 0; } inline void read_single(char &c) { if (in_left + 32 > in_right) load(); c = inbuf[in_left++]; } template <class T, enable_if_t<is_same<T, string>::value, int> = 0> inline void read_single(T &x) { char c = ' '; do { if (in_left + 32 > in_right) load(); c = inbuf[in_left++]; } while (c == ' ' || c == '\n'); x += c; while (1) { if (in_left + 32 > in_right) load(); c = inbuf[in_left++]; if (c == ' ' || c == '\n') break; x += c; } } template <class T, enable_if_t<is_integral<T>::value, int> = 0> inline void read_single(T &x) { if (in_left + 32 > in_right) load(); char c; do c = inbuf[in_left++]; while (c < '-'); bool minus = false; if constexpr (is_signed<T>::value == true) { if (c == '-') minus = true, c = inbuf[in_left++]; } x = 0; while (c >= '0') { x = x * 10 + (c & 15); c = inbuf[in_left++]; } if constexpr (is_signed<T>::value == true) { if (minus) x = -x; } } template <typename T, typename enable_if<has_read<T>::value>::type * = nullptr> inline void read_single(T x) { x.read(); } template <class T, class U> inline void read_single(pair<T, U> &p) { read_single(p.first), read_single(p.second); } template <class... T> inline void read(tuple<T...> &tpl) { apply([&](auto... t) { (read(t), ...); }, tpl); } template <class T> inline void read_single(vector<T> &ref) { for (auto &d: ref) read_single(d); } template <class T, int N> inline void read_single(array<T, N> &ref) { for (auto &d: ref) read_single(d); } inline void read() {} template <typename Head, typename... Tail> inline void read(Head &head, Tail &... tail) { read_single(head); read(tail...); } inline void write(char c) { if (out_right > SZ - 32) flush(); outbuf[out_right++] = c; } inline void write(const string &s) { if (out_right + s.size() > SZ - 32) flush(); memcpy(outbuf + out_right, s.data(), sizeof(char) * s.size()); out_right += s.size(); } template <class T, enable_if_t<is_integral<T>::value, int> = 0> inline void write(T x) { if (out_right > SZ - 32) flush(); if (!x) { outbuf[out_right++] = '0'; return; } if constexpr (is_signed<T>::value == true) { if (x < 0) outbuf[out_right++] = '-', x = -x; } int i = 12; char buf[16]; while (x >= 10000) { memcpy(buf + i, pre.num + (x % 10000) * 4, 4); x /= 10000; i -= 4; } if (x < 100) { if (x < 10) { outbuf[out_right] = '0' + x; ++out_right; } else { uint32_t q = (uint32_t(x) * 205) >> 11; uint32_t r = uint32_t(x) - q * 10; outbuf[out_right] = '0' + q; outbuf[out_right + 1] = '0' + r; out_right += 2; } } else { if (x < 1000) { memcpy(outbuf + out_right, pre.num + (x << 2) + 1, 3); out_right += 3; } else { memcpy(outbuf + out_right, pre.num + (x << 2), 4); out_right += 4; } } memcpy(outbuf + out_right, buf + i + 4, 12 - i); out_right += 12 - i; } inline void write(const double &x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } inline void write(const long double &x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } template <typename T, typename enable_if<has_write<T>::value>::type * = nullptr> inline void write(T x) { x.write(); } template <class T> void write(const vector<T> &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template <class T, class U> void write(const pair<T, U> &val) { write(val.first); write(' '); write(val.second); } template <class T, size_t S> inline void write(const array<T, S> &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } inline void write(i128 val) { string s; bool negative = 0; if (val < 0) { negative = 1; val = -val; } while (val) { s += '0' + int(val % 10); val /= 10; } if (negative) s += "-"; reverse(all(s)); if (len(s) == 0) s = "0"; write(s); } struct Dummy { Dummy() { atexit(flush); } } dummy; void print() { fastio::write('\n'); } template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) { fastio::write(head); if (sizeof...(Tail)) fastio::write(' '); print(forward<Tail>(tail)...); } } // namespace fastio using fastio::read; using fastio::print; #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ read(name) #define VV(type, name, h, w) \ vector<vector<type>> name(h, vector<type>(w)); \ read(name) void YES(bool t = 1) { print<string>(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print<string>(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print<string>(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 3 "main.cpp" void solve() { vc<pi> XY; ll MAX = 1400; FOR(x, 1, MAX + 1) FOR(y, 0, MAX - x + 1) { if (gcd(x, y) > 1) continue; XY.eb(x, y); XY.eb(-y, x); } using Re = long double; vc<Re> T; for (auto&& [x, y]: XY) T.eb(atan2(y, x)); auto I = argsort(T); XY = rearrange(XY, I); ll N = len(XY); vc<pi> points(len(XY)); FOR(i, N - 1) { XY[i + 1].fi += XY[i].fi; XY[i + 1].se += XY[i].se; } XY.resize(1'000'000); N = len(XY); FOR(j, N) { int i = (j == 0 ? N - 1 : j - 1); int k = (j == N - 1 ? 0 : j + 1); ll a = XY[j].fi - XY[i].fi; ll b = XY[j].se - XY[i].se; ll c = XY[k].fi - XY[j].fi; ll d = XY[k].se - XY[j].se; ll det = a * d - b * c; assert(det > 0); } print(N); for (auto&& p: XY) print(p); } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(15); solve(); return 0; }