結果

問題 No.55 正方形を描くだけの簡単なお仕事です。
ユーザー eitaho
提出日時 2015-03-10 15:01:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 148 ms / 5,000 ms
コード長 3,460 bytes
コンパイル時間 1,125 ms
コンパイル使用メモリ 110,764 KB
実行使用メモリ 23,936 KB
最終ジャッジ日時 2024-06-24 17:03:43
合計ジャッジ時間 5,531 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Enu = System.Linq.Enumerable;
using System.Drawing;
class Program
{
    void Solve()
    {
        Point[] P = new Point[4];
        for (int i = 1; i <= 3; i++)
            P[i] = new Point(reader.Int(), reader.Int());
        for (int x = -200; x <= 200; x++)
            for (int y = -200; y <= 200; y++)
            {
                P[0] = new Point(x, y);
                if (OK(P)) { Console.WriteLine(P[0].X + " " + P[0].Y); return; }
            }
        Console.WriteLine(-1);
    }
    private bool OK(Point[] point)
    {
        int[] index = Enu.Range(1, 3).ToArray();
        Func<Point, Point, Point, bool> Valid = (a, b, c) =>
        {
            int x = -(b.Y - a.Y), y = b.X - a.X;
            return c.X - a.X == x && c.Y - a.Y == y;
        };
        do
        {
            Point[] curr = new[] { point[0], point[index[0]], point[index[1]], point[index[2]] };
            bool ok = true;
            for (int i = 0; i < 4; i++)
                if (!Valid(curr[i], curr[(i + 1) % 4], curr[(i - 1 + 4) % 4]))
                    ok = false;
            if (ok) return true;
        } while (NextPermutation(index));
        return false;
    }
    static bool NextPermutation<T>(T[] a)
    {
        Comparer<T> comp = Comparer<T>.Default;
        for (int i = a.Length - 2; i >= 0; i--)
        {
            if (comp.Compare(a[i], a[i + 1]) < 0)
            {
                int j = a.Length - 1;
                while (comp.Compare(a[i], a[j]) >= 0) { j--; }
                T tmp = a[i]; a[i] = a[j]; a[j] = tmp;
                Array.Reverse(a, i + 1, a.Length - 1 - i);
                return true;
            }
        }
        return false;
    }
    Reader reader = new Reader(Console.In);
    static void Main() { new Program().Solve(); }
}
class Reader
{
    private readonly TextReader reader;
    private readonly char[] separator = { ' ' };
    private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
    private string[] A = new string[0];
    private int i;
    public Reader(TextReader r) { reader = r; }
    public Reader(string file) { reader = new StreamReader(file); }
    public bool HasNext() { return Enqueue(); }
    public string String() { return Dequeue(); }
    public int Int() { return int.Parse(Dequeue()); }
    public long Long() { return long.Parse(Dequeue()); }
    public double Double() { return double.Parse(Dequeue()); }
    public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
    public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public string Line() { return reader.ReadLine().Trim(); }
    private string[] Split(string s) { return s.Split(separator, removeOp); }
    private bool Enqueue()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return Enqueue();
        A = Split(line);
        i = 0;
        return true;
    }
    private string Dequeue() { Enqueue(); return A[i++]; }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0