提出 #41955901

---

ソースコード 拡げる

import std;

void read(T...)(string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}

void read_array(T)(string S, ref T[] arg) {
    arg = S.split.to!(T[]);
}

struct pair {
    int X;
    int Y;
    bool ok;
}

void main () {
    int N, D; read(readln, N, D);
    pair[] cod = new pair[](N);
    foreach (i; 0..N) {
        read(readln, cod[i].X, cod[i].Y);
        cod[i].ok = false;
    }
    // 初期条件
    cod[0].ok = true;

    DList!pair Que;
    Que.insertBack(cod[0]);
    while (!Que.empty) {
        pair target = Que.front; Que.removeFront;
        foreach (ref x; cod) {
            if (x.ok) {
                continue;
            }
            if (is_infected(target, x, D)) {
                x.ok = true;
                Que.insertBack(x);
            }
        }
    }

    // output
    foreach (x; cod) {
        if (x.ok) {
            writeln("Yes");
        } else {
            writeln("No");
        }
    }
}

bool is_infected (pair a, pair b, int D) {
    real dist = sqrt(cast(real)((a.X - b.X)^^2 + (a.Y - b.Y)^^2));
    if (dist <= D) {
        return true;
    }
    return false;
}

提出情報

ジャッジ結果