結果
問題 | No.5007 Steiner Space Travel |
ユーザー |
![]() |
提出日時 | 2022-07-30 16:23:01 |
言語 | C# (.NET 8.0.404) |
結果 |
AC
|
実行時間 | 654 ms / 1,000 ms |
コード長 | 15,461 bytes |
コンパイル時間 | 6,911 ms |
実行使用メモリ | 175,112 KB |
スコア | 6,338,405 |
最終ジャッジ日時 | 2022-07-30 16:23:31 |
合計ジャッジ時間 | 29,130 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
コンパイルメッセージ
Determining projects to restore... Restored /home/judge/data/code/main.csproj (in 109 ms). .NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f Copyright (C) Microsoft Corporation.All rights reserved. プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください main -> /home/judge/data/code/bin/Release/net6.0/main.dll main -> /home/judge/data/code/bin/Release/net6.0/publish/
ソースコード
using System;using System.Collections.Generic;using System.IO;using System.Linq;using static System.Math;using System.Text;using System.Threading;using System.Globalization;using System.Runtime.CompilerServices;using System.Runtime.InteropServices;using Library;namespace Program{public static class ProblemA{static bool SAIKI = false;static public int numberOfRandomCases = 0;static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker){}static public void Solve(){var startTime = DateTime.Now;var N = (int)NN;var M = (int)NN;(int x, int y)[] ab = Repeat(0, N).Select(_ => ((int)NN, (int)NN)).Concat(Repeat(0, M).Select(_ => (0, 0))).ToArray();var A = 5;Func<int, int, long> calcDist = (f, t) =>{var fromX = 0;var fromY = 0;var toX = 0;var toY = 0;var fromCoef = 1L;var toCoef = 1L;if (f > N){fromX = ab[f + N - 1].x;fromY = ab[f + N - 1].y;}else{fromX = ab[f - 1].x;fromY = ab[f - 1].y;fromCoef = A;}if (t > N){toX = ab[t + N - 1].x;toY = ab[t + N - 1].y;}else{toX = ab[t - 1].x;toY = ab[t - 1].y;toCoef = A;}return fromCoef * toCoef * ((fromX - toX) * (fromX - toX) + (fromY - toY) * (fromY - toY));};var grid = new int[1001, 1001];var pathList = new List<(int from, int to)>();for (var i = 0; i < N; ++i){grid[ab[i].x, ab[i].y] = i + 1;}var score = 0L;{var done = new bool[N + 1];var from = 1;done[from] = true;for (var i = 1; i < N; ++i){var minDist = long.MaxValue;var minNum = 0;for (var j = 1; j <= N; ++j){if (done[j]) continue;if (minDist.Chmin(calcDist(from, j))){minNum = j;}}score += minDist;pathList.Add((from, minNum));from = minNum;done[from] = true;}score += calcDist(from, 1);pathList.Add((from, 1));}var hasEdge = ab.Select(_ =>{var ret = new int[2];ret[0] = ret[1] = -1;return ret;}).ToArray();for (var i = 0; i < pathList.Count; ++i){if (hasEdge[pathList[i].from - 1][0] == -1) hasEdge[pathList[i].from - 1][0] = i;else hasEdge[pathList[i].from - 1][1] = i;if (hasEdge[pathList[i].to - 1][0] == -1) hasEdge[pathList[i].to - 1][0] = i;else hasEdge[pathList[i].to - 1][1] = i;}while ((DateTime.Now - startTime).TotalMilliseconds < 600){var p1 = (int)(xorshift % pathList.Count);var p2 = (int)(xorshift % (pathList.Count - 1));if (p2 >= p1) ++p2;if (pathList[p1].from == pathList[p2].from || pathList[p1].from == pathList[p2].to ||pathList[p1].to == pathList[p2].from || pathList[p1].to == pathList[p2].to){continue;}var goal = 0;{var from = pathList[p1].from;goal = pathList[p1].to;while (true){if (goal == pathList[p2].from || goal == pathList[p2].to) break;var to = 0;var pos1 = pathList[hasEdge[goal - 1][0]];var pos2 = pathList[hasEdge[goal - 1][1]];if (pos1.from == from || pos1.to == from){if (pos2.from == goal) to = pos2.to;else to = pos2.from;}else{if (pos1.from == goal) to = pos1.to;else to = pos1.from;}from = goal;goal = to;}}var newScore = score;newScore -= calcDist(pathList[p1].from, pathList[p1].to);newScore -= calcDist(pathList[p2].from, pathList[p2].to);if (goal == pathList[p2].from){newScore += calcDist(pathList[p1].from, pathList[p2].from);newScore += calcDist(pathList[p2].to, pathList[p1].to);if (newScore < score){score = newScore;if (hasEdge[pathList[p1].to - 1][0] == p1){hasEdge[pathList[p1].to - 1][0] = p2;}else{hasEdge[pathList[p1].to - 1][1] = p2;}if (hasEdge[pathList[p2].from - 1][0] == p2){hasEdge[pathList[p2].from - 1][0] = p1;}else{hasEdge[pathList[p2].from - 1][1] = p1;}var newp1 = (pathList[p1].from, pathList[p2].from);var newp2 = (pathList[p2].to, pathList[p1].to);pathList[p1] = newp1;pathList[p2] = newp2;}}else{newScore += calcDist(pathList[p1].from, pathList[p2].to);newScore += calcDist(pathList[p2].from, pathList[p1].to);if (newScore < score){score = newScore;if (hasEdge[pathList[p1].to - 1][0] == p1){hasEdge[pathList[p1].to - 1][0] = p2;}else{hasEdge[pathList[p1].to - 1][1] = p2;}if (hasEdge[pathList[p2].to - 1][0] == p2){hasEdge[pathList[p2].to - 1][0] = p1;}else{hasEdge[pathList[p2].to - 1][1] = p1;}var newp1 = (pathList[p1].from, pathList[p2].to);var newp2 = (pathList[p2].from, pathList[p1].to);pathList[p1] = newp1;pathList[p2] = newp2;}}}{for (var i = 0; i < M; ++i){Console.WriteLine($"{ab[i + N].x} {ab[i + N].y}");}Console.WriteLine(pathList.Count + 1);var from = -1;var now = 1;Console.WriteLine($"1 1");for (var i = 0; i < pathList.Count; ++i){var to = 0;var p1 = pathList[hasEdge[now - 1][0]];var p2 = pathList[hasEdge[now - 1][1]];if (p1.from == from || p1.to == from){if (p2.from == now) to = p2.to;else to = p2.from;}else{if (p1.from == now) to = p1.to;else to = p1.from;}from = now;now = to;Console.WriteLine($"1 {now}");}}}class Printer : StreamWriter{public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }}static LIB_FastIO fastio = new LIB_FastIODebug();static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }static long NN => fastio.Long();static double ND => fastio.Double();static string NS => fastio.Scan();static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }static IEnumerator<uint> _xsi = _xsc();static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true){ var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } returnfalse; }static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } returnfalse; }static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);}}namespace Library {class LIB_FastIO{[MethodImpl(MethodImplOptions.AggressiveInlining)]public LIB_FastIO() { str = Console.OpenStandardInput(); }readonly Stream str;readonly byte[] buf = new byte[2048];int len, ptr;[MethodImpl(MethodImplOptions.AggressiveInlining)]byte read(){if (ptr >= len){ptr = 0;if ((len = str.Read(buf, 0, 2048)) <= 0){return 0;}}return buf[ptr++];}[MethodImpl(MethodImplOptions.AggressiveInlining)]char Char(){byte b = 0;do b = read();while (b < 33 || 126 < b);return (char)b;}[MethodImpl(MethodImplOptions.AggressiveInlining)]virtual public string Scan(){var sb = new StringBuilder();for (var b = Char(); b >= 33 && b <= 126; b = (char)read())sb.Append(b);return sb.ToString();}[MethodImpl(MethodImplOptions.AggressiveInlining)]virtual public long Long(){long ret = 0; byte b = 0; var ng = false;do b = read();while (b != '-' && (b < '0' || '9' < b));if (b == '-') { ng = true; b = read(); }for (; true; b = read()){if (b < '0' || '9' < b)return ng ? -ret : ret;else ret = (ret << 3) + (ret << 1) + b - '0';}}[MethodImpl(MethodImplOptions.AggressiveInlining)]virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }}class LIB_FastIODebug : LIB_FastIO{Queue<string> param = new Queue<string>();[MethodImpl(MethodImplOptions.AggressiveInlining)]string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue();}[MethodImpl(MethodImplOptions.AggressiveInlining)]public LIB_FastIODebug() { }[MethodImpl(MethodImplOptions.AggressiveInlining)]public override string Scan() => NextString();[MethodImpl(MethodImplOptions.AggressiveInlining)]public override long Long() => long.Parse(NextString());[MethodImpl(MethodImplOptions.AggressiveInlining)]public override double Double() => double.Parse(NextString());}}