Submission #773529

---

Source Code Expand

import std.stdio;
import std.algorithm;
import std.string;
import std.range;
import std.array;
import std.conv;
import std.complex;
import std.math;
import std.ascii;
import std.bigint;
import std.container;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

void main(){
    int n, m;
    readlnTo(n, m);
    auto e = new RedBlackTree!(int[], "a > b");
    foreach(i; iota(m)) {
        int a, b, y;
        readlnTo(a, b, y);
        e.insert([y, a-1, b-1]);
    }
    auto q = readInt();
    int[][] p;
    foreach(i; iota(q)) {
        int v, w;
        readlnTo(v, w);
        p ~= [w, v-1, i];
    }
    p.sort!("a > b")();
    auto ans = new int[](q);
    RedBlackTree!int[] c;
    foreach(i; iota(n)) {
        c ~= redBlackTree(i.to!int);
    }
    auto d = iota(n).array;
    foreach(i; iota(q)) {
        auto w = p[i][0];
        auto v = p[i][1];
        auto qi = p[i][2];
        while(!e.empty && w < e.front[0]) {
            auto a = e.front[1];
            auto b = e.front[2];
            e.removeFront();
            if(d[a] == d[b]) {
                continue;
            }
            if(c[d[a]].length < c[d[b]].length) {
                swap(a,b);
            }
            c[d[a]].insert(c[d[b]][]);
            foreach(cbi; c[d[b]]) {
                d[cbi] = d[a];
            }
        }
        ans[qi] = c[d[v]].length.to!int;
    }
    ans.each!(writeln);
}

Submission Info

Judge Result