#210145 (C#(csc)) No.55 正方形を描くだけの簡単なお仕事です。

• 問題: No.55 正方形を描くだけの簡単なお仕事です。
• ユーザー: sekiya9311
• 提出日時: 2017-10-16 01:06:09
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 9,340 bytes
• コンパイル時間: 2,802 ms
• コンパイル使用メモリ: 114,304 KB
• 実行使用メモリ: 23,424 KB
• 最終ジャッジ日時: 2024-11-17 18:57:38
• 合計ジャッジ時間: 17,867 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	386 ms; 23,168 KB
testcase_01	AC	753 ms; 23,168 KB
testcase_02	AC	390 ms; 23,296 KB
testcase_03	AC	406 ms; 23,296 KB
testcase_04	WA	-
testcase_05	AC	787 ms; 22,912 KB
testcase_06	AC	788 ms; 23,168 KB
testcase_07	AC	778 ms; 23,168 KB
testcase_08	AC	781 ms; 23,296 KB
testcase_09	AC	776 ms; 23,168 KB
testcase_10	AC	767 ms; 23,040 KB
testcase_11	AC	273 ms; 23,296 KB
testcase_12	WA	-
testcase_13	AC	566 ms; 23,296 KB
testcase_14	AC	400 ms; 23,040 KB
testcase_15	AC	765 ms; 23,040 KB
testcase_16	AC	397 ms; 23,168 KB
testcase_17	AC	791 ms; 23,168 KB
testcase_18	AC	229 ms; 23,040 KB
testcase_19	AC	759 ms; 23,296 KB
testcase_20	AC	418 ms; 23,296 KB
testcase_21	AC	386 ms; 23,296 KB
testcase_22	AC	751 ms; 23,168 KB
testcase_23	AC	515 ms; 22,912 KB
testcase_24	AC	244 ms; 23,168 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 System.Linq;
using System.Text;

namespace ProgrammingContest
{
    class MainClass : IDisposable
    {
        Scanner sc;
        Writer wr;
        string backPath = "..";
        char dirSep = System.IO.Path.DirectorySeparatorChar;
        string inFilePath = null;
        string outFilePath = null;
        public MainClass()
        {
            this.inFilePath = this.backPath
                            + this.dirSep
                            + this.backPath
                            + this.dirSep
                            + "in.txt";
            this.outFilePath = this.backPath
                             + this.dirSep
                             + this.backPath
                             + this.dirSep
                             + "out.txt";
        }
        static void Main(string[] args)
        {
            using (var mainClass = new MainClass())
            {
                //mainClass.MakeTestCase();
                mainClass.Solve();
            }
        }

        public void Dispose()
        {
            if (this.sc != null)
            {
                this.sc.Dispose();
                this.sc = null;
            }
            if (this.wr != null)
            {
                this.wr.Dispose();
                this.wr = null;
            }
        }

        void MakeTestCase()
        {
            Random rand = new Random();
            var res = new StringBuilder();



            using (var writer = new System.IO.StreamWriter(inFilePath))
                writer.Write(res.ToString());
        }

        void Solve()
        {
            this.wr = new Writer(this.isReactive);
            //this.wr = new Writer(this.outFilePath);
#if DEBUG
            if (!this.isReactive)
                this.sc = new Scanner(this.inFilePath);
            else
                this.sc = new Scanner();
#else
            this.sc = new Scanner();
#endif
            Point[] p = new Point[4].Select(ValueType => new Point()).ToArray();
            for (int i = 0; i < 3; i++)
            {
                p[i] = new Point() { x = sc.NextInt, y = sc.NextInt };
            }
            for (int x = -222; x <= 222; x++)
            {
                for (int y = -222; y <= 222; y++)
                {
                    p[3].x = x;
                    p[3].y = y;
                    bool f = true;
                    for (int i = 0; i < 3; i++)
                    {
                        if (p[i].x == x && p[i].y == y)
                        {
                            f = false;
                        }
                    }
                    if (!f) continue;
                    int[] idx = new int[] { 0, 1, 2, 3 };
                    do
                    {
                        if (Check(p, idx))
                        {
                            wr.WriteLine(x + " " + y);
                            return;
                        }
                    } while (NextPermutation(idx));
                }
            }
            wr.WriteLine(-1);
        }
        bool Check(Point[] p, int[] idx)
        {
            int xDist = p[idx[0]].x - p[idx[1]].x;
            int yDist = p[idx[0]].y - p[idx[1]].y;
            double dist = Math.Sqrt(xDist * xDist + yDist * yDist);
            bool ret = true;
            for (int i = 0; i < 4; i++)
            {
                int xxDist = p[idx[i]].x - p[idx[(i + 1) % 4]].x;
                int yyDist = p[idx[i]].y - p[idx[(i + 1) % 4]].y;
                switch (i)
                {
                    case 0:
                        if (Math.Sign(xDist) != Math.Sign(xxDist) && Math.Sign(yDist) != Math.Sign(yyDist))
                        {
                            ret = false;
                        }
                        break;
                    case 1:
                        if (Math.Sign(xDist) != Math.Sign(yyDist) && Math.Sign(yDist) != Math.Sign(xxDist))
                        {
                            ret = false;
                        }
                        break;
                    case 2:
                        if (Math.Sign(xDist) == Math.Sign(xxDist) && Math.Sign(yDist) != Math.Sign(yyDist))
                        {
                            ret = false;
                        }
                        break;
                    case 3:
                        if (Math.Sign(xDist) == Math.Sign(yyDist) && Math.Sign(yDist) == Math.Sign(xxDist))
                        {
                            ret = false;
                        }
                        break;
                }
                double calcDist = Math.Sqrt(xxDist * xxDist + yyDist * yyDist);
                if (dist != calcDist)
                {
                    ret = false;
                }
            }
            return ret;
        }
        
        bool NextPermutation<T>(T[] ar) where T : IComparable<T>
        {
            int left = ar.Length - 1;
            Func<int, int, int> compForCalcNextPermutation = (i, j) =>
            {
                return ar[i].CompareTo(ar[j]);
            };
            while (0 < left && compForCalcNextPermutation(left - 1, left) >= 0)
            {
                left--;
            }
            if (left == 0)
            {
                return false;
            }
            int right = ar.Length - 1;
            while (compForCalcNextPermutation(right, left - 1) <= 0)
            {
                right--;
            }
            T tmp = ar[left - 1];
            ar[left - 1] = ar[right];
            ar[right] = tmp;
            Array.Reverse(ar, left, ar.Length - left);
            return true;
        }

        bool isReactive = false; // TODO: reactive check !!
    }

    class Point
    {
        public int x, y;
    }

    class Writer : IDisposable
    {
        System.IO.TextWriter writer;
        StringBuilder sb;
        bool isReactive;
        public Writer(string path) : this(new System.IO.StreamWriter(path))
        {
        }
        public Writer(bool isReactive) : this(null, isReactive)
        {
        }
        public Writer(System.IO.TextWriter writer = null, bool isReactive = false)
        {
            this.writer = (writer ?? Console.Out);
            if (!(this.isReactive = isReactive))
            {
                this.sb = new StringBuilder();
            }
        }
        public void Dispose()
        {
            if (!isReactive)
                this.writer.Write(sb.ToString());
            if (!this.writer.Equals(Console.Out))
                this.writer.Dispose();
        }
        public void Write(object val)
        {
            if (this.isReactive)
            {
                this.writer.Write(val.ToString());
                this.writer.Flush();
            }
            else
                this.sb.Append(val.ToString());
        }
        public void Write(string format, params object[] vals)
        {
            if (this.isReactive)
            {
                this.writer.Write(format, vals);
                this.writer.Flush();
            }
            else
                this.sb.AppendFormat(format, vals);
        }
        public void WriteLine(object val)
        {
            this.Write(val.ToString() + System.Environment.NewLine);
        }
        public void WriteLine(string format, params object[] vals)
        {
            this.Write(format + System.Environment.NewLine, vals);
        }
    }

    class Scanner : IDisposable
    {
        Queue<string> buffer;
        char[] sep;
        System.IO.TextReader reader;
        public Scanner(string path) : this(new System.IO.StreamReader(path))
        {
        }
        public Scanner(System.IO.TextReader reader = null)
        {
            this.buffer = new Queue<string>();
            this.sep = new char[] { ' ' };
            this.reader = (reader ?? Console.In);
        }
        private void CheckBuffer()
        {
            if (this.buffer.Count == 0)
            {
                string str = null;
                while (string.IsNullOrEmpty(str))
                {
                    str = this.reader.ReadLine();
                }
                string[] strArray = str.Split(this.sep);
                foreach (string elStr in strArray)
                {
                    this.buffer.Enqueue(elStr);
                }
            }
        }

        public void Dispose()
        {
            if (!this.reader.Equals(Console.In))
                this.reader.Dispose();
        }

        public string Next
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Dequeue();
            }
        }

        public int NextInt
        {
            get
            {
                return int.Parse(this.Next);
            }
        }
        public double NextDouble
        {
            get
            {
                return double.Parse(this.Next);
            }
        }

        public long NextLong
        {
            get
            {
                return long.Parse(this.Next);
            }
        }
        public bool IsEmpty
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Count == 0;
            }
        }
    }
}