結果
| 問題 |
No.283 スライドパズルと魔方陣
|
| コンテスト | |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-08-25 11:06:53 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 12,842 bytes |
| コンパイル時間 | 2,068 ms |
| コンパイル使用メモリ | 114,048 KB |
| 実行使用メモリ | 38,656 KB |
| 最終ジャッジ日時 | 2024-12-26 06:19:34 |
| 合計ジャッジ時間 | 8,748 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 13 WA * 26 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
/// <summary>
/// 転倒数の計算をBITでやる乱択
/// </summary>
public void Solve()
{
var n = sc.Integer();
if (n == 2)
IO.Printer.Out.WriteLine("impossible");
else
{
IO.Printer.Out.WriteLine("possible");
var mat = Enumerate(n, x => sc.Integer(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (mat[i][j] == 0) mat[i][j] = n * n;
var sq = MagicSquare.Create(n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (sq.mat[i][j] == n * n) { dist = (n - (i + 1) + n - (j + 1)); row = i; break; }
var p = Check(mat);
var rand = new Random();
var cnt = 0;
while (Check(sq.mat) != p)
{
var x = rand.Next() % n;
var y = rand.Next() % n;
if (x == row)
{
dist += x;dist -= y;
row = y;
}
Swap(ref sq.mat[x], ref sq.mat[y]);
cnt++;
}
foreach (var a in sq.mat)
IO.Printer.Out.WriteLine(a.AsJoinedString());
Debug.WriteLine(cnt);
}
}
static int dist;
static int row;
static public int Check(int[][] mat)
{
return MathEx.GetInversion(mat) % 2 == dist % 2 ? 0 : 1;
}
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 MagicScuare
public class MagicSquare
{
public int[][] mat;
MagicSquare(int n)
{
mat = new int[n][];
for (int i = 0; i < n; i++)
mat[i] = new int[n];
}
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
static public MagicSquare Create(int n, int x, int y, int v)
{
var sq = MagicSquare.Create(n);
var p = -1;
var q = -1;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (sq.mat[i][j] == v) { p = i; q = j; }
var sum = n * (n * n + 1) / 2;
Swap(ref sq.mat[y], ref sq.mat[p]);
for (int i = 0; i < n; i++)
Swap(ref sq.mat[i][x], ref sq.mat[i][q]);
var rand = new Random();
while (true)
{
var rc = rand.Next() % 2;
var r = rand.Next() % n;
var c = rand.Next() % n;
if (rc == 0)
{
if (r == y || c == y)
continue;
Swap(ref sq.mat[r], ref sq.mat[c]);
}
else
{
if (r == x || c == x)
continue;
for (int t = 0; t < n; t++)
Swap(ref sq.mat[t][r], ref sq.mat[t][c]);
}
var e = 0;
var f = 0;
for (int t = 0; t < n; t++)
{
e += sq.mat[t][t];
f += sq.mat[t][n - 1 - t];
}
if (e == sum && f == sum)
return sq;
}
}
static public MagicSquare Create(int n)
{
var ans = new MagicSquare(n);
if (n % 2 == 1)
{
var mat = ans.mat;
var cnt = 1;
var p = n / 2;
var q = 0;
while (cnt <= n * n)
{
mat[q][p] = cnt++;
if (mat[(q + n - 1) % n][(p + 1) % n] == 0)
{
p = (p + 1) % n;
q = (q + n - 1) % n;
}
else
q = (q + 1) % n;
}
}
else if (n % 4 == 0)
{
var mat = ans.mat;
var q = new Queue<int>();
for (int i = 0; i < n; i += 4)
{
for (int j = 0; j < n; j += 4)
{
mat[i][j] = (i * n + j) + 1;
mat[i][j + 3] = (i * n + j + 3) + 1;
}
for (int j = 0; j < n; j += 4)
{
mat[i + 1][j + 1] = ((i + 1) * n + j + 1) + 1;
mat[i + 1][j + 2] = ((i + 1) * n + j + 2) + 1;
}
for (int j = 0; j < n; j += 4)
{
mat[i + 2][j + 1] = ((i + 2) * n + j + 1) + 1;
mat[i + 2][j + 2] = ((i + 2) * n + j + 2) + 1;
}
for (int j = 0; j < n; j += 4)
{
mat[i + 3][j] = ((i + 3) * n + j) + 1;
mat[i + 3][j + 3] = ((i + 3) * n + j + 3) + 1;
}
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (mat[i][j] == 0) q.Enqueue(i * n + j + 1);
for (int i = n - 1; i >= 0; i--)
for (int j = n - 1; j >= 0; j--)
if (mat[i][j] == 0) mat[i][j] = q.Dequeue();
}
else
{
var mat = ans.mat;
var mini = MagicSquare.Create(n / 2);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
mat[i][j] += (mini.mat[i / 2][j / 2] - 1) << 2;
for (int i = 0; i < n / 2; i++)
for (int j = 0; j < n / 2; j++)
{
//Debug.Write(string.Format("{0} {1}", i, j));
if (i > (n / 2 + 1) / 2)
{
//Debug.WriteLine(" X");
mat[i * 2][j * 2] += 1;
mat[i * 2][j * 2 + 1] += 4;
mat[i * 2 + 1][j * 2] += 3;
mat[i * 2 + 1][j * 2 + 1] += 2;
}
else if ((i == (n / 2 + 1) / 2 && j != n / 4) || (i == (n / 2 + 1) / 2 - 1 && j == n / 4))
{
//Debug.WriteLine(" U");
mat[i * 2][j * 2] += 1;
mat[i * 2][j * 2 + 1] += 4;
mat[i * 2 + 1][j * 2] += 2;
mat[i * 2 + 1][j * 2 + 1] += 3;
}
else
{
//Debug.WriteLine(" L");
mat[i * 2][j * 2] += 4;
mat[i * 2][j * 2 + 1] += 1;
mat[i * 2 + 1][j * 2] += 2;
mat[i * 2 + 1][j * 2 + 1] += 3;
}
}
}
return ans;
}
}
#endregion
#region Inversion
public static partial class MathEx
{
public static long GetInversion(this int[][] a)
{
var n = a.Length;
long ret = 0;
var b = new List<long>() { long.MinValue };
foreach (var x in a)
foreach (var y in x)
b.Add(y);
b.Sort();
var bit = new FenwickTree(b.Count);
foreach (var x in a)
foreach (var y in x)
{
var p = b.BinarySearch(y);
bit.Add(p + 1, 1);
}
foreach (var x in a)
foreach (var y in x)
{
var p = b.BinarySearch(y);
ret += bit[p];
bit.Add(p, -1);
}
return ret;
}
}
#endregion
#region FenwickTree
[System.Diagnostics.DebuggerDisplay("Data={ToString()}")]
public class FenwickTree
{
int n;
long[] bit;
int max = 1;
public FenwickTree(int size)
{
n = size; bit = new long[n + 1];
while ((max << 1) <= n) max <<= 1;
}
/// <summary>sum[a,b]</summary>
public long this[int i, int j] { get { return this[j] - this[i - 1]; } }
/// <summary>sum[0,i]</summary>
public long this[int i] { get { long s = 0; for (; i > 0; i -= i & -i) s += bit[i]; return s; } }
public int LowerBound(long w)
{
if (w <= 0) return 0;
int x = 0;
for (int k = max; k > 0; k >>= 1)
if (x + k <= n && bit[x + k] < w)
{
w -= bit[x + k];
x += k;
}
return x + 1;
}
/// <summary>add v to bit[i]</summary>
public void Add(int i, long v)
{
if (i == 0) System.Diagnostics.Debug.Fail("BIT is 1 indexed");
for (; i <= n; i += i & -i) bit[i] += v;
}
public override string ToString() { return string.Join(",", Enumerable.Range(0, n + 1).Select(i => this[i, i])); }
}
#endregion