結果

問題 No.5004 Room Assignment
ユーザー yupiteru_kunyupiteru_kun
提出日時 2021-12-01 02:44:24
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 262 ms / 5,000 ms
コード長 16,492 bytes
コンパイル時間 9,393 ms
実行使用メモリ 51,636 KB
スコア 106,858,995
平均クエリ数 7650.62
最終ジャッジ日時 2021-12-01 02:45:04
合計ジャッジ時間 37,982 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 250 ms
51,164 KB
testcase_01 AC 242 ms
51,136 KB
testcase_02 AC 242 ms
51,084 KB
testcase_03 AC 241 ms
51,200 KB
testcase_04 AC 238 ms
51,024 KB
testcase_05 AC 238 ms
51,452 KB
testcase_06 AC 237 ms
51,216 KB
testcase_07 AC 247 ms
50,932 KB
testcase_08 AC 236 ms
51,276 KB
testcase_09 AC 237 ms
51,200 KB
testcase_10 AC 237 ms
50,976 KB
testcase_11 AC 240 ms
51,312 KB
testcase_12 AC 245 ms
50,996 KB
testcase_13 AC 246 ms
51,336 KB
testcase_14 AC 237 ms
51,236 KB
testcase_15 AC 234 ms
51,028 KB
testcase_16 AC 236 ms
51,296 KB
testcase_17 AC 236 ms
50,996 KB
testcase_18 AC 234 ms
50,964 KB
testcase_19 AC 243 ms
51,184 KB
testcase_20 AC 238 ms
51,212 KB
testcase_21 AC 239 ms
50,720 KB
testcase_22 AC 241 ms
51,488 KB
testcase_23 AC 240 ms
51,276 KB
testcase_24 AC 243 ms
51,180 KB
testcase_25 AC 240 ms
51,228 KB
testcase_26 AC 236 ms
51,044 KB
testcase_27 AC 236 ms
50,968 KB
testcase_28 AC 236 ms
50,908 KB
testcase_29 AC 240 ms
51,348 KB
testcase_30 AC 240 ms
51,368 KB
testcase_31 AC 249 ms
51,356 KB
testcase_32 AC 241 ms
51,516 KB
testcase_33 AC 240 ms
50,896 KB
testcase_34 AC 241 ms
51,272 KB
testcase_35 AC 241 ms
51,308 KB
testcase_36 AC 243 ms
51,260 KB
testcase_37 AC 240 ms
51,232 KB
testcase_38 AC 239 ms
51,072 KB
testcase_39 AC 242 ms
51,228 KB
testcase_40 AC 237 ms
51,284 KB
testcase_41 AC 248 ms
51,112 KB
testcase_42 AC 244 ms
51,636 KB
testcase_43 AC 236 ms
50,336 KB
testcase_44 AC 241 ms
50,844 KB
testcase_45 AC 241 ms
50,976 KB
testcase_46 AC 241 ms
50,968 KB
testcase_47 AC 242 ms
51,468 KB
testcase_48 AC 242 ms
51,168 KB
testcase_49 AC 243 ms
50,836 KB
testcase_50 AC 237 ms
51,152 KB
testcase_51 AC 236 ms
51,556 KB
testcase_52 AC 243 ms
51,624 KB
testcase_53 AC 237 ms
51,404 KB
testcase_54 AC 250 ms
51,256 KB
testcase_55 AC 236 ms
51,244 KB
testcase_56 AC 241 ms
51,372 KB
testcase_57 AC 238 ms
51,448 KB
testcase_58 AC 240 ms
51,344 KB
testcase_59 AC 240 ms
51,492 KB
testcase_60 AC 259 ms
51,480 KB
testcase_61 AC 237 ms
50,764 KB
testcase_62 AC 237 ms
51,128 KB
testcase_63 AC 237 ms
50,864 KB
testcase_64 AC 236 ms
51,216 KB
testcase_65 AC 235 ms
51,572 KB
testcase_66 AC 262 ms
51,264 KB
testcase_67 AC 237 ms
51,188 KB
testcase_68 AC 237 ms
50,880 KB
testcase_69 AC 239 ms
51,284 KB
testcase_70 AC 238 ms
51,604 KB
testcase_71 AC 244 ms
50,704 KB
testcase_72 AC 252 ms
50,660 KB
testcase_73 AC 241 ms
51,616 KB
testcase_74 AC 235 ms
51,096 KB
testcase_75 AC 239 ms
50,976 KB
testcase_76 AC 240 ms
50,928 KB
testcase_77 AC 243 ms
51,376 KB
testcase_78 AC 236 ms
51,036 KB
testcase_79 AC 236 ms
51,308 KB
testcase_80 AC 240 ms
51,412 KB
testcase_81 AC 240 ms
51,260 KB
testcase_82 AC 240 ms
51,580 KB
testcase_83 AC 236 ms
51,488 KB
testcase_84 AC 239 ms
50,808 KB
testcase_85 AC 240 ms
51,048 KB
testcase_86 AC 241 ms
51,352 KB
testcase_87 AC 240 ms
51,392 KB
testcase_88 AC 250 ms
51,588 KB
testcase_89 AC 245 ms
51,292 KB
testcase_90 AC 238 ms
51,228 KB
testcase_91 AC 235 ms
51,492 KB
testcase_92 AC 239 ms
51,108 KB
testcase_93 AC 238 ms
51,504 KB
testcase_94 AC 252 ms
51,380 KB
testcase_95 AC 237 ms
50,924 KB
testcase_96 AC 239 ms
51,320 KB
testcase_97 AC 242 ms
51,132 KB
testcase_98 AC 237 ms
51,284 KB
testcase_99 AC 238 ms
51,208 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
.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 159 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/

ソースコード

diff # 

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 || lastday - i > 1)
                {
                    lastday = i;
                    var sorted = flip ? tmp.OrderBy(e => e.Value).ToArray() : tmp.OrderByDescending(e => e.Value).ToArray();
                    for (var k = 0; k < sorted.Length - 4; 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);
                    }
                }
                Console.WriteLine(ans.Count);
                foreach (var item in ans)
                {
                    Console.WriteLine(item);
                }
                Console.Out.Flush();
            }
            {//final
                var 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; } return false; }
        static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
        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());
    }
}
0