/* http://usaco.org/index.php?page=viewproblem2&cpid=668 (create a free account) USACO 2016 December Silver Ques. 3: Moocast This code is not for Sololearn, I recommend onlinegdb.com or visual studio code Make a file named paint.in and put in: 4 1 3 5 5 4 3 7 2 1 6 1 1 Output: 3 I recommend not copying this code into USACO though it works cause you need to do it yourself. */ #include #include #include #include #include using namespace std; vector q; unordered_set visited; int loop; int tmp = 0; void dfs(vector > dist){ tmp++; int indx = q.back(); q.pop_back(); visited.insert(indx); for(int i = 0; i < loop; i++){ if(dist[indx][i] == 1 && visited.find(i) == visited.end()){ q.push_back(i); visited.insert(i); } } if (!q.empty()){ dfs(dist); } } int main() { ifstream fin("moocast.in"); ofstream fout("moocast.out"); fin >> loop; vector > dist(loop, vector(loop)); vector > cows; int x, y, p; for (int i = 0; i < loop; i++){ fin >> x >> y >> p; vector xyp {x, y, p * p}; cows.push_back(xyp); } for (int i = 0; i < loop; i++){ for(int j = 0; j < loop; j++){ if(((cows[i][0] - cows[j][0])*(cows[i][0] - cows[j][0]) + (cows[i][1] - cows[j][1]) * (cows[i][1] - cows[j][1]) )<= cows[i][2]){ dist[i][j] = 1; } else{ dist[i][j] = 0; } } } int result = 0; for(int c = 0; c

USACO #24: Moocast C++