# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105391 | whoknow | Hotspot (NOI17_hotspot) | C++17 | 685 ms | 1604 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>
#define ll long long
#define int long long
#define F first
#define S second
#define MAXN 5005
#define MAXEDGE 40005
#define ii pair<ll,int>
#define bit(i,j) ((i>>j)&1)
#define sz(i) (int)i.size()
#define endl '\n'
using namespace std;
int n, m, k;
vector<int>g[MAXN];
namespace sub1
{
double dp[MAXN];
ii d[MAXN][2];
bool visited[MAXN];
void bfs(int st, int j)
{
for(int i = 0; i <= n; i++)
{
visited[i] = 0;
d[i][j] = {1e18, 0};
}
queue<int>q;
q.push(st);
d[st][j] = {0, 1};
while(q.empty() != 1)
Compilation message (stderr)
# | 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... |