# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1106744 | fryingduc | Hotspot (NOI17_hotspot) | C++17 | 571 ms | 1360 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;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
const int maxn = 5005;
int n, m, k;
vector<int> g[maxn];
int d[maxn], rev_d[maxn];
long long cnt[maxn], rev_cnt[maxn];
long double f[maxn];
void bfs(int src, int d[], long long cnt[]) {
for(int i = 1; i <= n; ++i) {
d[i] = 1e9;
cnt[i] = 0;
}
queue<int> q;
q.push(src);
d[src] = 0, cnt[src] = 1;
while(!q.empty()) {
int u = q.front();
q.pop();
for(auto v:g[u]) {
# | 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... |