#104215 (C#(csc)) No.397 NO MORE KADOMATSU

提出ソース

結果

問題	No.397 NO MORE KADOMATSU
ユーザー	りあん
提出日時	2016-07-16 00:19:53
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	59 ms / 2,000 ms
コード長	7,704 bytes
コンパイル時間	1,005 ms
コンパイル使用メモリ	118,064 KB
実行使用メモリ	44,096 KB
平均クエリ数	29.11
最終ジャッジ日時	2024-07-17 00:09:39
合計ジャッジ時間	3,312 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	59 ms 41,812 KB
testcase_01	AC	56 ms 43,968 KB
testcase_02	AC	57 ms 41,880 KB
testcase_03	AC	56 ms 42,312 KB
testcase_04	AC	56 ms 41,732 KB
testcase_05	AC	57 ms 43,976 KB
testcase_06	AC	57 ms 41,848 KB
testcase_07	AC	57 ms 41,808 KB
testcase_08	AC	56 ms 43,960 KB
testcase_09	AC	56 ms 43,468 KB
testcase_10	AC	54 ms 40,076 KB
testcase_11	AC	56 ms 41,848 KB
testcase_12	AC	57 ms 41,556 KB
testcase_13	AC	58 ms 44,096 KB
testcase_14	AC	57 ms 44,092 KB
testcase_15	AC	57 ms 43,848 KB
testcase_16	AC	55 ms 41,684 KB
testcase_17	AC	55 ms 43,724 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        int n = sc.Int;
        var a = sc.IntArr;
        var tmp = copy(a);
        var ans = new List<int[]>();
        var ans1 = new List<int[]>();
        for (int i = 0; i < n; i++)
        {
            int min = a[i], minid = i;
            for (int j = i + 1; j < n; j++)
            {
                if (a[j] <= min)
                {
                    min = a[j];
                    minid = j;
                }
            }
            if (min < a[i])
            {
                int t = a[i];
                a[i] = a[minid];
                a[minid] = t;
                ans.Add(new int[]{i, minid});
            }
        }
        a = copy(tmp);
        for (int i = 0; i < n; i++)
        {
            int max = a[i], maxid = i;
            for (int j = i + 1; j < n; j++)
            {
                if (a[j] >= max)
                {
                    max = a[j];
                    maxid = j;
                }
            }
            if (max > a[i])
            {
                int t = a[i];
                a[i] = a[maxid];
                a[maxid] = t;
                ans1.Add(new int[]{i, maxid});
            }
        }
        ans = (ans1.Count < ans.Count) ? ans1 : ans;
        ans1 = new List<int[]>();
        a = copy(tmp);
        for (int i = n - 1; i >= 0; i--)
        {
            int min = a[i], minid = i;
            for (int j = i - 1; j >= 0; j--)
            {
                if (a[j] <= min)
                {
                    min = a[j];
                    minid = j;
                }
            }
            if (min < a[i])
            {
                int t = a[i];
                a[i] = a[minid];
                a[minid] = t;
                ans1.Add(new int[]{i, minid});
            }
        }
        ans = (ans1.Count < ans.Count) ? ans1 : ans;
        ans1 = new List<int[]>();
        a = copy(tmp);
        for (int i = n - 1; i >= 0; i--)
        {
            int max = a[i], maxid = i;
            for (int j = i - 1; j >= 0; j--)
            {
                if (a[j] >= max)
                {
                    max = a[j];
                    maxid = j;
                }
            }
            if (max > a[i])
            {
                int t = a[i];
                a[i] = a[maxid];
                a[maxid] = t;
                ans1.Add(new int[]{i, maxid});
            }
        }
        ans = (ans1.Count < ans.Count) ? ans1 : ans;
        
        sw.WriteLine(ans.Count);
        foreach (var item in ans)
        {
            sw.WriteLine(string.Join(" ", item));
        }

        sw.Flush();
    }
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }

    static T[] copy<T>(T[] a)
    {
        var ret = new T[a.Length];
        for (int i = 0; i < a.Length; i++) ret[i] = a[i];
        return ret;
    }
    static T[][] copy2<T>(T[][] a)
    {
        var ret = new T[a.Length][];
        for (int i = 0; i < a.Length; i++)
        {
            ret[i] = new T[a[0].Length];
            for (int j = 0; j < a[0].Length; j++) ret[i][j] = a[i][j];
        }
        return ret;
    }
}
class Scan
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public double Double { get { return double.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public long[][] powmat(long[][] A, long n, int M)
    {
        var E = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            E[i] = new long[A.Length];
            E[i][i] = 1;
        }
        if (n == 0) return E;
        var t = powmat(A, n / 2, M);
        if ((n & 1) == 0) return mulmat(t, t, M);
        return mulmat(mulmat(t, t, M), A, M);
    }
    public long[] mulmat(long[][] A, long[] x, int M)
    {
        var ans = new long[A.Length];
        for (int i = 0; i < A.Length; i++) for (int j = 0; j < x.Length; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % M;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B, int M)
    {
        var ans = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            ans[i] = new long[B[0].Length];
            for (int j = 0; j < B[0].Length; j++) for (int k = 0; k < B.Length; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
        }
        return ans;
    }
    public long powmod(long a, long b, long M)
    {
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2, M);
        if ((b & 1) == 0) return t * t % M;
        return t * t % M * a % M;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(long a, long b) { return a * (b / gcd(a, b)); }
    public long Comb(int n, int r)
    {
        const int M = 1000000007;
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % M;
        return result;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード