結果
問題 | No.490 yukiソート |
ユーザー | mban |
提出日時 | 2017-03-11 19:24:49 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 65 ms / 2,000 ms |
コード長 | 2,815 bytes |
コンパイル時間 | 1,258 ms |
コンパイル使用メモリ | 112,624 KB |
実行使用メモリ | 28,112 KB |
最終ジャッジ日時 | 2024-06-24 12:36:08 |
合計ジャッジ時間 | 4,046 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
25,392 KB |
testcase_01 | AC | 32 ms
27,480 KB |
testcase_02 | AC | 31 ms
23,088 KB |
testcase_03 | AC | 32 ms
25,136 KB |
testcase_04 | AC | 37 ms
25,820 KB |
testcase_05 | AC | 37 ms
25,648 KB |
testcase_06 | AC | 37 ms
27,816 KB |
testcase_07 | AC | 37 ms
25,768 KB |
testcase_08 | AC | 37 ms
25,904 KB |
testcase_09 | AC | 37 ms
25,636 KB |
testcase_10 | AC | 36 ms
23,736 KB |
testcase_11 | AC | 37 ms
27,940 KB |
testcase_12 | AC | 37 ms
25,824 KB |
testcase_13 | AC | 37 ms
25,776 KB |
testcase_14 | AC | 64 ms
27,988 KB |
testcase_15 | AC | 64 ms
27,984 KB |
testcase_16 | AC | 64 ms
28,112 KB |
testcase_17 | AC | 64 ms
25,684 KB |
testcase_18 | AC | 65 ms
27,980 KB |
testcase_19 | AC | 65 ms
26,288 KB |
testcase_20 | AC | 65 ms
25,812 KB |
testcase_21 | AC | 64 ms
27,856 KB |
testcase_22 | AC | 65 ms
26,204 KB |
testcase_23 | AC | 63 ms
24,240 KB |
testcase_24 | AC | 32 ms
25,204 KB |
testcase_25 | AC | 32 ms
25,568 KB |
testcase_26 | AC | 33 ms
25,312 KB |
testcase_27 | AC | 32 ms
27,356 KB |
testcase_28 | AC | 32 ms
25,260 KB |
testcase_29 | AC | 33 ms
27,356 KB |
testcase_30 | AC | 33 ms
27,344 KB |
testcase_31 | AC | 33 ms
25,388 KB |
testcase_32 | AC | 34 ms
27,216 KB |
testcase_33 | AC | 33 ms
25,260 KB |
testcase_34 | AC | 33 ms
25,180 KB |
testcase_35 | AC | 32 ms
27,608 KB |
コンパイルメッセージ
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.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; using System.ComponentModel; class Program { static void Main(string[] args) { var alice = new Magatro(); alice.Scan(); alice.Solve(); } } public class Scanner { private StreamReader Sr; private string[] S; private int Index; private const char Separator = ' '; public Scanner() : this(Console.OpenStandardInput()) { Index = 0; S = new string[0]; } public Scanner(Stream source) { Sr = new StreamReader(source); } private string[] Line() { return Sr.ReadLine().Split(Separator); } public string Next() { string result; if (Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public T Next<T>() { var converter = TypeDescriptor.GetConverter(typeof(T)); return (T)converter.ConvertFromString(Next()); } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } public decimal NextDecimal() { return decimal.Parse(Next()); } public string[] StringArray(int index = 0) { Next(); Index = S.Length; return S.Skip(index).ToArray(); } public int[] IntArray(int index = 0) { return StringArray(index).Select(int.Parse).ToArray(); } public long[] LongArray(int index = 0) { return StringArray(index).Select(long.Parse).ToArray(); } public bool EndOfStream { get { return Sr.EndOfStream; } } } public class Magatro { private int N; private int[] A; public void Scan() { Scanner cin = new Scanner(); N = cin.NextInt(); A = cin.IntArray(); } public void Solve() { for (int i = 1; i < 2 * N - 3; i++) { for (int p = 0; p <= N - 1; p++) { int q = i - p; if (0 <= q && q <= N - 1) { if (p < q) { if (A[p] > A[q]) { Swap(ref A[p], ref A[q]); } } } } } Console.WriteLine(string.Join(" ", A)); } private void Swap(ref int a, ref int b) { var temp = a; a = b; b = temp; } }