結果
問題 | No.5004 Room Assignment |
ユーザー |
![]() |
提出日時 | 2021-12-01 09:58:43 |
言語 | C# (.NET 8.0.404) |
結果 |
AC
|
実行時間 | 460 ms / 5,000 ms |
コード長 | 17,344 bytes |
コンパイル時間 | 12,542 ms |
実行使用メモリ | 73,852 KB |
スコア | 112,211,002 |
平均クエリ数 | 7581.75 |
最終ジャッジ日時 | 2021-12-01 09:59:29 |
合計ジャッジ時間 | 42,560 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 100 |
コンパイルメッセージ
.NET 向け Microsoft (R) Build Engine バージョン 16.9.0+5e4b48a27 Copyright (C) Microsoft Corporation.All rights reserved. Determining projects to restore... Restored /home/judge/data/code/main.csproj (in 304 ms). main -> /home/judge/data/code/bin/Release/net5.0/linux-x64/main.dll main -> /home/judge/data/code/bin/Release/net5.0/linux-x64/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 T = NN;var R = NN;var tmp = new Dictionary<long, long>();var done = 1L;var flip = false;var lastday = 0;for (var i = 0; i < T; ++i){var N = NN;var SList = NNList(N);for (var j = 0; j < N; ++j){tmp[done + j] = SList[j];}done += N;var ans = new List<string>();if (tmp.Count >= 50 || i - lastday > 30){lastday = i;var sorted = flip ? tmp.OrderBy(e => e.Value).ToArray() : tmp.OrderByDescending(e => e.Value).ToArray();var last = 0L;var tgt = new HashSet<long>();var before = 0L;flip = !flip;foreach (var item in sorted){var bai = 0L;if (tgt.Count == 1) bai = 1;else if (tgt.Count == 2) bai = 3;else if (tgt.Count == 3) bai = 6;var dif = Abs(item.Value - last);var calc = Max(bai * (200 - dif * dif), 0);if (before <= calc){before = calc;}else{before = 0;foreach (var item2 in tgt){tmp.Remove(item2);}var tgtary = tgt.ToArray();for (var j = 1; j < tgtary.Length; ++j){ans.Add($"{tgtary[j - 1]} {tgtary[j]}");}tgt.Clear();}tgt.Add(item.Key);if (tgt.Count == 1) last = item.Value;}}Console.WriteLine(ans.Count);foreach (var item in ans){Console.WriteLine(item);}Console.Out.Flush();}{//finalvar ans = new List<string>();{var nokori = tmp.Count % 4;if (nokori == 0){var sorted = tmp.OrderBy(e => e.Value).ToArray();for (var k = 0; k < sorted.Length; k += 4){ans.Add($"{sorted[k + 0].Key} {sorted[k + 1].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 2].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 3].Key}");tmp.Remove(sorted[k + 0].Key);tmp.Remove(sorted[k + 1].Key);tmp.Remove(sorted[k + 2].Key);tmp.Remove(sorted[k + 3].Key);}}else if (nokori == 1){var minV = long.MaxValue;var removed = -1L;var hairetu = tmp.Keys.ToArray();for (var i1 = 0; i1 < hairetu.Length; ++i1){var item = hairetu[i1];var sorted = tmp.Where(e => e.Key != item).OrderBy(e => e.Value).ToArray();var tot = 0L;for (var k = 0; k < sorted.Length; k += 4){tot += sorted[k + 3].Key - sorted[k + 0].Key;}if (minV.Chmin(tot)){removed = item;}}{var sorted = tmp.Where(e => e.Key != removed).OrderBy(e => e.Value).ToArray();for (var k = 0; k < sorted.Length; k += 4){ans.Add($"{sorted[k + 0].Key} {sorted[k + 1].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 2].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 3].Key}");tmp.Remove(sorted[k + 0].Key);tmp.Remove(sorted[k + 1].Key);tmp.Remove(sorted[k + 2].Key);tmp.Remove(sorted[k + 3].Key);}}}else if (nokori == 2){var minV = long.MaxValue;var removed1 = -1L;var removed2 = -1L;var hairetu = tmp.Keys.ToArray();for (var i1 = 0; i1 < hairetu.Length; ++i1){for (var i2 = i1 + 1; i2 < hairetu.Length; ++i2){var item1 = hairetu[i1];var item2 = hairetu[i2];var sorted = tmp.Where(e => e.Key != item1 && e.Key != item2).OrderBy(e => e.Value).ToArray();var tot = 0L;for (var k = 0; k < sorted.Length; k += 4){tot += sorted[k + 3].Key - sorted[k + 0].Key;}if (minV.Chmin(tot)){removed1 = item1;removed2 = item2;}}}{var sorted = tmp.Where(e => e.Key != removed1 && e.Key != removed2).OrderBy(e => e.Value).ToArray();for (var k = 0; k < sorted.Length; k += 4){ans.Add($"{sorted[k + 0].Key} {sorted[k + 1].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 2].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 3].Key}");tmp.Remove(sorted[k + 0].Key);tmp.Remove(sorted[k + 1].Key);tmp.Remove(sorted[k + 2].Key);tmp.Remove(sorted[k + 3].Key);}}}else if (nokori == 3){var minV = long.MaxValue;var removed1 = -1L;var removed2 = -1L;var removed3 = -1L;var hairetu = tmp.Keys.ToArray();for (var i1 = 0; i1 < hairetu.Length; ++i1){for (var i2 = i1 + 1; i2 < hairetu.Length; ++i2){for (var i3 = i2 + 1; i3 < hairetu.Length; ++i3){var item1 = hairetu[i1];var item2 = hairetu[i2];var item3 = hairetu[i3];var sorted = tmp.Where(e => e.Key != item1 && e.Key != item2 && e.Key != item3).OrderBy(e => e.Value).ToArray();var tot = 0L;for (var k = 0; k < sorted.Length; k += 4){tot += sorted[k + 3].Key - sorted[k + 0].Key;}if (minV.Chmin(tot)){removed1 = item1;removed2 = item2;removed3 = item3;}}}}{var sorted = tmp.Where(e => e.Key != removed1 && e.Key != removed2 && e.Key != removed3).OrderBy(e => e.Value).ToArray();for (var k = 0; k < sorted.Length; k += 4){ans.Add($"{sorted[k + 0].Key} {sorted[k + 1].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 2].Key}");ans.Add($"{sorted[k + 0].Key} {sorted[k + 3].Key}");tmp.Remove(sorted[k + 0].Key);tmp.Remove(sorted[k + 1].Key);tmp.Remove(sorted[k + 2].Key);tmp.Remove(sorted[k + 3].Key);}}}}{var sorted = tmp.OrderBy(e => e.Value).ToArray();for (var i = 1; i < sorted.Length; ++i){ans.Add($"{sorted[i - 1].Key} {sorted[i].Key}");}}Console.WriteLine(ans.Count);foreach (var item in ans){Console.WriteLine(item);}Console.Out.Flush();}}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());}}