結果
| 問題 | No.334 門松ゲーム |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-01-15 22:42:00 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 31 ms / 2,000 ms |
| コード長 | 6,507 bytes |
| コンパイル時間 | 940 ms |
| コンパイル使用メモリ | 116,792 KB |
| 実行使用メモリ | 26,996 KB |
| 最終ジャッジ日時 | 2024-09-19 19:19:05 |
| 合計ジャッジ時間 | 1,985 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 26 ms
24,804 KB |
| testcase_01 | AC | 25 ms
24,548 KB |
| testcase_02 | AC | 26 ms
23,088 KB |
| testcase_03 | AC | 26 ms
26,840 KB |
| testcase_04 | AC | 25 ms
26,856 KB |
| testcase_05 | AC | 26 ms
24,804 KB |
| testcase_06 | AC | 27 ms
24,928 KB |
| testcase_07 | AC | 27 ms
25,008 KB |
| testcase_08 | AC | 28 ms
24,936 KB |
| testcase_09 | AC | 27 ms
25,056 KB |
| testcase_10 | AC | 31 ms
26,996 KB |
| testcase_11 | AC | 27 ms
24,704 KB |
| testcase_12 | AC | 25 ms
24,928 KB |
| testcase_13 | AC | 25 ms
26,888 KB |
| testcase_14 | AC | 25 ms
25,060 KB |
| testcase_15 | AC | 27 ms
26,840 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var a = sc.Integer(n);
var dp = new int[1 << n];
for (int i = 0; i < 1 << n; i++)
dp[i] = -1;
Func<int, int> dfs = null;
dfs = (mask) =>
{
if (dp[mask] >= 0) return dp[mask];
for (int i = 0; i < n; i++)
{
if ((mask >> i & 1) == 1) continue;
for (int j = i + 1; j < n; j++)
{
if ((mask >> j & 1) == 1) continue;
for (int k = j + 1; k < n; k++)
{
if ((mask >> k & 1) == 1) continue;
if (!ISOTAKUDAIGAKU(a[i], a[j], a[k])) continue;
var nmask = mask | (1 << i) | (1 << j) | (1 << k);
if (dfs(nmask) == 0)
return dp[mask] = 1;
}
}
}
return dp[mask] = 0;
};
var otaku = dfs(0);
if (otaku == 0)
{
IO.Printer.Out.WriteLine(-1);
return;
}
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
for (int k = j + 1; k < n; k++)
{
var mask = (1 << i) | (1 << j) | (1 << k);
if (dp[mask] == 0)
{
IO.Printer.Out.WriteLine("{0} {1} {2}", i, j, k);
}
}
}
public bool ISOTAKUDAIGAKU(long l, long m, long r)
{
var a = new long[] { l, m, r };
return ISOTAKUDAIGAKU(a);
}
public bool ISOTAKUDAIGAKU(long[] a)
{
if (a.Length != 3) return false;
if (a.Distinct().Count() != 3) return false;
if (a[0] < a[1] && a[1] > a[2]) return true;
if (a[0] > a[1] && a[1] < a[2]) return true;
return false;
}
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 != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
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() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
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