1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1100;  // 点数
const int MAXM = 1000100; // 边数
struct Edge {
    int to, next;
} edge[MAXM]; // 只有这里写的是 MAXM
int head[MAXN], tot;
int Low[MAXN], DFN[MAXN], Stack[MAXN], Belong[MAXN]; //Belong 数组的值是 1 ～ scc
int Index, top;
int scc; // 强连通分量的个数
bool Instack[MAXN];
int num[MAXN]; // 各个强连通分量包含点的个数，数组编号 1 ～ scc
// num 数组不一定需要，结合实际情况
void addedge(int u, int v) {
    edge[tot].to = v;
    edge[tot].next = head[u];
    head[u] = tot++;
}
void Tarjan(int u) {
    int v;
    Low[u] = DFN[u] = ++Index;
    Stack[top++] = u;
    Instack[u] = true;
    for (int i = head[u]; i != -1; i = edge[i].next) {
        v = edge[i].to;
        if (!DFN[v]) {
            Tarjan(v);
            if (Low[u] > Low[v])
                Low[u] = Low[v];
        } else if (Instack[v] && Low[u] > DFN[v])
            Low[u] = DFN[v];
    }
    if (Low[u] == DFN[u]) {
        scc++;
        do {
            v = Stack[--top];
            Instack[v] = false;
            Belong[v] = scc;
            num[scc]++;
        } while (v != u);
    }
}
void solve(int N) {
    memset(DFN, 0, sizeof(DFN));
    memset(Instack, false, sizeof(Instack));
    memset(num, 0, sizeof(num));
    Index = scc = top = 0;
    for (int i = 1; i <= N; i++)
        if (!DFN[i])
            Tarjan(i);
}
void init() {
    tot = 0;
    memset(head, -1, sizeof(head));
}
struct node {
    int x, y, r, c;
    bool in_boom(const node &other) const {
        return hypot(abs(x - other.x), abs(y - other.y)) <= r;
    }
};
node nodeList[1100];
int n;
void init_graph1() {
    init();
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (i == j) continue;
            if (nodeList[i].in_boom(nodeList[j]))
                addedge(i, j);
        }
    }
}
struct Graph {
    struct Node {
        int deg;
        int value;
    };
    Node node[MAXN];
    void init() {
        for (int i = 0; i < n + 5; ++i) {
            node[i].deg = 0;
            node[i].value = INT_MAX;
        }
    }
    void add_edge(int from, int to) {
        if (from != to)
            node[to].deg++;
    }
};
Graph graph;
int ans;
void tp_init() {
    graph.init();
    for (int i = 1; i <= n; ++i) {
        graph.node[Belong[i]].value = min(graph.node[Belong[i]].value, nodeList[i].c);
        for (int j = 1; j <= n; ++j) {
            if (i == j) continue;
            if (nodeList[i].in_boom(nodeList[j]))
                graph.add_edge(Belong[i], Belong[j]);
        }
    }
}
void tp() {
    ans = 0;
    tp_init();
    for (int i = 1; i <= scc; ++i) {
        if (graph.node[i].deg == 0) {
            ans += graph.node[i].value;
        }
    }
}
void solve() {
    int t;
    cin >> t;
    for (int ts = 0; ts < t; ++ts) {
        cin >> n;
        for (int i = 1; i <= n; ++i) {
            cin >> nodeList[i].x >> nodeList[i].y >> nodeList[i].r >> nodeList[i].c;
        }
        init_graph1();
        solve(n);
        tp();
        cout << "Case #" << ts + 1 << ": " << ans << endl;
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    long long test_index_for_debug = 1;
    char acm_local_for_debug;
    while (cin >> acm_local_for_debug) {
        cin.putback(acm_local_for_debug);
        if (test_index_for_debug > 20) {
            throw runtime_error("Check the stdin!!!");
        }
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    }
#else
    solve();
#endif
    return 0;
}