# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334471 | ncduy0303 | Hotspot (NOI17_hotspot) | C++17 | 827 ms | 250988 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 ar array
#define ll long long
const int MAX_N = 5e3 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
int n, m, k;
vector<int> adj[MAX_N];
ll dist[MAX_N][MAX_N], cnt[MAX_N][MAX_N];
double p[MAX_N];
void bfs(int s) {
queue<ar<int,2>> q;
q.push({0, s});
dist[s][s] = 0; cnt[s][s] = 1;
while (!q.empty()){
auto [d, u] = q.front(); q.pop();
if (d > dist[s][u]) continue;
for (int v : adj[u]) {
if (dist[s][v] > dist[s][u] + 1) {
dist[s][v] = dist[s][u] + 1;
cnt[s][v] = cnt[s][u];
q.push({dist[s][v], v});
}
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... |