結果
| 問題 | No.270 next_permutation (1) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-08-21 23:46:25 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 42 ms / 2,000 ms |
| コード長 | 6,125 bytes |
| コンパイル時間 | 1,985 ms |
| コンパイル使用メモリ | 110,464 KB |
| 実行使用メモリ | 21,888 KB |
| 最終ジャッジ日時 | 2024-05-10 05:00:13 |
| 合計ジャッジ時間 | 2,247 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 23 ms
17,536 KB |
| testcase_01 | AC | 31 ms
21,888 KB |
| testcase_02 | AC | 29 ms
19,200 KB |
| testcase_03 | AC | 22 ms
17,664 KB |
| testcase_04 | AC | 27 ms
17,664 KB |
| testcase_05 | AC | 27 ms
17,664 KB |
| testcase_06 | AC | 25 ms
17,664 KB |
| testcase_07 | AC | 24 ms
17,408 KB |
| testcase_08 | AC | 24 ms
17,408 KB |
| testcase_09 | AC | 25 ms
17,664 KB |
| testcase_10 | AC | 39 ms
17,664 KB |
| testcase_11 | AC | 42 ms
17,792 KB |
| testcase_12 | AC | 42 ms
17,792 KB |
| testcase_13 | AC | 38 ms
17,540 KB |
| testcase_14 | AC | 39 ms
17,664 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.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using static System.Linq.Enumerable;
using static System.Math;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var k = sc.Integer();
var p = sc.Integer(n);
var b = sc.Integer(n);
var zero = 0;
for (int i = 0; i < n; i++)
zero += Abs(i + 1 - b[i]);
MathEx.init(p, b);
for (int i = 0; i < k; i++)
{
MathEx.sum += MathEx.cur;
if (p.NextPermutation(b, 0, n) == false)
{
MathEx.cur = zero;
Array.Sort(p);
}
}
IO.Printer.Out.WriteLine(MathEx.sum);
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
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 * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
#endregion
#region next_permutation
static public partial class MathEx
{
public static long sum = 0;
public static long cur = 0;
static public void init(this int[] a, int[] b)
{
for (int i = 0; i < a.Length; i++)
cur += Abs(a[i] - b[i]);
}
static public bool NextPermutation(this int[] array, int[] b, int first, int last)
{
if (first == last)
return false;
var i = last;
if (--i == first)
return false;
while (true)
{
var ii = i--;
if (array[i].CompareTo(array[ii]) < 0)
{
var j = last;
while (array[i].CompareTo(array[--j]) >= 0) { }
for (int t = i; t < last; t++)
cur -= Abs(array[t] - b[t]);
var temp = array[i];
array[i] = array[j];
array[j] = temp;
Array.Reverse(array, ii, last - ii);
for (int t = i; t < last; t++)
cur += Abs(array[t] - b[t]);
return true;
}
if (i == first)
{
Array.Reverse(array, first, last - first);
return false;
}
}
}
}
#endregion