結果
問題 | No.5007 Steiner Space Travel |
ユーザー |
👑 ![]() |
提出日時 | 2023-04-29 19:03:53 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 7,691 bytes |
コンパイル時間 | 2,750 ms |
コンパイル使用メモリ | 211,756 KB |
実行使用メモリ | 4,376 KB |
スコア | 4,912,704 |
最終ジャッジ日時 | 2023-04-29 19:03:58 |
合計ジャッジ時間 | 4,671 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge16 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;#ifdef MY_DEBUG#define dbg(...) debug_out(__VA_ARGS__)#define dbgn(var) debug_out(#var, "=", var)#else#define dbg(...)#define dbgn(...)#endifvoid debug_out();template <class Head, class... Tail> void debug_out(Head, Tail...);template <class T> bool chmax(T&, const T&);template <class T> bool chmin(T&, const T&);template <class T> T pwr(T, ll);template <class T> T squ(T x) { return x * x; }ll fact(ll);ll comb(ll, ll);ll ctoll(char);char lltoc(ll);bool flg(ll b, ll i) { return ((b) >> (i)) & 1LL; } // flg(0b010, 1LL) -> trueconst ll LINF = (ll)1e18 + 7;const double EPS = 1e-9;const int MAX_DUBUG_SIZE = 10;// 二次元の座標を表す構造体struct Point {ll x, y;ll id;bool operator==(const Point& other) const { return x == other.x && y == other.y && id == other.id; }};double dist(Point p1, Point p2) { return hypot(p1.x - p2.x, p1.y - p2.y); }// 一番近い頂点を探すPoint find_nearest_point(Point p, vector<Point> points) {double min_dist = (double)LINF;Point nearest_point;for (auto&& point : points) {double d = dist(p, point);if (d < min_dist) {min_dist = d;nearest_point = point;}}return nearest_point;}void solve([[maybe_unused]] int test) {ll n, m;cin >> n >> m;vector<ll> a(n), b(n);vector<Point> points(n);for (ll i = 0; i < n; i++) {cin >> a[i] >> b[i];points[i] = {a[i], b[i], i + 1};} // Aren't they one line?vector<ll> c(m), d(m);// まだ訪れていない頂点の集合vector<Point> points_not_visited = points;// 訪れる頂点の順番vector<Point> order;order.push_back(points[0]);points_not_visited.erase(find(points_not_visited.begin(), points_not_visited.end(), points[0]));for (ll i = 0; i < n - 1; i++) {Point now_point = order.back();Point next_point = find_nearest_point(now_point, points_not_visited);order.push_back(next_point);points_not_visited.erase(find(points_not_visited.begin(), points_not_visited.end(), next_point));}order.push_back(points[0]);for (ll i = 0; i < m; i++) {c[i] = order[n - 1 - i].x;d[i] = order[n - 1 - i].y;}for (ll i = 0; i < m; i++) {cout << c[i] << " " << d[i] << "\n";}cout << order.size() + 17 << "\n";for (ll i = 0; i < (ll)order.size(); i++) {if (i < (ll)order.size() - 8) {cout << 1 << " " << order[i].id << "\n";}else {cout << 2 << " " << (ll)order.size() - i << "\n";cout << 1 << " " << order[i].id << "\n";cout << 2 << " " << (ll)order.size() - i << "\n";}}cout << 1 << " " << order[0].id << "\n";}int main() {cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12);int testcase_size = 1;// cin >> testcase_size;for (int _t = 0; _t < testcase_size; _t++) {solve(_t);}}/*-----------------------------------MY_FUNCTIONS------------------------------------ */template <class First, class Second> ostream& operator<<(ostream& os, const pair<First, Second>& pp) {return os << "{" << pp.first << "," << pp.second << "}";}template <class T> ostream& operator<<(ostream& os, const vector<T>& V) {if (V.empty()) return os << "[]";os << "[";for (ll i = 0; i < (ll)V.size(); i++) {os << V[i] << (i == int(V.size() - 1) ? "]" : ",");}return os;}template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& VV) {if (VV.empty()) return os << "[[]]";os << "[\n";for (auto&& V : VV) {os << V << "\n";}os << "]";return os;}template <class T> ostream& operator<<(ostream& os, const vector<vector<vector<T>>>& VVV) {if (VVV.empty()) return os << "[[[]]]";os << "["<< "\n";int cnt = 0;for (auto&& VV : VVV) {os << cnt++ << VV << "\n\n";}os << "]";return os;}template <class T> ostream& operator<<(ostream& os, const set<T>& SS) {if (SS.empty()) return os << "[]";os << "[";auto ii = SS.begin();for (; ii != SS.end(); ii++) os << *ii << (ii == prev(SS.end()) ? "]" : ",");return os;}template <class Key, class Tp> ostream& operator<<(ostream& os, const map<Key, Tp>& MM) {if (MM.empty()) return os << "[{:}]";os << "[";auto ii = MM.begin();for (; ii != MM.end(); ii++)os << "{" << ii->first << ":" << ii->second << "}" << (ii == prev(MM.end()) ? "]" : ",");return os;}void debug_out() { cerr << endl; }void debug_out_vl(vector<ll> V) {const int MAX_SIZE = min((int)V.size(), MAX_DUBUG_SIZE);cerr << "\033[33m";if (V.empty()) {cerr << "[]" << endl;return;}cerr << "[";for (int i = 0; i < MAX_SIZE; i++) {if (V[i] == LINF)cerr << "INF";elsecerr << V[i];if (i == (int)V.size() - 1)cerr << "]\n";else if (i == MAX_DUBUG_SIZE - 1)cerr << ",...\n";elsecerr << ",";}return;}void debug_out_vvl(vector<vector<ll>> VV) {cerr << "\033[33m";if (VV.empty()) {cerr << "[[]]" << endl;return;}cerr << "[\n";int MAX_ROW = min((int)VV.size(), MAX_DUBUG_SIZE);for (int i = 0; i < MAX_ROW; i++) {const int MAX_COLUMN = min((int)VV[i].size(), MAX_DUBUG_SIZE);if (VV[i].empty()) {cerr << "[]" << endl;continue;}cerr << "[";for (int j = 0; j < MAX_COLUMN; j++) {if (VV[i][j] == LINF)cerr << "INF";elsecerr << VV[i][j];if (j == (int)VV[i].size() - 1)cerr << "]\n";else if (j == MAX_DUBUG_SIZE - 1)cerr << ",...\n";elsecerr << ",";}if (i != (int)VV.size() - 1 and i == MAX_DUBUG_SIZE - 1) {cerr << ":\n:\033[m\n";return;}}cerr << "]\033[m\n";return;}template <class Head, class... Tail> void debug_out(Head H, Tail... T) {if constexpr (std::is_same_v<Head, vector<ll>>) {debug_out_vl(H);}else if constexpr (std::is_same_v<Head, vector<vector<ll>>>) {debug_out_vvl(H);}else {cerr << "\033[33m" << H << "\033[m ";}debug_out(T...);}template <class T> bool chmax(T& a, const T& b) {if (a < b) {a = b;return true;}return false;}template <class T> bool chmin(T& a, const T& b) {if (b < a) {a = b;return true;}return false;}template <class T> T pwr(T x, ll n) {T res = 1;for (int i = 0; i < n; i++) {res *= x;}return res;}ll fact(ll n) {ll res = 1;for (ll i = 1; i <= n; i++) res *= i;return res;}ll comb(ll n, ll r) { // comb(60, 30)までオーバーフローなしll res = 1;for (int i = 1; i <= r; i++) {res *= n--;res /= i;}return res;}ll ctoll(char c) {if (c < '0' or '9' < c) {cerr << "\n\033[33m ctoll に '0'~'9' 以外の文字が入りました.\033[m\n" << endl;}return ll(c - '0');}char lltoc(ll n) {if (n < 0 or 9 < n) {cerr << "\n\033[33m lltoc に 0 ~ 9 以外の数字が入りました.\033[m\n" << endl;}return char(n + '0');}