# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210003 | Alexa2001 | Hotspot (NOI17_hotspot) | C++17 | 666 ms | 61816 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;
///10:23
const int Nmax = 5005;
long double ans[Nmax];
bool used[Nmax];
vector<int> v[Nmax];
int dist[Nmax][Nmax], pos[Nmax][Nmax], A[Nmax], B[Nmax];
int n, m, k;
void doo(int node, int dist[], int pos[])
{
int i;
for(i=0; i<n; ++i) dist[i] = -1;
dist[node] = 0;
pos[node] = 1;
queue<int> q;
q.push(node);
while(q.size())
{
node = q.front();
q.pop();
# | 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... |