結果
問題 | No.566 だいたい完全二分木 |
ユーザー |
![]() |
提出日時 | 2017-09-08 23:48:43 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,565 bytes |
コンパイル時間 | 5,518 ms |
コンパイル使用メモリ | 109,440 KB |
実行使用メモリ | 21,368 KB |
最終ジャッジ日時 | 2024-11-08 17:25:33 |
合計ジャッジ時間 | 4,381 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 WA * 1 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections;using System.Collections.Generic;using System.IO;using System.Linq;using System.Numerics;using System.Text;using static System.Console;using static System.Convert;using static System.Math;using static Extentions;class IO{int idx;string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" },StringSplitOptions.RemoveEmptyEntries);T Get<T>(Func<string, T> parser) => parser(input[idx++]);public string S => Get(s => s);public char C => Get(char.Parse);public int I => Get(int.Parse);public long L => Get(long.Parse);public double F => Get(double.Parse);public decimal D => Get(decimal.Parse);public BigInteger B => Get(BigInteger.Parse);T[] Gets<T>(int n, Func<string, T> parser)=> input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();public string[] Ss(int n) => Gets(n, s => s);public char[] Cs(int n) => Gets(n, char.Parse);public int[] Is(int n) => Gets(n, int.Parse);public long[] Ls(int n) => Gets(n, long.Parse);public double[] Fs(int n) => Gets(n, double.Parse);public decimal[] Ds(int n) => Gets(n, decimal.Parse);public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));}#region Librarystatic class Extentions{public static void Swap<T>(ref T x, ref T y){var tmp = x;x = y;y = tmp;}}#endregionstatic class Program{public static void Main(){var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };#if DEBUGsw.AutoFlush = true;#elsesw.AutoFlush = false;#endifSetOut(sw);Solve(new IO());Out.Flush();}static IEnumerable<int> Sort(int[] col){if (col.Length == 0) return Enumerable.Empty<int>();var len = col.Length / 2;var a = new int[len];var b = new int[len];Array.Copy(col, 0, a, 0, len);Array.Copy(col, len + 1, b, 0, len);return new[] { col[len] }.Concat(Sort(a)).Concat(Sort(b));}static void Solve(IO io){var k = io.I;var len = (1 << k) - 1;var arr = Sort(Enumerable.Range(1, len).ToArray()).ToArray();var rand = new Random();for (var i = 0; i < k; i++)Swap(ref arr[rand.Next(len)], ref arr[rand.Next(len)]);io.Write(arr);}}