結果

問題 No.2602 Real Collider
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-01-12 21:55:31
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 204 ms / 2,000 ms
コード長 15,810 bytes
コンパイル時間 10,160 ms
コンパイル使用メモリ 168,140 KB
実行使用メモリ 211,484 KB
最終ジャッジ日時 2024-09-27 22:03:44
合計ジャッジ時間 22,096 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
23,404 KB
testcase_01 AC 44 ms
23,680 KB
testcase_02 AC 44 ms
23,424 KB
testcase_03 AC 44 ms
24,064 KB
testcase_04 AC 44 ms
23,808 KB
testcase_05 AC 44 ms
24,064 KB
testcase_06 AC 45 ms
24,192 KB
testcase_07 AC 44 ms
24,192 KB
testcase_08 AC 44 ms
24,064 KB
testcase_09 AC 44 ms
24,064 KB
testcase_10 AC 204 ms
48,896 KB
testcase_11 AC 123 ms
47,360 KB
testcase_12 AC 71 ms
25,336 KB
testcase_13 AC 61 ms
25,216 KB
testcase_14 AC 70 ms
25,216 KB
testcase_15 AC 103 ms
41,856 KB
testcase_16 AC 131 ms
48,896 KB
testcase_17 AC 135 ms
49,024 KB
testcase_18 AC 63 ms
25,216 KB
testcase_19 AC 65 ms
25,216 KB
testcase_20 AC 149 ms
49,024 KB
testcase_21 AC 64 ms
25,344 KB
testcase_22 AC 65 ms
25,344 KB
testcase_23 AC 61 ms
25,216 KB
testcase_24 AC 65 ms
25,088 KB
testcase_25 AC 66 ms
25,344 KB
testcase_26 AC 103 ms
42,076 KB
testcase_27 AC 66 ms
25,216 KB
testcase_28 AC 132 ms
48,896 KB
testcase_29 AC 65 ms
25,344 KB
testcase_30 AC 67 ms
25,344 KB
testcase_31 AC 130 ms
49,024 KB
testcase_32 AC 121 ms
47,232 KB
testcase_33 AC 134 ms
49,024 KB
testcase_34 AC 132 ms
49,024 KB
testcase_35 AC 100 ms
41,472 KB
testcase_36 AC 103 ms
41,344 KB
testcase_37 AC 137 ms
48,896 KB
testcase_38 AC 137 ms
49,024 KB
testcase_39 AC 133 ms
49,024 KB
testcase_40 AC 93 ms
38,876 KB
testcase_41 AC 139 ms
48,896 KB
testcase_42 AC 124 ms
49,024 KB
testcase_43 AC 128 ms
48,896 KB
testcase_44 AC 144 ms
49,280 KB
testcase_45 AC 114 ms
45,292 KB
testcase_46 AC 108 ms
44,288 KB
testcase_47 AC 134 ms
49,024 KB
testcase_48 AC 120 ms
46,848 KB
testcase_49 AC 110 ms
43,776 KB
testcase_50 AC 95 ms
39,808 KB
testcase_51 AC 98 ms
40,448 KB
testcase_52 AC 85 ms
35,820 KB
testcase_53 AC 130 ms
49,152 KB
testcase_54 AC 114 ms
45,440 KB
testcase_55 AC 120 ms
48,000 KB
testcase_56 AC 123 ms
47,488 KB
testcase_57 AC 119 ms
45,952 KB
testcase_58 AC 76 ms
33,280 KB
testcase_59 AC 128 ms
48,896 KB
testcase_60 AC 124 ms
48,128 KB
testcase_61 AC 106 ms
42,624 KB
testcase_62 AC 132 ms
49,024 KB
testcase_63 AC 139 ms
48,896 KB
testcase_64 AC 149 ms
48,896 KB
testcase_65 AC 104 ms
42,624 KB
testcase_66 AC 135 ms
49,024 KB
testcase_67 AC 91 ms
38,656 KB
testcase_68 AC 100 ms
40,704 KB
testcase_69 AC 86 ms
35,968 KB
testcase_70 AC 92 ms
38,492 KB
testcase_71 AC 103 ms
42,112 KB
testcase_72 AC 127 ms
49,024 KB
testcase_73 AC 114 ms
46,080 KB
testcase_74 AC 127 ms
49,024 KB
testcase_75 AC 136 ms
48,896 KB
testcase_76 AC 130 ms
49,024 KB
testcase_77 AC 134 ms
48,896 KB
testcase_78 AC 144 ms
49,024 KB
testcase_79 AC 134 ms
48,896 KB
testcase_80 AC 141 ms
211,484 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (104 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using System;
using System.ComponentModel;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;
using static OutputLib;

using ModInt = ModInt998244353;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    void Solve()
    {
        int n = ri;

        var x0 = new BigInteger[3];
        var y0 = new BigInteger[3];
        for (int i = 0; i < 3; i++)
        {
            x0[i] = ri * 2;
            y0[i] = ri * 2;
        }

        BigInteger Dist(BigInteger x1, BigInteger y1, BigInteger x2, BigInteger y2)
        {
            var dx = x1 - x2; var dy = y1 - y2;
            return dx * dx + dy * dy;
        }

        BigInteger cx = 0, cy = 0, q = 1;
        BigInteger r = long.MaxValue;
        bool f = false;
        for (int i = 0; i < 3; i++)
        {
            int j = (i + 1) % 3;
            var d = Dist(x0[i], y0[i], x0[j], y0[j]) / 4;
            int k = (j + 1) % 3;
            var x = (x0[i] + x0[j]) / 2; var y = (y0[i] + y0[j]) / 2;
            if (Dist(x0[k], y0[k], x, y) <= d && d < r)
            {
                r = d;
                cx = x;
                cy = y;
                f = true;
            }
        }
        if (!f)
        {
            var d = new BigInteger[3];
            for (int i = 0; i < 3; i++)
            {
                int j = (i + 1) % 3;
                d[(i + 2) % 3] = Dist(x0[i], y0[i], x0[j], y0[j]);
            }
            BigInteger s = 0;
            for (int i = 0; i < 3; i++) s += d[i];
            for (int i = 0; i < 3; i++)
            {
                cx += d[i] * (s - 2 * d[i]) * x0[i];
                cy += d[i] * (s - 2 * d[i]) * y0[i];
            }
            q = s * s;
            for (int i = 0; i < 3; i++) q -= 2 * d[i] * d[i];
            r = Dist(cx, cy, x0[0] * q, y0[0] * q);
            for (int i = 0; i < 3; i++) Debug.Assert(r == Dist(cx, cy, x0[i] * q, y0[i] * q));
        }

        for (int i = 0; i < n; i++)
        {
            BigInteger x = rl * 2, y = rl * 2;
            Yn(Dist(x * q, y * q, cx, cy) <= r);
        }
    }

    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    (int, int) ri2 { [MethodImpl(256)] get => (ri, ri); }
    (int, int, int) ri3 { [MethodImpl(256)] get => (ri, ri, ri); }
    (int, int, int, int) ri4 { [MethodImpl(256)] get => (ri, ri, ri, ri); }
    (int, int, int, int, int) ri5 { [MethodImpl(256)] get => (ri, ri, ri, ri, ri); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    (long, long) rl2 { [MethodImpl(256)] get => (rl, rl); }
    (long, long, long) rl3 { [MethodImpl(256)] get => (rl, rl, rl); }
    (long, long, long, long) rl4 { [MethodImpl(256)] get => (rl, rl, rl, rl); }
    (long, long, long, long, long) rl5 { [MethodImpl(256)] get => (rl, rl, rl, rl, rl); }
    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());
}
public static class Functions { [MethodImpl(256)] public static int Popcount(ulong x) { x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL); x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL); x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL); x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL); x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL); x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL); return (int)x; } [MethodImpl(256)] public static int Popcount(long x) { x = (x & 0x5555555555555555L) + ((x >> 1) & 0x5555555555555555L); x = (x & 0x3333333333333333L) + ((x >> 2) & 0x3333333333333333L); x = (x & 0x0f0f0f0f0f0f0f0fL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fL); x = (x & 0x00ff00ff00ff00ffL) + ((x >> 8) & 0x00ff00ff00ff00ffL); x = (x & 0x0000ffff0000ffffL) + ((x >> 16) & 0x0000ffff0000ffffL); x = (x & 0x00000000ffffffffL) + ((x >> 32) & 0x00000000ffffffffL); return (int)x; } [MethodImpl(256)] public static int Popcount(int x) { x = (x & 0x55555555) + ((x >> 1) & 0x55555555); x = (x & 0x33333333) + ((x >> 2) & 0x33333333); x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f); x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff); x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff); return x; } [MethodImpl(256)] public static int Ctz(long x) { if (x == 0) return -1; return Popcount((ulong)((x & -x) - 1)); } [MethodImpl(256)] public static int CeilPow2(int n) { int x = 0; while ((1 << x) < n) x++; return x; } [MethodImpl(256)] public static int SafeMod(int x, int m) { int r = x % m; return r < 0 ? r + Math.Abs(m) : r; } [MethodImpl(256)] public static long SafeMod(long x, long m) { long r = x % m; return r < 0 ? r + Math.Abs(m) : r; } [MethodImpl(256)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int Sign(double x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; } [MethodImpl(256)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1; [MethodImpl(256)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b; [MethodImpl(256)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static uint Gcd(uint a, uint b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static ulong Gcd(ulong a, ulong b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static (long x, long y, long g) ExtGcd(long a, long b) { if (b == 0) return (Sign(a), 0, Math.Abs(a)); long c = SafeMod(a, b); var (x2, y2, g) = ExtGcd(b, c); long x = SafeMod(y2, b); long y = (g - a * x) / b; return (x, y, g); } [MethodImpl(256)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; } [MethodImpl(256)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(256)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(256)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; } [MethodImpl(256)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; } [MethodImpl(256)] public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => Sign(t - val), l, r); [MethodImpl(256)] public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => t - val, l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, T val, int l = -1, int r = -1) where T : IComparable<T> => LowerBound(arr.AsSpan(), t => t.CompareTo(val), l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), comp, l, r); [MethodImpl(256)] public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1) { if (data.Length == 0) return -1; if (l == -1) l = 0; if (r == -1) r = data.Length; while (l < r) { int x = (l + r) / 2; if (comp(data[x]) < 0) l = x + 1; else r = x; } return l; } [MethodImpl(256)] public static string ToBase2(long v, int digit = -1) { if (digit == -1) { digit = 0; while ((v >> digit) > 0) digit++; } var c = new string[digit]; for (int i = 0; i < digit; i++) c[digit - 1 - i] = ((v >> i) & 1) == 0 ? "0" : "1"; return string.Join("", c); } [MethodImpl(256)] public static string ToBaseN(long v, int n, int digit = -1) { if (digit == -1) { digit = 0; long pow = 1; while (v >= pow) { digit++; pow *= n; } } var c = new int[digit]; for (int i = 0; i < digit; i++, v /= n) c[digit - 1 - i] = (int)(v % n); return string.Join("", c); } }
public 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 = 0; 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; 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'; } } [MethodImpl(256)] public ulong UInteger() { ulong ret = 0; byte b = 0; do b = read(); while (b < '0' || '9' < b); for (; true; b = read()) { if (b < '0' || '9' < b) return ret; else ret = ret * 10 + b - '0'; } } [MethodImpl(256)] public double Double() => double.Parse(Scan()); } 
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) { int sz1 = a.GetLength(0); int sz2 = a.GetLength(1); for (int i = 0; i < sz1; i++) { var b = new T[sz2]; for (int j = 0; j < sz2; j++) b[j] = a[i, j]; WriteJoin(" ", b); } } [MethodImpl(256)] public static void WriteMat<T>(T[][] a) { for (int i = 0; i < a.Length; i++) WriteJoin(" ", a[i]); } [MethodImpl(256)] public static void Write(object t) => Console.WriteLine(t.ToString()); [MethodImpl(256)] public static void Write(string str) => Console.WriteLine(str); [MethodImpl(256)] public static void Write(string str, object arg1) => Console.WriteLine(str, arg1); [MethodImpl(256)] public static void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2); [MethodImpl(256)] public static void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3); [MethodImpl(256)] public static void Write(string str, params object[] arg) => Console.WriteLine(str, arg); [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"); } 
public struct ModInt998244353 : IEquatable<ModInt998244353> { internal readonly uint _v; public int Value => (int)_v; public const int Mod = 998244353; public static ModInt998244353 Zero => new ModInt998244353(0u); public static ModInt998244353 One => new ModInt998244353(1u); [MethodImpl(256)] public static ModInt998244353 Raw(int v) { var u = unchecked((uint)v); return new ModInt998244353(u); } [MethodImpl(256)] public ModInt998244353(long v) : this(Round(v)) { } [MethodImpl(256)] public ModInt998244353(ulong v) : this((uint)(v % Mod)) { } [MethodImpl(256)] private ModInt998244353(uint v) => _v = v; [MethodImpl(256)] private static uint Round(long v) { var x = v % Mod; if (x < 0) x += Mod; return (uint)x; } [MethodImpl(256)] public static ModInt998244353 operator ++(ModInt998244353 v) { var x = v._v + 1; if (x == Mod) x = 0; return new ModInt998244353(x); } [MethodImpl(256)] public static ModInt998244353 operator --(ModInt998244353 v) { var x = v._v; if (x == 0) x = Mod; return new ModInt998244353(x - 1); } [MethodImpl(256)] public static ModInt998244353 operator +(ModInt998244353 lhs, ModInt998244353 rhs) { var v = lhs._v + rhs._v; if (v >= Mod) v -= Mod; return new ModInt998244353(v); } [MethodImpl(256)] public static ModInt998244353 operator -(ModInt998244353 lhs, ModInt998244353 rhs) { unchecked { var v = lhs._v - rhs._v; if (v >= Mod) v += Mod; return new ModInt998244353(v); } } [MethodImpl(256)] public static ModInt998244353 operator *(ModInt998244353 lhs, ModInt998244353 rhs) => new ModInt998244353((uint)((ulong)lhs._v * rhs._v % Mod)); [MethodImpl(256)] public static ModInt998244353 operator /(ModInt998244353 lhs, ModInt998244353 rhs) => new ModInt998244353((uint)((ulong)lhs._v * Inv(rhs._v) % Mod)); [MethodImpl(256)] public static ModInt998244353 operator +(ModInt998244353 v) => v; [MethodImpl(256)] public static ModInt998244353 operator -(ModInt998244353 v) => new ModInt998244353(v._v == 0 ? 0 : Mod - v._v); [MethodImpl(256)] public static bool operator ==(ModInt998244353 lhs, ModInt998244353 rhs) => lhs._v == rhs._v; [MethodImpl(256)] public static bool operator !=(ModInt998244353 lhs, ModInt998244353 rhs) => lhs._v != rhs._v; [MethodImpl(256)] public static implicit operator ModInt998244353(int v) => new ModInt998244353(v); [MethodImpl(256)] public static implicit operator ModInt998244353(uint v) => new ModInt998244353((long)v); [MethodImpl(256)] public static implicit operator ModInt998244353(long v) => new ModInt998244353(v); [MethodImpl(256)] public static implicit operator ModInt998244353(ulong v) => new ModInt998244353(v); [MethodImpl(256)] public static implicit operator long(ModInt998244353 v) => v._v; [MethodImpl(256)] public static implicit operator ulong(ModInt998244353 v) => v._v; [MethodImpl(256)] public ModInt998244353 Pow(long n) { var x = this; var r = new ModInt998244353(1U); while (n > 0) { if ((n & 1) > 0) r *= x; x *= x; n >>= 1; } return r; } [MethodImpl(256)] public ModInt998244353 Inv() => new ModInt998244353(Inv(_v)); [MethodImpl(256)] static ulong Inv(ulong x) { long u = Mod, xu = 1, yu = 0, v = (long)x, xv = 0, yv = 1; while (v != 0) { long w = SafeMod(u, v); long q = (u - w) / v; long xw = xu - xv * q; long yw = yu - yv * q; u = v; xu = xv; yu = yv; v = w; xv = xw; yv = yw; } return (ulong)(yu < 0 ? yu + Mod : yu); } [MethodImpl(256)] static long SafeMod(long x, long m) { long r = x % m; if (r < 0) r += m; return r; } [MethodImpl(256)] public override string ToString() => _v.ToString(); [MethodImpl(256)] public string ToString(string format, IFormatProvider formatProvider) => _v.ToString(format, formatProvider); [MethodImpl(256)] public override bool Equals(object obj) => obj is ModInt998244353 m && Equals(m); [MethodImpl(256)] public bool Equals(ModInt998244353 other) => _v == other._v; [MethodImpl(256)] public override int GetHashCode() => _v.GetHashCode(); }
0