#783439 (C++17(gcc12)) No.5007 Steiner Space Travel

提出ソース
結果

問題	No.5007 Steiner Space Travel
コンテスト
ユーザー	FF256grhy
提出日時	2022-07-30 18:20:41
言語	C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
結果	AC
実行時間	952 ms / 1,000 ms
コード長	9,576 bytes
コンパイル時間	2,737 ms
実行使用メモリ	6,952 KB
スコア	6,653,762
最終ジャッジ日時	2022-07-30 18:21:15
合計ジャッジ時間	33,949 ms
ジャッジサーバーID （参考情報）	judge13 / judge9
	純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
other	AC * 30
権限があれば一括ダウンロードができます
ソースコード

raw source code
#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; }

// ---- ----

class UnionFind {
private:
	int n, s;
	vector<int> t;
	vector<vector<int>> v;
public:
	UnionFind(int nn = 0) { init(nn); }
	void init(int nn) {
		n = s = nn;
		t.clear();
		v.clear();
		inc(i, n) { t.PB(i); v.EB(1, i); }
	}
	int get_n() { return n; }
	int size() { return s; }
	int id(int x) { return t.at(x); }
	const vector<vector<int>> & get_v() { return v; }
	bool unite(int x, int y) {
		x = id(x);
		y = id(y);
		if(x == y) { return false; }
		if(v[x].size() < v[y].size()) { swap(x, y); }
		for(auto & e: v[y]) { v[x].PB(e); t[e] = x; }
		v[y].clear();
		s--;
		return true;
	}
	bool same(int x, int y) { return (id(x) == id(y)); }
	const vector<int> & operator[](int x) { return v[id(x)]; }
	friend ostream & operator<<(ostream & os, const UnionFind & uf) {
		inc(i, uf.n) { os << i << ": "; for(auto & e: uf.v[i]) { os << e << " "; } os << "\n"; }
		return os;
	}
};

// ----

class Point {
private:
	LL x, y;
	int f() { return ((x > 0 && y == 0) || y > 0 ? 0 : 1); }
public:
	Point(LL xx, LL yy) { assert(! (xx == 0 && yy == 0)); x = xx; y = yy; }
	static LL cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
	friend bool operator==(Point a, Point b) { return                    (a.f() == b.f() && 0 == cross(a, b)) ; }
	friend bool operator< (Point a, Point b) { return (a.f() <  b.f() || (a.f() == b.f() && 0 <  cross(a, b))); }
	friend bool operator<=(Point a, Point b) { return (a.f() <  b.f() || (a.f() == b.f() && 0 <= cross(a, b))); }
	Point operator-() { return Point(-x, -y); }
	Point p90()       { return Point(-y, +x); }
	Point m90()       { return Point(+y, -x); }
	LL get_x() { return x; }
	LL get_y() { return y; }
	friend ostream & operator<<(ostream & os, Point p) { return (os << p.x << " " << p.y); }
};


auto clock_0 = chrono::system_clock::now();
chrono::milliseconds TIME_LIMIT(950);

int main() {
	int IN(n, m);
	auto p = read_v<pair<int, int>>(n);
	
	auto dist2 = [](auto a, auto b) -> int {
		auto sq = [](auto x) { return x * x; };
		return sq(a.FI - b.FI) + sq(a.SE - b.SE);
	};
	
	mt19937 e(12345);
	uniform_int_distribution<int> rand(-500, +500);
	
	vector<pair<int, int>> S;
	vector<pair<int, int>> ANS;
	int SCORE = 1e9;
	
	int cnt = 0;
	while(chrono::system_clock::now() - clock_0 < TIME_LIMIT) {
		cnt++;
		vector<pair<int, int>> s(m);
		{
			vector<Point> P;
			inc(i, m) {
				int x = rand(e);
				int y = rand(e);
				if(x == 0 && y == 0) { x = 1; }
				P.EB(x, y);
			}
			ST(P);
			inc(i, m) { s[i] = { P[i].get_x() + 500, P[i].get_y() + 500 }; }
		}
		
		vector<vector<int>> v(m);
		int t = -1;
		inc(i, n) {
			pair P { 1'000'000, -1 };
			inc(j, m) { setmin(P, MP(dist2(p[i], s[j]), j)); }
			v[P.SE].PB(i);
			if(i == 0) { t = P.SE; }
		}
		
		UnionFind uf(n + m);
		vector<pair<int, int>> ans;
		inc(i_, m) {
			int i = (t + i_) % m;
			vector<array<int, 3>> E;
			v[i].PB(n + i);
			inc(x_, SI(v[i])) {
			inc(y_, x_) {
				int a = v[i][x_];
				int b = v[i][y_];
				if(x_ == SI(v[i]) - 1) {
					E.PB({  5 * dist2(s[i], p[b]), a, b });
				} else {
					E.PB({ 25 * dist2(p[a], p[b]), a, b });
				}
			}
			}
			ST(E);
			vector<vector<int>> g(n + m);
			SF(E, d_, a, b) { SC<void>(d_);
				if(uf.unite(a, b)) {
					g[a].PB(b);
					g[b].PB(a);
				}
			}
			function<void(int, int)> dfs = [&](int v, int p) {
				ans.EB(v / n + 1, v % n + 1);
				RF(w, g[v]) {
					if(w == p) { continue; }
					dfs(w, v);
					ans.EB(v / n + 1, v % n + 1);
				}
			};
			dfs(v[i][0], -1);
			ans.EB(2, (i + 1) % m + 1);
		}
		ans.EB(1, 1);
		
		
		auto SUM = [&]() -> int {
			vector<pair<int, int>> D;
			inc(i, SI(ans) - 1) {
				int t = 4 - ans[i].FI - ans[i + 1].FI;
				int d = dist2(
					(ans[i    ].FI == 1 ? p : s)[ans[i    ].SE - 1],
					(ans[i + 1].FI == 1 ? p : s)[ans[i + 1].SE - 1]
				);
				inc(tt, t) { d *= 5; }
				D.EB(d, t);
			}
			ST(D);
			// dispL(D);
			int sum = 0;
			SF(D, d, t_) { sum += d; SC<void>(t_); }
			return sum;
		};
		if(setmin(SCORE, SUM())) {
			S = s;
			ANS = ans;
		}
	}
	
	dispL(S);
	out(SI(ANS));
	dispL(ANS);
	
	// out("cnt:", cnt);
}
yukicoder

結果

ソースコード
