# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436383 | VEGAnn | Fountain Parks (IOI21_parks) | C++17 | 556 ms | 41632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "parks.h"
#include <algorithm>
#include <queue>
#include <vector>
const int kMax = 200005;
std::vector<std::pair<int, int>> fountains[kMax];
bool isConnected(std::vector<std::vector<int>> adj) {
int n = adj.size();
std::vector<bool> vis(n);
std::queue<int> q;
q.push(0); vis[0] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v : adj[u]) {
if (vis[v]) continue;
vis[v] = true;
q.push(v);
}
}
return all_of(vis.begin(), vis.end(), [](bool visited) { return visited; });
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |