# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619913 | PoonYaPat | Hotspot (NOI17_hotspot) | C++14 | 1553 ms | 338468 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;
int n,m,k,d[5001][5001],ans_node,x[2001],y[2001];
vector<int> adj[5001];
queue<int> q;
long double ans,cnt[5001][5001];
void bfs(int x) {
memset(d[x],0x3f,sizeof(d[x]));
q.push(x);
d[x][x]=0;
cnt[x][x]=1;
while (!q.empty()) {
int a=q.front();
q.pop();
for (auto s : adj[a]) {
if (d[x][s]>d[x][a]+1) {
d[x][s]=d[x][a]+1;
cnt[x][s]+=cnt[x][a];
q.push(s);
} else if (d[x][s]==d[x][a]+1) cnt[x][s]+=cnt[x][a];
}
}
}
int main() {
# | 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... |