# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397850 | maomao90 | Hotspot (NOI17_hotspot) | C++14 | 812 ms | 1192 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 <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int n, m, k;
vector <int> adjList[5005];
int dist[5005], dist1[5005], times[5005], times1[5005];
queue <int> bfs;
double e[5005];
int ans = -1;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
int u, v; scanf("%d%d", &u, &v);
adjList[u].push_back(v);
adjList[v].push_back(u);
}
scanf("%d", &k);
for (int i = 0; i < k; i++) {
int a, b; scanf("%d%d", &a, &b);
for (int j = 0; j < n; j++) dist[j] = INF, times[j] = 0;
dist[a] = 0, times[a] = 1;
bfs.push(a);
while (!bfs.empty()) {
int u = bfs.front(); bfs.pop();
for (int v : adjList[u]) {
if (dist[v] > dist[u] + 1) {
dist[v] = dist[u] + 1;
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... |