結果

問題 No.3005 トレミーの問題
ユーザー KumaTachiRen
提出日時 2025-01-17 21:34:11
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 43 ms / 2,000 ms
コード長 7,583 bytes
コンパイル時間 7,864 ms
コンパイル使用メモリ 170,724 KB
実行使用メモリ 186,480 KB
最終ジャッジ日時 2025-01-17 21:34:40
合計ジャッジ時間 10,152 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (104 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using Lib;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        ReadArray(out (long x, long y)[] xy, 4, () => (rl, rl));

        const double EPS = 0.0000001;
        double Angle((long x, long y) p0, (long x, long y) p1, (long x, long y) p2)
        {
            double a0 = Math.Atan2(p0.y - p2.y, p0.x - p2.x);
            double a1 = Math.Atan2(p1.y - p2.y, p1.x - p2.x);
            double r = a1 - a0;
            while (r < 0) r += Math.PI * 2;
            while (r >= Math.PI * 2 - EPS) r -= Math.PI * 2;
            return r;
        }

        var perm = new Permutation(4);
        bool ans = false;
        do
        {
            var p0 = xy[perm[0]];
            var p1 = xy[perm[1]];
            var p2 = xy[perm[2]];
            var p3 = xy[perm[3]];
            double a0 = Angle(p0, p1, p2);
            double a1 = Angle(p0, p1, p3);
            if (a0 < EPS || a0 > Math.PI - EPS) continue;
            if (a1 < EPS || a1 > Math.PI - EPS) continue;
            ans |= Math.Abs(a0 - a1) < EPS;
        } while (perm.Next());
        YN(ans);
    }

#pragma warning disable CS0162
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162

    const int IINF = 1 << 30;
    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
    void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
    void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
    void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
    void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}

static class Program
{
    static public void Main(string[] args)
    {
        SourceExpander.Expander.Expand();
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace Lib{public class Permutation{int n;int[]p;public Permutation(int[]_p){n=_p.Length;p=(int[])_p.Clone();}public Permutation(int _n){n=_n;p=new int[n];for(int i=0;i<n;i++)p[i]=i;}public bool Next(){for(int i=n-2;i>=0;i--){if(p[i]<p[i+1]){int j=n-1;while(!(p[i]<p[j]))j--;Swap(i,j);for(int k=1;i+k<n-k;k++)Swap(i+k,n-k);return true;}}for(int i=0;i<n-1-i;i++)Swap(i,n-1-i);return false;}public bool Prev(){for(int i=n-2;i>=0;i--){if(p[i]>p[i+1]){int j=n-1;while(!(p[i]>p[j]))j--;Swap(i,j);for(int k=1;i+k<n-k;k++)Swap(i+k,n-k);return true;}}for(int i=0;i<n-1-i;i++)Swap(i,n-1-i);return false;}public int this[int k]{get{if(k<0||k>=n)throw new IndexOutOfRangeException();return p[k];}}[MethodImpl(256)]void Swap(int i,int j)=>(p[i],p[j])=(p[j],p[i]);public static bool Next<T>(ref T[]p)where T:IComparable<T>{int n=p.Length;for(int i=n-2;i>=0;i--){if(p[i].CompareTo(p[i+1])<0){int j=n-1;while(!(p[i].CompareTo(p[j])<0))j--;(p[i],p[j])=(p[j],p[i]);for(int k=1;i+k<n-k;k++)(p[i+k],p[n-k])=(p[n-k],p[i+k]);return true;}}for(int i=0;i<n-1-i;i++)(p[i],p[n-1-i])=(p[n-1-i],p[i]);return false;}public static bool Prev<T>(ref T[]p)where T:IComparable<T>{int n=p.Length;for(int i=n-2;i>=0;i--){if(p[i].CompareTo(p[i+1])>0){int j=n-1;while(!(p[i].CompareTo(p[j])>0))j--;(p[i],p[j])=(p[j],p[i]);for(int k=1;i+k<n-k;k++)(p[i+k],p[n-k])=(p[n-k],p[i+k]);return true;}}for(int i=0;i<n-1-i;i++)(p[i],p[n-1-i])=(p[n-1-i],p[i]);return false;}}}
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(b^'0');return ng?-ret:ret;}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b;do b=Read();while(b<'0'||'9'<b);for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(ulong)(b^'0');return ret;}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander
0