# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587479 | NekoRolly | Hotspot (NOI17_hotspot) | C++17 | 514 ms | 62156 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;
typedef long long ll;
const int N = 5e3+4;
const int inf = 1e9;
int n,m,k;
int dis[N][N],dp[N][N];
vector<int> adj[N];
bool vis[N];
double val[N];
void bfs(int rt,int dis[],int dp[]){ queue<int> d;
if (vis[rt]) return;
for (int i=0; i<n; i++) dis[i] = inf;
dis[rt] = 0, dp[rt] = 1;
for (d.push(rt); d.size(); d.pop()){ int u = d.front();
for (int v : adj[u]){
if (dis[v] == inf){
dis[v] = dis[u] + 1; d.push(v);
}
if (dis[v] == dis[u] + 1) dp[v] += dp[u];
}
}
vis[rt] = 1;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
# | 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... |