# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980593 | SirLemonMeringue | Cyberland (APIO23_cyberland) | C++17 | 290 ms | 14408 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 "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 100010
#define INF 1e303
#include <vector>
vector<pair<int,int>> adj[MAX_N];
bool reachable[MAX_N];
double dist[MAX_N];
void dfs(int node, int specialNode){
reachable[node] = true;
if (node!=specialNode){
for(auto a : adj[node]){
if (!reachable[a.first]){
dfs(a.first,specialNode);
}
}
}
}
struct P {
int dest;
double dist;
bool moved = true;
bool operator< (P other) const {
return dist > other.dist;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |