結果

問題 No.2602 Real Collider
ユーザー Maksym ShcherbanMaksym Shcherban
提出日時 2024-01-12 23:24:49
言語 JavaScript
(node v21.7.1)
結果
WA  
実行時間 -
コード長 4,873 bytes
コンパイル時間 44 ms
コンパイル使用メモリ 5,248 KB
実行使用メモリ 66,804 KB
最終ジャッジ日時 2024-09-28 00:12:33
合計ジャッジ時間 61,775 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
39,168 KB
testcase_01 AC 70 ms
39,424 KB
testcase_02 AC 65 ms
39,424 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 64 ms
39,296 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 779 ms
58,332 KB
testcase_12 AC 898 ms
59,776 KB
testcase_13 AC 636 ms
56,572 KB
testcase_14 AC 937 ms
60,344 KB
testcase_15 AC 682 ms
56,996 KB
testcase_16 AC 854 ms
59,260 KB
testcase_17 AC 914 ms
59,756 KB
testcase_18 AC 754 ms
58,060 KB
testcase_19 AC 822 ms
58,964 KB
testcase_20 AC 1,043 ms
60,712 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 795 ms
58,392 KB
testcase_25 AC 803 ms
58,668 KB
testcase_26 AC 693 ms
57,004 KB
testcase_27 AC 876 ms
59,296 KB
testcase_28 AC 883 ms
59,480 KB
testcase_29 WA -
testcase_30 AC 840 ms
58,992 KB
testcase_31 AC 900 ms
59,288 KB
testcase_32 AC 783 ms
58,508 KB
testcase_33 AC 855 ms
59,144 KB
testcase_34 AC 911 ms
59,168 KB
testcase_35 AC 689 ms
57,164 KB
testcase_36 AC 680 ms
56,908 KB
testcase_37 AC 895 ms
59,620 KB
testcase_38 AC 942 ms
59,740 KB
testcase_39 AC 889 ms
59,868 KB
testcase_40 AC 635 ms
56,396 KB
testcase_41 AC 965 ms
60,632 KB
testcase_42 AC 841 ms
59,108 KB
testcase_43 AC 844 ms
59,000 KB
testcase_44 AC 963 ms
60,780 KB
testcase_45 AC 782 ms
57,928 KB
testcase_46 AC 736 ms
57,636 KB
testcase_47 AC 932 ms
59,884 KB
testcase_48 AC 796 ms
58,228 KB
testcase_49 AC 723 ms
57,312 KB
testcase_50 AC 663 ms
56,300 KB
testcase_51 AC 676 ms
56,972 KB
testcase_52 AC 550 ms
51,872 KB
testcase_53 AC 848 ms
59,416 KB
testcase_54 AC 767 ms
57,996 KB
testcase_55 AC 803 ms
58,660 KB
testcase_56 AC 804 ms
58,508 KB
testcase_57 AC 768 ms
58,072 KB
testcase_58 AC 493 ms
51,032 KB
testcase_59 AC 862 ms
59,128 KB
testcase_60 AC 807 ms
58,668 KB
testcase_61 AC 705 ms
57,180 KB
testcase_62 AC 907 ms
59,312 KB
testcase_63 AC 927 ms
60,068 KB
testcase_64 AC 993 ms
61,128 KB
testcase_65 AC 737 ms
57,056 KB
testcase_66 AC 905 ms
59,480 KB
testcase_67 AC 634 ms
56,252 KB
testcase_68 AC 675 ms
56,736 KB
testcase_69 AC 566 ms
51,584 KB
testcase_70 AC 630 ms
56,384 KB
testcase_71 AC 699 ms
56,884 KB
testcase_72 AC 884 ms
58,904 KB
testcase_73 AC 753 ms
58,200 KB
testcase_74 AC 853 ms
59,188 KB
testcase_75 AC 906 ms
59,864 KB
testcase_76 AC 841 ms
58,976 KB
testcase_77 AC 834 ms
59,024 KB
testcase_78 AC 942 ms
60,112 KB
testcase_79 AC 894 ms
59,436 KB
testcase_80 AC 946 ms
60,368 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());
  const q = +lines[0];
  const [xa, ya, xb, yb, xc, yc] = lines[1].split(' ').map(Number);
  const circle = makeCircle([
    new Point(xc, yc),
    new Point(xb, yb),
    new Point(xa, ya),
  ]);
  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