# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587494 | gg123_pe | Hotspot (NOI17_hotspot) | C++14 | 1615 ms | 338000 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;
typedef long double ld;
#define f(i,a,b) for(ll i = a; i < b; i++)
#define fa(i,a,b) for(ll i = a; i >= b; i--)
const int N = 5005;
const int inf = 2e9;
int a[N], b[N], n, m, d[N][N];
ld c[N][N];
vector <int> adj[N];
void dfs(int u){
f(i,1,n+1) d[u][i] = inf;
d[u][u] = 0;
queue <int> q;
q.push(u);
c[u][u] = 1;
while(!q.empty()){
int v = q.front(); q.pop();
for(int f: adj[v]){
# | 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... |