# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976041 | nnin | Cyberland (APIO23_cyberland) | C++17 | 1262 ms | 18356 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 pid pair<int,double>
#define f first
#define s second
#define A pair<double, int>
vector<pid> adj[100005];
bool reach[100005];
int HH, N;
void dfs(int u) {
reach[u] = 1;
if(u==HH) return;
for(auto [v, w]:adj[u]) {
if(!reach[v]) dfs(v);
}
}
double mindis[100005];
void dij(vector<int> &arr) {
priority_queue<A, vector<A>, greater<A>> pq;
for(int i=0;i<N;i++) {
if(reach[i] && mindis[i]<1e18) pq.push({mindis[i], i});
}
vector<bool> vis(N, 0);
while(!pq.empty()) {
int u = pq.top().second;
# | 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... |