結果

問題 No.2602 Real Collider
ユーザー Maksym ShcherbanMaksym Shcherban
提出日時 2024-01-12 23:19:57
言語 JavaScript
(node v21.7.1)
結果
WA  
実行時間 -
コード長 4,890 bytes
コンパイル時間 148 ms
コンパイル使用メモリ 6,692 KB
実行使用メモリ 69,808 KB
最終ジャッジ日時 2024-09-28 00:05:01
合計ジャッジ時間 62,148 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
38,528 KB
testcase_01 AC 66 ms
40,792 KB
testcase_02 AC 69 ms
38,656 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 64 ms
38,528 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 795 ms
58,328 KB
testcase_12 AC 918 ms
59,768 KB
testcase_13 AC 648 ms
55,984 KB
testcase_14 AC 938 ms
59,672 KB
testcase_15 AC 688 ms
56,584 KB
testcase_16 AC 861 ms
59,892 KB
testcase_17 AC 928 ms
59,368 KB
testcase_18 AC 793 ms
57,860 KB
testcase_19 AC 839 ms
59,560 KB
testcase_20 AC 1,000 ms
60,844 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 785 ms
58,220 KB
testcase_25 AC 827 ms
60,364 KB
testcase_26 AC 698 ms
57,248 KB
testcase_27 AC 870 ms
60,720 KB
testcase_28 AC 896 ms
59,932 KB
testcase_29 WA -
testcase_30 AC 849 ms
60,076 KB
testcase_31 AC 861 ms
59,884 KB
testcase_32 AC 791 ms
57,912 KB
testcase_33 AC 867 ms
60,192 KB
testcase_34 AC 871 ms
59,896 KB
testcase_35 AC 692 ms
57,128 KB
testcase_36 AC 686 ms
57,004 KB
testcase_37 AC 890 ms
59,216 KB
testcase_38 AC 919 ms
59,796 KB
testcase_39 AC 895 ms
59,732 KB
testcase_40 AC 637 ms
55,932 KB
testcase_41 AC 970 ms
60,244 KB
testcase_42 AC 843 ms
59,800 KB
testcase_43 AC 865 ms
59,840 KB
testcase_44 AC 962 ms
60,236 KB
testcase_45 AC 755 ms
57,468 KB
testcase_46 AC 737 ms
57,044 KB
testcase_47 AC 913 ms
59,392 KB
testcase_48 AC 789 ms
57,860 KB
testcase_49 AC 737 ms
59,260 KB
testcase_50 AC 651 ms
55,996 KB
testcase_51 AC 669 ms
56,328 KB
testcase_52 AC 552 ms
51,928 KB
testcase_53 AC 864 ms
60,372 KB
testcase_54 AC 761 ms
57,496 KB
testcase_55 AC 845 ms
58,388 KB
testcase_56 AC 787 ms
58,220 KB
testcase_57 AC 787 ms
57,976 KB
testcase_58 AC 468 ms
50,732 KB
testcase_59 AC 840 ms
60,096 KB
testcase_60 AC 817 ms
58,320 KB
testcase_61 AC 723 ms
56,872 KB
testcase_62 AC 902 ms
62,164 KB
testcase_63 AC 931 ms
59,888 KB
testcase_64 AC 1,050 ms
60,672 KB
testcase_65 AC 710 ms
57,128 KB
testcase_66 AC 895 ms
59,224 KB
testcase_67 AC 631 ms
56,160 KB
testcase_68 AC 674 ms
56,216 KB
testcase_69 AC 556 ms
52,420 KB
testcase_70 AC 630 ms
56,164 KB
testcase_71 AC 735 ms
57,004 KB
testcase_72 AC 854 ms
60,188 KB
testcase_73 AC 755 ms
57,980 KB
testcase_74 AC 910 ms
60,344 KB
testcase_75 AC 883 ms
61,632 KB
testcase_76 AC 837 ms
59,912 KB
testcase_77 AC 846 ms
59,716 KB
testcase_78 AC 933 ms
60,292 KB
testcase_79 AC 874 ms
60,180 KB
testcase_80 AC 991 ms
59,972 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class Point {
    constructor(x, y) {
        this.x = x;
        this.y = y;
    }
}
class Circle {
    constructor(x, y, r) {
        this.x = x;
        this.y = y;
        this.r = r;
    }
}
/*
 * Returns the smallest circle that encloses all the given points. Runs in expected O(n) time, randomized.
 * Note: If 0 points are given, null is returned. If 1 point is given, a circle of radius 0 is returned.
 */
// Initially: No boundary points known
function makeCircle(points) {
    // Clone list to preserve the caller's data, do Durstenfeld shuffle
    let shuffled = points.slice();
    for (let i = points.length - 1; i >= 0; i--) {
        let j = Math.floor(Math.random() * (i + 1));
        j = Math.max(Math.min(j, i), 0);
        const temp = shuffled[i];
        shuffled[i] = shuffled[j];
        shuffled[j] = temp;
    }
    // Progressively add points to circle or recompute circle
    let c = null;
    shuffled.forEach((p, i) => {
        if (c === null || !isInCircle(c, p))
            c = makeCircleOnePoint(shuffled.slice(0, i + 1), p);
    });
    return c;
}
// One boundary point known
function makeCircleOnePoint(points, p) {
    let c = new Circle(p.x, p.y, 0);
    points.forEach((q, i) => {
        if (!isInCircle(c, q)) {
            if (c.r == 0)
                c = makeDiameter(p, q);
            else
                c = makeCircleTwoPoints(points.slice(0, i + 1), p, q);
        }
    });
    return c;
}
// Two boundary points known
function makeCircleTwoPoints(points, p, q) {
    const circ = makeDiameter(p, q);
    let left = null;
    let right = null;
    // For each point not in the two-point circle
    for (const r of points) {
        if (isInCircle(circ, r))
            continue;
        // Form a circumcircle and classify it on left or right side
        const cross = crossProduct(p.x, p.y, q.x, q.y, r.x, r.y);
        const c = makeCircumcircle(p, q, r);
        if (c === null)
            continue;
        else if (cross > 0 && (left === null || crossProduct(p.x, p.y, q.x, q.y, c.x, c.y) > crossProduct(p.x, p.y, q.x, q.y, left.x, left.y)))
            left = c;
        else if (cross < 0 && (right === null || crossProduct(p.x, p.y, q.x, q.y, c.x, c.y) < crossProduct(p.x, p.y, q.x, q.y, right.x, right.y)))
            right = c;
    }
    // Select which circle to return
    if (left === null && right === null)
        return circ;
    else if (left === null && right !== null)
        return right;
    else if (left !== null && right === null)
        return left;
    else if (left !== null && right !== null)
        return left.r <= right.r ? left : right;
    else
        throw new Error("Assertion error");
}
function makeDiameter(a, b) {
    const cx = (a.x + b.x) / 2;
    const cy = (a.y + b.y) / 2;
    const r0 = distance(cx, cy, a.x, a.y);
    const r1 = distance(cx, cy, b.x, b.y);
    return new Circle(cx, cy, Math.max(r0, r1));
}
function makeCircumcircle(a, b, c) {
    // Mathematical algorithm from Wikipedia: Circumscribed circle
    const ox = (Math.min(a.x, b.x, c.x) + Math.max(a.x, b.x, c.x)) / 2;
    const oy = (Math.min(a.y, b.y, c.y) + Math.max(a.y, b.y, c.y)) / 2;
    const ax = a.x - ox;
    const ay = a.y - oy;
    const bx = b.x - ox;
    const by = b.y - oy;
    const cx = c.x - ox;
    const cy = c.y - oy;
    const d = (ax * (by - cy) + bx * (cy - ay) + cx * (ay - by)) * 2;
    if (d == 0)
        return null;
    const x = ox + ((ax * ax + ay * ay) * (by - cy) + (bx * bx + by * by) * (cy - ay) + (cx * cx + cy * cy) * (ay - by)) / d;
    const y = oy + ((ax * ax + ay * ay) * (cx - bx) + (bx * bx + by * by) * (ax - cx) + (cx * cx + cy * cy) * (bx - ax)) / d;
    const ra = distance(x, y, a.x, a.y);
    const rb = distance(x, y, b.x, b.y);
    const rc = distance(x, y, c.x, c.y);
    return new Circle(x, y, Math.max(ra, rb, rc));
}
/* Simple mathematical functions */
const MULTIPLICATIVE_EPSILON = 1 + 1e-14;
function isInCircle(c, p) {
    return c !== null && distance(p.x, p.y, c.x, c.y) <= c.r * MULTIPLICATIVE_EPSILON;
}
// Returns twice the signed area of the triangle defined by (x0, y0), (x1, y1), (x2, y2).
function crossProduct(x0, y0, x1, y1, x2, y2) {
    return (x1 - x0) * (y2 - y0) - (y1 - y0) * (x2 - x0);
}
function distance(x0, y0, x1, y1) {
    return Math.hypot(x0 - x1, y0 - y1);
}

function Main(input) {
  const lines = input.split('\n').map(x => x.trim()).filter(Boolean);
  const q = +lines[0];
  const [xa, ya, xb, yb, xc, yc] = lines[1].split(' ').map(Number);
  const circle = makeCircle([
    new Point(xa, ya),
    new Point(xb, yb),
    new Point(xc, yc),
  ]);
  for (let i = 0; i < q; i++) {
    const [x, y] = lines[2 + i].split(' ').map(Number);
    const d = Math.hypot(x - circle.x, y - circle.y);
    const result = d <= circle.r ? 'Yes' : 'No';
    console.log(result);
  }
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
0