結果

問題 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
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 34
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

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;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0